hi, 

I am a newcomer user(maple16) and am trying to make a graph of energy * time forced oscillation
but I'm having this problem

script:

> restart;

> x := unapply(A*exp(-b*t/(2*m))*cos(`ϖ`*t+phi)
                  +Fmax*cos(psi*t-theta)/sqrt((k-m*psi)^2+b^2*psi^2), t);

> v := unapply(diff(x(t), t), t);

> E := unapply((1/2)*m*v^2+(1/2)*k*x^2, m, v, k, x);

> E2 := subs(v = v(t), x = x(t), phi = arctan(-vo/(xo*omega...

Hi there!

I'm trying to decompose a measured force (with Force and Moment block) to visualize the three components XYZ independently, using the Force Arrow block. I tried using demultiplexers but an error occur:

connection element mismatch: connect((Main.M3_1.y[1], Main.M3_1.y[2], Main.M3_1.y[3]), /*struct*/ (Main.DFPSubsys1inst.force.r_0, /*struct*/ (Main.DFPSubsys1inst.force.R.T, Main.DFPSubsys1inst.force.R.w), Main.DFPSubsys1inst.force.f,...

Consider the differential equation 
                   d                          
                  --- y(x) = 2 y(x) (y(x) - 4)
                   dx                         
 on the rectangle  -1 < x < 1, -2 < y < 7.40 in the xy-plane.

 (a)  Use DEplot to plot the direction field for the differential equation on the given domain.  Assign your answer to my_plot_1.

I'm trying to create a matrix that mimcs the FFT equation as seen here. (Note that I don't want to do the transform, I just want the symbolic matrix of it.) I want to make the matrix in terms of the symbol omega, but I also want it to reduce correctly. Here's what I mean:

I used this post to figure out:

Write a function to compute the n-th partial sum of the alternating series
            
1-1/(4)+1/(9)-1/(16)+...+(-1)^(n-1)*1/(n^(2))

Specifically, the procedure takes n as input, and returns the sum of the first n terms. 

Can someone help me with this? I'm not very good at using procedures.

Hi Everyone,

I'm trying to impletement the solution in a for loop. As an example, consider

for i from 1 to 10 do print(evalf(Int(proc (y) options operator, arrow; y^i end proc, -1/2 .. 1/2))) end do

For each iteration the output is the same, even though the values of the integrals should be the same. I see that the output is actually the first interation repeated 10 times.

Is there a solution for this problem?

Thanks,

Ant

Find the positive integer  m that satisfies the equality below : 10P4=m!

Calculate the determinant of the square Vandermonde matrix     (A is alpha)

     1   Α₁    A₁²   A₁³       

     1   A₂    A₂²   A₂³ 

V= 1   A₃    A

Hi,

I'm currently working on the modelling of a thermodynamic process.

Briefly, I cool down a solution (water + polymer) from -5°C to -15°C to induce a phase separation. At the end (and after removing of the water by lyophilisation) I obtain a porous sponge like material.

The process uses a home made cooling system which can be described like this:

- A Peltier module

- An aluminium layer recovered by teflon (And also a layer of ethanol)

Heey

I have a problem when I call the Eigenvectors i get:

>Eigenvectors(Transpose(K).K);

i get the answer i want but every time i execute the worksheet my eigenvalues swich places aswell as the eigenvector.

Someone that can help me how i can sort or something like that to freeze the eigenvector output? so i can use some of the output to caluculate furhtere on and when i execute the worksheet i know that me eigenvectors and eigenvalues...

Regards, I have a question about the solve function in maple

How does the solve function works?

I know if you have a random eq lets say y:= x-> x^2 + 5 x

and I use the function like....   solve(x^2+5x = 8) it will solve it for me giving me numerical values for x or the roots of x

If I have an eq w(x) and it has constants lets say w:= x -> a[1]x^2+a[2]x^4

and i solve this equation in this manner:    solve([w(0),w(1),D(w)(0),D(w)(1)])

 Write a function to compute the n-th partial sum of the alternating series
            
        "1-1/(4)+1/(9)-1/(16)+...+(-1)^(n-1) * 1/(n^(2))"
         Specifically, the procedure takes n as input, and returns the sum of the first n terms. 

So I am kind of lost- I've tried 5 different procs but keep getting more confused. Here is current one:

prob := proc (N) 

local a, u, n, q; 

Is the shortest distance to the centroid or the intersection?

I am trying to find the maple procedure to do the extended euclidean algorithm which computes the gcd(A, B) such that the gcd(A, B) = A*r + B*s for some integers r and s. I want the integers r and s.

is gcdex() the right maple procedure (I cannot get it to work). Or what procedure can I use?

-Thanks

 G := proc (N)

 local s, n;

 s := 0.;

 n := 0;

 while n < N do 

n := n+1;

 s := s+1/n

 end do;

 [s, n] 

end proc;

             G := proc (N) local s, n; s := 0.; n := 0; while n < N do n := n+1; s := s+1/n end do; [s, n] end proc
Compute  G(1.0),G(2.0), .....G(7.0)   try to figure out what the procedure G is doing

> G(1.0);