Items tagged with homework

I have the following question:

Illustrate how the sequence N->R de fined by n ->n^2/n^2 + 31n + 228 can be shown to be
within a given epsilon > 0 of its limiting value x0.
(a) use an appropriate conditional statement to find N such that abs (xn -􀀀 x0) < epsilon for every n>=N
and produce an appropriate list of the data points (n,xn) to illustrate
this

I found N but without using any CONDITIONAL STATEMENT.Can you help me find N using IF FOR WHILE?

Write a Maple procedure which takes any cubic polynomial [−3, 3] p −→ R and returns the following:

How i can plot of p and its tangent lines illustrating the nature of each critical point.

Demonstrate this in the instance that p(x) = 1/3 x^ 3 − 6/10 x^ 2 − 187/100 x + 1.

 

Any ideas how i can solve this?

I have the following sequence: n2/n2+31n+228.The question asks me to use an appropriate conditional statement to find N such that absolute (xn-x0)<epsilon for every n>=N. I found N but i don't know how to find it using Maple17.Can you please help me?

 

How do I write a procedure to find a root of f(x)=0 in the vicinity of a given value x0. The procedure should initially use the rearrangement method to produce a linearly convergent sequence of values, and should, when appropriate, switch to Aitkin's Method. The input for the procedure should be the re-arranged function and the velue for x0. The output should be the root and the number of iteration taken. The procedure should check that re-arrangement will converge. This program should do in Maple V Release5.

Thank you for your help.

 

Hello,

 

I try to find all the twinprimes in a certain range of numbers. I made a mistake, but a don't know which one. Wjo can help me?

 

 

 

Hello I have this assignment. I will translate it (because it is not english)

This is the assignment: [IMG]http://i68.tinypic.com/2cgoby9.jpg[/IMG]

(if u cant click on the above link, then u can see it here http://tinypic.com/view.php?pic=2cgoby9&s=9)

 

So it says:

-------

In an examination of young pigs' birth weight 853 newborn pigs were weighted. The weighting is shown in the table down below. 

 

[0,5-0,7] [0,7-0,9] [0,9-1,1] [1,1-1,3] [1,3-1,5] [1,5-1,7] [1,7-1,9] [1,9-2,1] [2,1-2,3] -> WEIGHT in kg

[26]            [43]       [102]       [145]        [171]      [196]     [119]       [42]          [9]      --> number of pigs

 

Draw a cumulative frequency curve of the weighting and determine the kvartils.

 

SO I usually do this in Maple, but this time I did a matrix but nothing happened.. I dont know how I should draw this curve? Help please. 

 

 

[IMG]http://i68.tinypic.com/2cgoby9.jpg[/IMG]

I have a maple homework on the collatz conjecture, but i am new to maple and does not know how to program it.

our professor gave us the first part, i tried a lot of different loop, but keep getting errors. Need HELP.

I need to test all integer m <= 60, i dont know how to set up a loop that can test all 60 numbers.

> restart;

> k := proc (x) options operator, arrow; piecewise(type(x, even), (1/2)*x, 3*x+1) end proc;
/ 1 \
x -> piecewise|type(x, even), - x, 3 x + 1|
\ 2 /

> m := 3;
> k(m);
> for j to 200 while k(%) > 1 do k(%) end do;
> print(m, j+1);

 

I have a homework ask you to find the first string of (at least)10, 50, 100 consecutive composites. I have no idea how to use maple. HELP

all i can think of is 

 

>ithprime(i+1) - ithprime(i) = 10

>print(i+1, i)

 

and combine it with some loop

i dont know how to set up a loop

 need a lot of help 

Hi everyone...!

Can somebody tell me how to express this equation in Maple? 

xij <= zkl ; ∀ i ∈ I: S(i)=k, ∀ j ∈ B: R(j)=l; 

Currently I'm dealing with containerization problem and have 4 indexes in the constraints (namely: i for item, j for container, k for shipment, l for route, S for Set of Shipment, and R for Set of Route) while x and z are binary variables. What I want to express is: (for example), item 1,2,3 are in shipment 1, item 4,5 are in shipment 2, etc etc. SO, if i = 1,2,3 then the value of k will be 1. If i = 4,5 then the value of k will be 2, etc. Same thing goes to j and l, (for example) if j = 1,2 then the value of l will be 1, etc etc. Further depcition is more or less like this:

S(i) = k

S(1) = 1

S(2) = 1

S(3) = 1

S(4) = 2

S(5) = 2

 

Thank you very much for the help.

Hello

I have an SEIR model.

Equation 5 is for disease death but I would like to plot the cumulative numbers of disease death which will be the integral of Equation 5. I added the integral inside odeplot but it is not working. Any idea  about  how to compute the integral ?

Maple code is attached

Thank you

code.mw

Hi,

 

I was wondering how to go about plotting a Fourier Tranform in Maple.

My assignment is to plot a simple harmonic equation as a Fourier transform, depicting amplitude against fequency.

I've been given: x'' + w^2 x = 0

And want to obtain both the f(x) = a0 sin(wt) + b0cos(wt) form, and a graph of the the amplitude (c^2 =a0^2 + b0^2) against frequency.

I know how to do this on paper but not in Maple, so any help with line commands and layout would be very much appreciated.

 

Thanks

I need to complete the definition of bcount so that bcount(n) returns the total number
of odd coefficients 
n
k , 0 ≤ k ≤ n. For instance, the values of 
n
k for n = 6, with odd values highlighted, are:
1, 6, 15, 20, 15, 6, 1,

bcount:=
proc(n::TYPE)
description "Count odd binomial coefficients.";
---MORE STUFF HERE---
end proc; # bcount

Any help appreciated

 

Cn ={ 1, n = 0 ,                                                  }

      {Xn−1[sum of] k=0   C(k)C(n−1−k) , otherwise.  }

 

looking to complete the definition of catalan so that catalan(n) returns Cn whenever n is a non-negative integer. usin g the definition above...any help appreciated

 

catalan:=
proc(n::TYPE)
description "Print the n'th Catalan number.";
option remember;
---MORE STUFF HERE---
end proc; # catalan

the binomial coefficient  n k  can be defined recursively as follows for all nonnegative integers n, k:

(n)  = {0,      k>0

(k)  = {1       k=0, k=n

         {(n-1)+(n-1), otherwise.

          (k-1)   (k)

I need to complete a deinition of binom so that m so that binom(n,k) returns  n k  for all n greater than 0, and k greater than or equal to 0 using the definition of the binomial above..Any help appreciated..

binom:=
proc(n::TYPE1,k::TYPE2)
description "Compute a binomial coefficient";
option remember;
---MORE STUFF HERE---
end proc; # binom

 

I have the following two PDEs:

PDE := diff(u(x, t), t) = diff(u(x, t), x, x)+sin(x+t)-cos(x+t);

IBC:= D[1](u)(0,t)=-sin(t),
D[1](u)(1,t)=-sin(1+t),
u(x,0)=cos(x);

pds := pdsolve( PDE, [IBC], numeric, time = t, range = 0 .. 1,
spacestep = 1/32, timestep = 1/32,
errorest=true
)

 

PDE2 := diff(v(x, t), t) = diff(v(x, t), x, x);
IBC2:= D[1](v)(0,t)=0,
D[1](v)(1,t)=-0.000065*v(1, t)^4,
v(x,0)=1;

pds1 := pdsolve( PDE2, [IBC2], numeric, time = t, range = 0 .. 1,
spacestep = 1/32, timestep = 1/32,
errorest=true
);

 

Now, what I want to do with these two PDEs is the following:

 

For each h=timestep=spacestep  = 1/16 , 1/32 , 1/64 , 1/128 , 1/256

Calculate the error norm ||E||_h = sqrt(sum_{j=0}^{1/h} h* |u(j*h,tval)-v(j*h,tval)|^2)

where tval is some chosen point between 0 and 1 (this value is fixed for each spacestep chosen).

 

And then plot the graph of log ||E||_h vs. log h above.

 

What I don't know is how to extract each time the spacestep and its PDE's two solutions, does someone have a suggested script to use here?

 

 

1 2 3 4 5 6 7 Last Page 3 of 23