Thanks.

Download dsolve_question.mw

Hi,

I got the Real and Imaginary of an expression J1 

assume(d,real):

Gamma:=0.04:tau:=10*Pi:j:=0:

J1:=(exp((1-I*d)*Gamma*tau)-1)/((1-I*d));

J1mod:=simplify((Re(J1))^2+(Im(J1))^2): (I works here this amont is real)

################

but when I change the expression  for J1 to be

J1:=((2*e^(-2^(-j-1)*(1-I*d))-e^(-2^(-j)*(1-I*d))-1)*exp((1-I*d)*Gamma*tau)-1)/((1-I*d)):

J1mod:=simplify((Re(J1))^2+(Im(J1))^2): 

J1mod here is complex(I dont know why? it doesnt separate the real and the im )

Any comments will help

Thanks

Hello everybody,

can somebody tell me how to use subscripts in textmode? 

Thanks for your help!

Picard

OK, what am I doing wrong here?

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

factor(x^2+y^2+2*xy);

but Maple refuses:

 x²  + y²  + 2 xy

but if I pose the question this way:

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

factor(ans);

(x + y)²

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:

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

Hi,

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

M(i,j)=i+j;

end

end

thanks

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

to 

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
a[2]*x[0]^2+a[2]*x[1]^2+a[2]*x[2]^2+a[2]*x[3]^2+a[1]*x[0]+a[1]*x[1]+a[1]*x[2]+a[1]*x[3]+4*a[0]

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:

L4:=NULL:

for i from 2 to 50 do

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

end do;

[L4]

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

2*3=6

2*3*5=30

2*3*5*7=210

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

Hi

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?

Hi,

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

Stéphane

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:

x^2+y^2=z^2+t^2

 Could you please help me with this?

hi,

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.

thanks

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?