I am trying to write a program that contains multiple subroutine calls. I understand the placement of the single for-do loop to call the "lowest value" subroutine.
Here is program.
I am trying to generate a non-singular Matrix.
> if Determinant(127,KeyMatrix)=0 then
Basically, it asks Maple to return to
again if the current one if not invertible.
however, i have confused myself with RETURN and return
which is should i use?
Here is a strange behavior. I can understand that an integer and its float could be considered different, but the behavior should be the same in or out of a list. In addition it should not depend on the number of trailing zeros. In addition it should not depend on whether the integer is zero or not.
Recently I came across a page that was working with ifactor and it seems op now handles the operations a bit different now.
I have a fairly easy question but I am new to Maple and can't seem to figure it out w/ Maple help or anyone online resources. The problem is list all pairs of integers between 100 and 110 that are relatively prime. (I think) I can make it work by doing:
for k from 100 by 1 to 110 do gcd(k, 100), gcd(k, 101) . . . ; end do
but what if the problem had said pairs of integers from 100 to 1000? I don't understand how to iterate this function for more than one variable. Any help would be appreciated.
AUTHOR: Fereydoon Shekofte
v := ImportMatrix("F:\\xyz.txt", source = delimited, delimiter = " ", format = rectangular, datatype = float, transpose = false, skiplines = 0)
c := ImportMatrix("F:\\face.txt", source = delimited, delimiter = " ", format = rectangular, datatype = integer, transpose = false, skiplines = 0)
MatrixOptions(mi("format"), 'order = C_order'); mi("format")
f := Array(ArrayTools[Reshape](c[1 .. 3864], 1288, 3), order = C_order)
p := Array([seq(geom3d[point](p || i, v[i, 1], v[i, 2], v[i, 3]), i = 1 .. 1063)])
I have been working on a problem related to and using the famous Hadamard-Weierstrass Factorization Theorem (HWFT) for representing an entire function, E(z), with pre-defined zeroes, a(n), which go off to infinity. From HWFT one can represent any meromorphic function with pre-defined poles and zeroes as the ratio of two entire functions.
I am not interested in creating an entire function, but a function F(z) analytic on a disk centered at a pre-defined point such that the analytic continuation, A(z), of F(z) equals pre-defined values
I was reading the manual for Maple 13 and playing with some commands.
There is an equation: sin(x)=cos(x) and you can solve it by the solve command.
If you want all solutions, you just put there AllSolutions attribute and you get
I wonder why there is a tilde (~) behind "_Z1", because each integer satisfies
the equation (there is no need for an assumption).
Is it possible to compute possible addition chains for an integer in maple ??
If not, is there ANY software that will do it ??
It looks like, choosing a public key exponent with a smaller addition chain makes RSA decryption more efficient .. but how to know whether or not your exponent has a small addition chain!
Call me stupid but I still wasn't able to run the simple example in the maple help (see http://www.maplesoft.com/support/help/view.aspx?path=Define_external ) regarding calling external, precompiled Code (in my Case: c++).
How can I write a Maple program (using if..else) to find the first positive integer n (between 1 and 355)such that 355 can divide n*m (m is an integer, say 199) ? Thanks for your help.
I am trying to do the following sum
But I get this error message
"Error, invalid input: numtheory:-bigomega expects its 1st argument, x, to be of type integer, but received j."
I have tried
but this has no effect. I'm a bit puzzled why Bigomega doesn't work in summations as other Numtheory functions I've used have all worked.
I have an Nx3 Matrix A and each row looks like [integer,integer,*]. Matrix A acts like a function of two variables in the sense that the ordered pairs that you get be selecting the first two entries of each row are all distinct.
I would like a slick way to convert A to a Matrix B for which B[i,j]=* where * is the third entry in the unique row of A that looks like [i,j,*]. We can insert 0 for "blanks."
For example, if
1 3 a
1 4 d
1 1 b