Knowing that the Taylor series for cos(x) is:
sum := sum+(-1)^i*x^(2*i)/(2*i)!

How would I write the following Maple code?

Generate an animation sequence showing the Taylor series approximation of cos(x) from N=1..10, where N is the number of terms in the series. Each subsequent frame of the animation should show a more accurate representation of cos(x) than the previous one. Plot the animation from x = -2*Pi .. 2*Pi, y = -5 .. 5

Hi,

     I want to know what K1 and K2 means in the answer after using Euler Lagrange command.

     Thanks in advance.

I am having some issues trying to convert this matlap code into Maple code, can somebody help me out?

% Solve v'(t)=-0.0207v(t)^2-893.58 with y0=0
clc;
y0 = 0;                  % Initial Condition
h = 0.1;                 % Time step
t = 0:h:5;               % t goes from 0 to 5 seconds.
vstar = zeros(size(t)); % Preallocate array (good coding practice)
vstar(1) = y0;           % Initial condition gives solution at t=0.
for i=1:(length(t)-1)
    k1 = 0.0207*vstar(i)^2-893.58; % Previous approx for y gives approx for derivative
    vstar(i+1) = vstar(i) + k1*h; % Approximate solution for next value of y
end
figure(1)
plot(t,vstar);
y0 = 0;                  % Initial Condition
h = 0.05;                 % Time step
t = 0:h:5;               % t goes from 0 to 5 seconds.
vstar = zeros(size(t)); % Preallocate array (good coding practice)
vstar(1) = y0;           % Initial condition gives solution at t=0.
for i=1:(length(t)-1)
    k1 = 0.0207*vstar(i)^2-893.58; % Previous approx for y gives approx for derivative
    vstar(i+1) = vstar(i) + k1*h; % Approximate solution for next value of y
end
figure(2)
plot(t,vstar);

Hello,

I have a Maple package which is a .mla file.

How can I open it to have access to the source code ?

I would like to open it in order to modify a procedure and to use it indepently of the package.

Thanks a lot for your help.

whenever i use maplesoft, i`m wondering about the instruction which is to show me the explanation about answers.

Maplesofte must be worked by some principles , therefore it can show the explanation of any answers to users

please let me know what is the instruction that i can watch explanations.

for example /

> int(f(x)*g(x),x);

sin(x) - x cos(x) - 1/2 cos(x) sin(x) + 1/2 x

 how can it get an answer, i wanna see that

How to simulate a data which is follow by binomial distribution, n=200, p=0.9.

I know normal can be simulated by following code

random[normald[0, 1]](50)

How can I do if I wanted to simulate a class of 30 students rolling a dice 10 times, and you wished to count the number of 3's you observe for each student?

Maplesoft regularly hosts live webinars on a variety of topics. Below you will find details on an upcoming webinar we think may be of interest to the MaplePrimes community.  For the complete list of upcoming webinars, visit our website.

See What’s New in Maple 2015 for Educators

Maple 2015 is a major new release of Maple, the technical computing software used for education, research, and development involving mathematics, engineering, and the sciences. With Maple 2015, Maplesoft offers important new abilities to both educators and researchers, particularly in the areas of data analysis, application development and statistics education. This webinar will provide a complete overview of these new features, including:

• A new interface to access, work with, and visualize millions of datasets in the areas of finance, economics, and demographics.
• New facilities for developing Math Apps, including a new microphone and speaker component.
• Advances in integration, differential equations, interactive maps, group theory, physics, and more.
• New Clickable Math tools, including palettes and 60 new interactive Math Apps.
• New tutors, palettes and Math Apps designed explicitly for teaching and learning statistics.
• And more!

To join us for the live presentation, please click here to register.

to compute a maple program using the paper posted in the reply 

Hello again,

for a paper I need to cipher and decipher with the standard RSA-procedure.
My problem is, that my numbers are really large.

As normally it's just, given a public key (e,N) and a private key (d,p,q), p,q are primes, and the plaintext:

encrypt: b^e mod N = c

decrypt: c^d mod N = b

That works cause ed = 1 mod (p-1)(q-1) (Euler's Phi-Function) and gcd(e,N)=1

With little numbers thats no problem. But increasing e and N, i thought using the powmod function will help:

b&^e mod N = c but

c&^d mod N <> b.

So it doesnt work anymore and I really dont get why...

thanks for help, I'm really lost here..

  Solving trigonometry Equations  sin^2(2x)-cos^2(8x)=0.5cos(10x)

Hello,

I have a question. I have to compare the times and steps taken by an algorithmus (which contents a loop).

So for time there is the time()-function, right? And is there any similar function for the steps taken?

So far i use a variable increasing by 1 each time, but i think there is an more elegant way to do it, which I just don't know.. :D

Thanks for any help!

Hello,

Good day.

How to avoid float(undefined) for v3, v4,v5 in this problem.

Thank you in advance.

Try_for_Second_Grade_Fluid.mw

Hi,

I am tring to  solve a set of boundary layer equations with boundary conditions using Runge kutta Felbergh 45. When I executed the file,  the following message appear " Error, (in dsolve/numeric/bvp) initial Newton iteration is not converging". Can someone help me on this matter?