Can the seq here be made into an equivalent for command?

x:=[6,2,8,4]y:=[7,5,1,3]stepsize:=0.5step:=seq(min(x)..max(x),stepsize)

b:=[seq([new,min(y)],new=step)]pointplot(b,symbol=circle,color=blue)

This is code I've converted from Matlab. Now I'm attempting to convert the seq here into a similar but simple for loop without using seq. There is a similar code line in Matlab using a for loop but I have no experience with...

I am gettinga string from a textfield

In my program that String represent a set of 8 bits

ie. g(t)= 10101110

But I need to separate them like

n0=1

n1=0

n2=1

...

n7=0

where each n is an integer

how do I do it?

I guys,

I wrote this little function :

test:=proc(a,x) if has(a,x) then if type(a,`*`) then S,R:=selectremove(has,a,x); else R:=1; S:=a; end if;elseR:=a; S:=1;end if;return [S,R];end proc;

could you confirm that it should catch every possible form for a monomial containing or not x?

Hi all

I'm fighting agaist this situation:

ccc:= sin(x);

S:= select(has,ccc,x) sin(x)R:=remove(has,ccc,x); sin()

what's that??? why doesn't it aswer 1 or " " istead?

How am I supposed to trust in the remove procedure? What should I do in order to...

UncertaityofCalibrat.mw

within the attached document, is the idea that I would like to develop with the optimization package.

I want to calculate iterates for the Logistic map using the maple's symbolic computation. e.g.,

x1=a*x*(1-x):

a1=a+w:

x=x1:

a=a1:

In order to keep track of the error that builds up in each step. But the main trouble is that it takes very long time to calculate the same even for 100 iterates. What could be the possible method to make my program efficient ?

Please do not answer in terms of using high precision technique as I am more interested in doing it symbolically.

Is there a way to solve an equation to show all integer solutions, assuming the problem has finite solutions. Examples would include elliptic curves.

I have the following list, vector or set, I put it in a matrix

Hello,

Does any body know why the following code

A:=Matrix(3, 3, [[-1/23*(14+21*62^(1/2))^(1/3)-31/29/(14+21*62^(1/2))^(1/3)-13/107,0,0],[0,1/22*(14+21*62^(1/2))^(1/3)+15/29/(14+21*62^(1/2))^(1/3)-13/10-1/2*I*3^(1/2)*(-1/11*(14+21*62^(1/2))^(1/3)+31/29/(14+21*62^(1/2))^(1/3)),0],[0,0,1/22*(14+21*62^(1/2))^(1/3)+15/29/(14+21*62^(1/2))^(1/3)-13/10+1/2*I*3^(1/2)*(-1/11*(14+21*62^(1/2))^(1/3)+31/29/(14+21*62^(1/2))^(1/3))]]) ;with(LinearAlgebra):IsSimilar(AA,AA);

Hi,

I'm trying to use a simple DLL in maple, which I create based on Maple external linking examples..

int __stdcall mult( int a, int b ) { return a * b; }and I compiled it with Visual Studio 2010 compiler, but when I use it in Maple I recieve the error

"Error, external linking: error loading external library"

thanks

Of course the bottleneck is in Maple (may I say as usual, especially when you are trying to innovate).i) Socket package is not thread safeii) Most of the time is spend waiting for Wait(id1, id2) etcIf all the technical Maple stuff was working I could do the below call in around 1 second or less. Now it takes 7 seconds which is way way to long if you want to download let say 50 symbols...restart;with(Threads):X := proc(symb) uses Sockets;

Hi. I am supposed to sketch the set of points in the complex plane defined by

|z+2|<=|z-I|

where <= is less than or equal to and I is the complex number.

By hand, we simply substitute z=x+I*y into the above inequality, expand and simplify to get

y<=-2x-1.5

From here onwards, we sketch the straight line and shade the bottom region of the line.

In more challenging cases rather than getting a straight line, one...

r(t):= <t | t^(2) | (t^(2) )/(2) >

simplify(,symbolic)

diff(r(t),t)

The three lines above are part of a worksheet that computes unit tangent vector, unit normal vector and components of acceleration for a parametric curve r(t) , a standard Calc 3 lesson.

I am...

I have one calculation and the result is "Length of output exceeds limit of 1000000"... What can I do with this error?

Thanks a lot.

Hi, I'm trying to use rsolve to solve the difference equaiton: y(n)-3*y(n-1)-4*y(n-2)=delta(n)+2*delta(n-1) where deta(n) is the discrete delta function represented by charfcn[0](n). The answer should be y(n)=(-1/5)*(-1)^n+(6/5)*4^n. I'm getting the answer in terms of y(0) and y(1) and extra terms. Can someone point me in the right direction?

Thanks for your help

You must be logged into your Facebook account in order to share via Facebook.

Click the button below to share this on Google+. A new window will open.

You must be logged in to your Twitter account in order to share. Click the button below to login (a new window will open.)

Please log-in to your MaplePrimes account.

Wrong Email/Password. Please try again.

Error occurred during PDF generation. Please refresh the page and try again