Items tagged with homework homework Tagged Items Feed

N := 8;

b := 2 ∗ P i;
data := [];
for n f rom 0 to N do
data := [op(data), [n ∗ b/N, sin(n ∗ b/N)]];

Since exact points are not needed, changed the loop (and reinitialize) to:

data := [];

for n from 0 to N do
data := [op(data), [evalf(n ∗ b/N), sin(evalf(n ∗ b/N))]];

Modify the second example so that it can be used to graph the sin function
over any interval from a to b. (You should suppress the output from the for-loop in your
example, so that you do not fill up the worksheet with an unwieldy amount of output.)

I have a question that says write a procedure that takes a random graph and three edges of that graph and returns true if those edges share a common vertex. So I was thinking of something along the lines of

proc55 := proc (G, {a, b}, {c, d})

if evalb({a, b} = {a, c} or {a, b} = {a, d} or {a, b} = {b, c} or {a, b} = {b, d}) then print(true)

else print(false)

end if;

end proc;


I guess my main question is how do I put edges in the parameters line? It will let me write proc (G, a, b, c, d) but not proc (G, {a, b}, {c, d}).

Is there just something I'm missing or am I approaching this in the wrong way?


For the following maps, determine whether they are linear transformations or not, and present an
appropriate proof.

(a) T : R^4 → M2,3 given by T(a, b, c, d) =  [a   a^2   a^3
                                                                   b    c       d ]
(b) T : M2,3 → M3,2 given by T(M) = M^T (transpose of M)
(c) T : P3 → P3 given by T(p(x)) = p(2) + 3x · p'(x), where p'(x) denotes the derivative of the polynomial p(x).


i know that the 2 rules for proving are T (u+v)= T(u) + T (v) and T (ku)= k T (u).....but how do i show it with the questions above, like do i just take any numbers , so confused

Good day, can any one help in writing maple programme for the finite difference (FD) formulae define to solve this coupled non-linear  ODEs. See it here Thank you

NOTE: please disregard the earlier link.

Let Poly2 denote the vector space of polynomials

(with real coefficients) of degree less than 3.

Poly2 = {a1t^2+ a2 t+ a3 |a1; a2; a3 €R}

You may assume that {1,t; t^2}is a basis for Poly2.

(1) Show that L1 = {t^2 + 1; t-2 ; t + 3}and L2 = {2 t^2 + t; t^2 + 3; t}

are bases for Poly2.

(2) Let = 8t^2- 4+ 6 and = 7t^2- t + 9. Find the coordinates for

and with respect to the basis L1 and with respect to the basis L2

(3) find the coordinate change matrix P from the basis L1 to the basis L2.find P^-1

Just I answer part (1) can you help me to answer 2 and 3 

let A be a matrix=


[  7        7      9    -17

   6        6      1    -2

 -12    -12    -27    1

   7       7      17   -15 ]

What is the reduced row echelon form of A?

What is the rank of A?

A consistent system of linear equations in 14 unknowns is reduced to row echelon form. There are then 10 non-zero rows (i.e. 10 pivots). How many parameters (free variables) will occur in the solution?

Hello, I am a student typing up my homework assignments with maple, and I am takinng Inferential Statistics.  I can't figure out how to make the bar over a variable, so I can note the average.  It is just a line over a letter.  Kind of when notating a vector without the arrow.  It would be very helpful because I can't figure out how to make that symbol, it is not listed on the symbols list on the left side.


Hey guys! Can someone please help me by telling what I can insert into maple to get answer for this question? Thanks!

Is there any one to help me in calculating computational order of convergence of derivative free method. I am trying to calculate programs runs with immature error and does not print it.

Please is there any 1 to help.



I am trying to write a single procedure to find the root of any function using the Newton-Raphson method, given the initial approximation and the tolerance. If this fails to converge, the program must then use the Bisection method to find the root. Need some help please. The current procedure i have done is only coming out with the first Iteration 

Thanks for the help!

How would you do a quick sort or bubble sort?

Using the Fourier convolution theorem to solve f(t) =sin (t)

f(t)=R dJ(t)/dt+J(t)/C

R dJ(t)/dt+J(t)/C=f(t)

where f(t) is a driving electromotive force. Use the fourier transform to analyze this equation as follows.



Find the transfer function G(alpha)  then find g(t) .

 Thanks ....

3 4 5 6 7 8 9 Last Page 5 of 17