How can i delay the evaluation in add. I want add to return

add( i, i=1..10)

                                    1+2+3+4+5+6+7+8+9+10

Now it returns

add(i, i=1..10)

Hi everyone!

Based on a recent post ( www.mapleprimes.com/forum/partialsubstitutionfrontendfreeze ) I have the following piece from a Maple worksheet, which I do not understand. First, I define A and B, where A is supposed to be substituted into B. If I have a "p" in A, then I get a "subs" as variable in B after frontend/curry with subs:

I am trying to set a timelimit for each loop, i.e.

for i from 1 to 10 do
    try
        timelimit(10,print(someproc())); #print result from the procedure being called
    catch "time expired":
        print(i, "time expire");
    end try;
end do;

However, it doesn't move to the next loop. It just terminates after completely the first loop (i.e. i=1).

If I am correct is the gradient of a the 3X3 tensor each element on the same row differentiated with each coordinate variable x, y ,z or is that a different operation?  I am unable to find the correct operation or I am not using the MAPLE command correctly to get an output.  I did load the Vector Calculus package.

What is my problem??

hey do u know a website where i can find information about gravel pacing and screen of a bore hole..i really can't find anything

Dear Community

I have a problem with units definition,I'm working with maple with kgf and tonf,

I read in help page this "A tonforce is defined  as the force of gravity on a short ton.......", so when I convert 1 tonf to kgf I get 907.18kgf,

I know this is OK, but since I don't use short ton in my country I would like to define in METRIC 1tonf = 1000kgf.

How can I do this? Here is a conversion table where it says 1tonf = 1000kgf (metric), not (short)

Hello,

I  would like to perform inverse Fourier transformation, but I get an error message::

restart;Fs:=75e6;Ts:=1/Fs;:g:=add(Dirac(t-k*Ts-6*Ts),k=1..4);G:=inttrans[fourier](g,t,w);
 

Error, (in gcd/gcdchrem1) input polynomials have too large a degree
 

I have Maple 13.

Thanks four your help in advance.

 

Hi, To see the body of a procedure in Optimization[Interactive] module, i use this method: interface(verboseproc = 2); kernelopts(opaquemodules = false); print(Optimization[Interactive][BC]); but "too many levels of recursion" Error occurs! Note that this method works for other procedures in this module, for example test it for Optimization[Interactive][InittoText]. What is problem for "BC"? and what is the solution? thanks.

Hello, I have an equation with 200 variables and I want to assign them to a 1 column by 200 rows matrix. My variables are named ΔX_i where i goes from 0 to 100. My Matrix is named Matrix.

I have tried something like that:

ΔX_i := Matrix(i) but I get "Error, unsupported type of index, i"

Any ideas?

Thank you
 

My teaching has maple 12 in class and provides files online of his lectures.  I tried opening the file using maple13 at home and when it opened it was a bunch of junk.  Is there a way to open older versions of maple on maple 13?

 

Thanks for the help,

 

Noelle

please help me here

we want a "remember table assignment for the first derivative evaluated at a point a1" for example

D(f)(a1):=0

but using this command maple creates a proc

for example using the command

f(a1):=0:

maple asks : 1. function def. 2. remember table assignment

but using D(f)(a1) :=0 just creates a function def.

Very likely there is a very simple solution to this question, but I searched Maple's help pages and this forum and didn't find a solution.  Probably because I don't use the correct English terms.

given two functions

(1) X := x->f1(t);

(2) Y := y->f2((t);

witth t = -infinity...infinity; f1 and f2 arbitrary functions of a parameter t

How I can get the function

Y := x->f3(x);

Situation:  I have multiple lists of the form [i$i=1..n,0$k] , where n is a positive integer and k is a nonegative integer.

 

Desired result:  For each list, produce a list of permutations of the list (as you would receive from combinat[permute]) such that in each permutation, the nonnegative integers in the list appear in ascending order from left to right and no two nonnegative integers are adjacent to one another. 

 

Here is a simple sequcnce of commands that execute without a problem:
restart;
eq1 := 5+3*x=0:
eq2 := 2+7*x-3*y-5*x*y=0:
x:=solve(eq1,x):
y:=solve(eq2,y):
lprint('x'=x,'y'=y);


x = -5/3, y = 29/16

If I put the commands into a procedure there are problems:

How can i ignore the singularity and gain values past this point? i get:

cannot evaluate the solution further right of 2.6991460, probably a singularity.

the program decsribes the motion of a double pendulum, so that the equations used show their angles relative to a normal...i want to gain information about these angles from a static point as time procedes. therefore the points will go back on themselves.

thanks

alex