MaplePrimes Questions

Search Questions:

Latest Questions Latest Questions Feed

Hello everybody,


can somebody tell me how to use subscripts in textmode? 


Thanks for your help!



OK, what am I doing wrong here?

This polynomial can be factored by almost anyone who knows algebra:


but Maple refuses:

 x2  + y2  + 2 xy

but if I pose the question this way:

ans := expand((x+y)^2);


(x + y)2

I get the expected result.  What is wrong with how I am using the factor?

If we have a piecewise continous 2*Pi-periodic function

h(t)=e^(2*t) when 0 < t < 2*Pi

How can we plot it? It should look something like this:


Periodic plot


I.e. I want to be able to just set an interval and then it automatically plots the function with the specified periodicity.


I am new to maple. I want to write the following codes in Maple in a file and execute it. I am writing the code in matlab. thanks


for i =1:1:5

for j=1:1:5






I am working with a package that is not entirely stable and which can sometimes corrupt Maple's state. I would like to "sandbox" the risky operations, executing each of them in another kernel thread that I can destroy (or somehow reset), getting back just the return result of each operation (each return result involves only global names, numbers, and strings). What would be a good way to achieve this?

I see the Task model, but it is not clear to me that each kernel used is effectively restart()'d for each Task Start(). At the moment I would have a bit more confidence in manually using Thread Create(), except that I do not see any information on how to destroy a thread (just to destroy Mutex and Condition Variable resources.)

This is, I suppose, a kind of security, but it is not covered by EngineSecurity. (Not unless I need to process[popen] to achieve this.)

Hy all its my first post, thankyou for having me.
I'm not sure why this happens but say I got a list

X := [0, 1, 2, 3];

and perform this expression

sum(sum(a[k]*X[i]^k, k = 0 .. n), i = 1 .. nops(X))

I get output 4*a[0]+6*a[1]+14*a[2] which is correct and what I want, but if I swap the summations


sum(sum(a[k]*X[i]^k, i = 1 .. nops(X)), k = 0 .. n)

I get 3*a[0]+6*a[1]+14*a[2] which is incorrect I believe, unless I'm being silly and missing something.

this happens because its a 0 in my list, if I replace a zero with a non zero number then it works fine and if I replace my set with

X := [seq(x[i], i = 0 .. 3)];
both summations give me

and at the end there is 4*a[0]
nothing that is really depending on any element in the list. so why when I replace an element with 0 using the second expression (which should be equivalent to first) gives me less a[0]I really would like to understand why this is happening

any insight or assistance would be gratefully appreciated.(I'm still a noob)

I Need eliminate u(t) in Matrix U
How can I do it directly from dsolve without using string tools?



I am trying to take a list of prime numbers that I already generated with the following:


for i from 2 to 50 do

if nops(ifactor(i))=1 then L4:=L4,i end if:

end do;


This gives me the primes bewteen 2-50, [2,3,5,7,11,13,17,23,29,31,37,43,47].  I want to write something that takes the products of my list like this




and so on through the whole list.  Any ideas?  I figured out how to take the product of 2*3, 2*5, 2*7 and so on, but I cant figure how to make it do 2*3, 2*3*7 and so on.

I am doing a presentation on Euclids infinite prime proof and thought it would be cool to write a maple program that will show his proof for a certain amount of prime numbers.


Thanks,  Matt





I have a Maple file which contains many proc loops and functions.

I need a linkage between some files to read the requested functions from source file and export calculations to another file.

Is it possible?


When I show the context menu on maple 18 (CTRL click on mac or right click with a mouse) on an equation the system doesn't show the tutor or series options as written in the example I use.   (after having loaded the multivariate calculus as asked)

Is that an issue in my installation ?  Where do I have to place the cursor ?  Is the multivariate calculus module well loaded ?

Thanks for your help



Dear friends,

I would like to know the agorithm of isovle for solving 2 order equations for more than 3 variables.

I see that not all the solutions are shown for example for:


 Could you please help me with this?



I have bought maple18 student edition. I want to learn GPU programming through Maple. Please suggest how to do this. I have a notebook with i7 processor and NVIDIA geforce 750m graphics. I want to solve system of algebraic equations, integral equations etc in parallel using GPUs.


I am trying to simplify sums of a few LaguerreL polinomials of different n using the identities in the function advisor such as recurrsion relations. How does one go about in using the FunctionAdvisor identities when trying to simplify expressions containing orthogonal polynomials? 



Hello guys.

I have a system of differential equations , which I want to solve the perturbation method , but the following problem :

I got zero approximation 


SYS0 := dsolve({Sys, isc}, {delta0(x), u0(x)}, type = numeric, output = listprocedure)

SYS0:=[x=proc(x) ... end proc,delta0(x)=proc(x) ... end proc,u0(x)=proc(x) ... end proc]



How can I use the zero-order approximation for the future is being computed ?

I tried to do so:

F := eval(delta0(x), SYS0);
F1 := eval(u0(x), SYS0);

Fdiff := eval(diff(delta0(x), x), SYS0);
F1diff := eval(diff(u0(x), x), SYS0);

Error, (in eval/diff) non-algebraic expressions cannot be differentiated

Sysq := ((9/10)*F1(x)*F(x)*F1diff-(3/10)*Fdiff*F1(x)*F1(x)+(3/2)*F1(x))*F(x) = (1/5)*F(x)*delta1(x)-(3/10)*u1(x);

Sysqq := u1(x)*Fdiff+F1(x)*(diff(delta1(x), x))+delta1(x)*F1diff+F(x)*(diff(u1(x), x)) = 0;

SystemSec := Sysq, Sysqq;

SYS22 := dsolve({SystemSec, delta1(0) = 10^(-8), u1(0) = 10^(-8)}, {delta1(x), u1(x)}, type = numeric);

but I can not differentiate u0 (x), delta0 (x) to find u1 (x), delta1 (x) in my system


Sorry for my english



I want to generate all 4x4 matrices of rank-1 over the field with two elements, F_2. I don't want to use actual arrays though, I just want to use symbols representing the unit matrices. So for example Eij represents the 4x4 matrix with a 1 in row i & column j, and 0's elsewhere. 

We have 16 unit matrices: E11, E12, ..., E14, ... E41, E42, E43, E44. Then we have to look at all possible linear combinations that result in a rank-1 matrix. So for example: E11+E12,  E11+E21,  E11+E12+E13,  E33+E43, etc. The total number of rank-1 4x4 matrices over F_2 is 225. How can I find all of these quickly?

4 5 6 7 8 9 10 Last Page 6 of 1123