hi, I was wondering how I can plot a phasediagram for the Solow growth model which has k(dot) on the y-axis and k on the x-axis and that has arrows that point in the right direction above k(dot)=0 and arrows that point in the left direction below k(dot)=0 The code I use to plot k(dot) is: restart: y:=A*k^a: S:=s*y: BE:=(n+g+d)*k: k_dot:=S-BE; s:=0.7: A:=1: a:=0.3: n:=0.06: g:=0.04: d:=0.03: plot(k_dot,k=0..15,color=blue, labels=["k", "k_dot"]); works fine but I am missing the arrows....

Cheers!

You will find in the attach file work that I have done in this subject.  Everything works fine when the calculation is around x=0.  But if for example I want to do it near x=4, I don't come near the value that Maple give me.  But the plot loook OK.

Is it the definition of px and qx in the file that I don't define correctly?

By the way, if you know a simple application on that subject (simple), I will be glad to learn about it

Hi,

Is there something like

assume(a,'nonzero');

 

 

how could i tell maple that

a

is a nonzero constant?

 

Thanks

View 2735_Fibonacci_Number_Ending_in_999.mw on MapleNet or Download 2735_Fibonacci_Number_Ending_in_999.mw
View file details

i got problem coz i dont understand nor know what command i need to type in maple, really need help,

Question:

Hi all

 

I have spend too much time trying to figure out why Maple won't solve this equation explicitly. Here is the code:

 

assume(0 <= s, 0 <= w, 0 <= t, 0 <= h):

diff(((w-s)^(1-t)-1)/(1-t)+(((1+r)*s)^(1-t)-1)/((1+h)*(1-t)), s);

solve(%, s)

 

It returns:

 

-(w-s)^(1-t)/(w-s)+1/(1+h)*((1+r)*s)^(1-t)/s

RootOf((w-_Z)^(1-t)*_Z+(w-_Z)^(1-t)*_Z*h-((1+r)*_Z)^(1-t)*w+((1+r)*_Z)^(1-t)*_Z)

 

Cheers!

Here is what I have done in Maple 11:

st:=taylor(sin(x),x=0,10):

sint:=convert(st,polynom)

sinr:=convert(taylor(sin(x),x=0,10,ratpoly))

plot([sin(x),sint,sinr],x=-6..6,-2..2,color=[red,navy,gold])

My question is how theoraticly do you convert a series into a rational polynom?

Mario

 

I'm trying to find the greatest common divisor of two functions with characteristic=7:

with(Algebraic):
GreatestCommonDivisor(x^4+x^3+4*x^2+4*x+5,x^3+x^2+5*x+5,'characteristic'=7);

This gives the answer as (x+4) which is a common divisor but it is not the greatest. From working by hand, I've found that (3x+5) is the gcd.

Why is maple giving the wrong answer?

I decided to repost this as the previous one went crazy.......

I'm trying to construct an iterative procedure NR1(f,x0,N) where f is a function, x0 is an initial estimate (which can be complex) and N the number of iterates.

Given:  x_k+1=x_k - f(x_k)/f'(x_k), k=0,1,2....,

Now for example by defining f:= x-> x^2-2 and inputting x₀=1 and N=10 i should be able to check that my procedure calculates sqrt(2) correctly.

This is what i've got so far.....

hi, i am new to this and when i start up maple 11 i get the following error : "Java Virtual Machine Launcher,  Could not create the java virtual machine"

i hope there is a solution to this because i have searched everywhere and i cant get the solution.

error: http://img369.imageshack.us/my.php?image=problem1ek9.jpg

thanks

I'm trying to construct an iterative procedure NR1(f,x0,N) where f is a function, x0 is an initial estimate (which can be complex) and N the number of iterates.

Given:  x_k+1=x_k - f(x_k)/f'(x_k), k=0,1,2....,

Now for example by defining f:= x-> x^2-2 and inputting x₀=1 and N=10 i should be able to check that my procedure calculates sqrt(2) correctly.

This is what i've got so far.....

Hi i'm trying to figure out how to write a procedure for creating a NxN matrix with conditions. The conditions for M[ij] are as follows:

a if j>i+1, c if i>j+1 and b otherwise.

So far this is what i've come up with but i've tied myself into a mental loop and cant seem to figure this out. I know it's really simple and that's what is frustrating me the most.

I am trying to solve the following equation with maple

g:=t->(-l*a^2*t+l*a^2*r^(-1/(a-1))*(A*l)^(-1/a)*(1-t)^(-1/a)*exp(1/(a-1))*t-l*a^2*r^(-1/(a-1))*(A*l)^(-1/a)*(1-t)^(-1/a)*exp(1/(a-1))+l*a^2-l*a-2*l*a*r^(-1/(a-1))*(A*l)^(-1/a)*(1-t)^(-1/a)*exp(1/(a-1))*t+2*l*a*r^(-1/(a-1))*(A*l)^(-1/a)*(1-t)^(-1/a)*exp(1/(a-1))+l*t*a-a*r^(-1/(a-1))*(A*l)^(-1/a)*(1-t)^(-1/a)*exp(1/(a-1))+l*t*r^(-1/(a-1))*(A*l)^(-1/a)*(1-t)^(-1/a)*exp(1/(a-1))-l*r^(-1/(a-1))*(A*l)^(-1/a)*(1-t)^(-1/a)*exp(1/(a-1))+r^(-1/(a-1))*(A*l)^(-1/a)*(1-t)^(-1/a)*exp(1/(a-1)))*exp(-1/(a-1))/(t-1)/a;

How do I find the derivative dy/dx of:

x+ y= 3xy

I think I use the Sum Rule for the LHS and the Product Rule for the RHS.  Where I am confused is how to treat the y on the LHS.  Do you change it to 3y and then solve the whole thing for y?, or do you keep dy/dx*y and then solve the whole thing for dy/dx?

Any thoughts?

 

How does one create the set of all positive integers less than and coprime to 66?

I created a set of integers from 1-66: L := {seq(i, i = 1 .. 66)}, then try define coprime66 as follws, coprime66 := isprime(igcd(L, 66)),  to get a set of the coprimes but i get an error.

I've tried op(L) but this doesn't work either. What am i doing wrong?