resolvent

563 Reputation

7 Badges

12 years, 89 days

MaplePrimes Activity


These are Posts that have been published by resolvent

I need to do the following. Suppose I have an array, c[ ]. I need to be able to specialize the elements of this array, and then later "clear" the elements, making them indeterminates again. I attempted to do this by creating a temporary holding array

i:='i': for i from 1 to 5 do d[i]:=c[i] end do;
i:='i': for i from 1 to 5 do c[i]:=i end do;
i:='i': for i from 1 to 5 do c[i]:=d[i] end do;
 

I expected and want the output to be

c[0] c[1] c[2] c[3] c[4] c[5] 1 2 3 4 5 c[0] c[1] c[2] c[3] c[4] c[5]

Here's a little test double loop

for i from 1 to 2 do

for j from 1 to 2 do

A[i,j]:=Binomial[i+j,i];

end do;

end do;

I would like to get ANYTHING to output. I get NOTHING, no matter WHAT variations I make. I can output when the loop is just a SINGLE nest. But, as soon as I embed that nest inside a second nest - NOTHING outputs.

 

Are there any commands which will allow me to create zero-based arrays in Maple?

I have a linear recursion, in 4 variables,

c[i,j,k,l]

I believe that the basic language in which the Maplesoft writers

code Maple is Java.  That means that the programmers at Maplesoft

had to have written TONS of Java classes, such as LinearAlgebra,

with lots of methods, such as resultants and determinants.

I would think they would have posted these Java classes into the Java library

I believe that the basic language in which the Maplesoft writers

code Maple is Java.  That means that the programmers at Maplesoft

had to have written TONS of Java classes, such as LinearAlgebra,

with lots of methods, such as resultants and determinants.

I would think they would have posted these Java classes into the Java library

1 2 3 Page 1 of 3