Hi!

In the program below, all solutions are found for the equation S.R=T subject to 

the constraints given by eq1 and eq2. I've tried it for a 

few different choices of T and there's usually 80+ solutions.

I want to try more complicated choices of T (for example,

I want the matrix T to have every entry a distinct prime number). 

But then the program crashes. I assume the equations get complicated

or there...

Sorry if this is a bit vague...

I have a list.  I am applying a loop with a condition.  When the condition is met it stops (of course) but how do I get the condition to continue testing against the rest of the list without incrementing the next loop value?

T := Typesetting[delayDotProduct](sqrt(2/3), Matrix(3, 3, {(1, 1) = cos(omega*t), (1, 2) = cos(omega*t-(2/3)*Pi), (1, 3) = cos(omega*t+(2/3)*Pi), (2, 1) = -sin(omega*t), (2, 2) = -sin(omega*t-(2/3)*Pi), (2, 3) = -sin(omega*t+(2/3)*Pi), (3, 1) = 1/sqrt(2), (3, 2...

Hi everyone, I have a problem with the plot of a function I'm trying to use. The function is quite complicated and when I try to plot it between k=0..100 for example, it will only show the half of the points. What is the problem?
Here is the function Im talking about:
question.mw

one angle is 45 degree and one side is 4 find the other remaining two angles and sides, how?

part of my codes are:

func[1] := (1/2)*(c+s)*x[1]+s*x[3]+(s-c)*x[1]*x[2];
func[2] := (1/2)*(c-s)*x[1]+s*x[3]+(s+c)*x[1]*x[2];
func[3] := -b*x[2]-x[1]^2; 

They are just three ODE , how to fix the error?Where is the so-called recursive assignment...?

The program works well when:

"func[1] := x[2] + (x[1]^2 - x[1]*x[3]);

func[2] := - x[1] +  (x[2]^2 + x[1]*x[4]) + x[2]^3;

Twenty five observations of a random variable X are :130.8  129.9  131.5  131.2  129.5  132.2  133.7  127.8  131.5  132.7  134.8 131.7  133.9  129.8  131.4  132.8  132.7  128.8  130.6  131.1  133.8  130.5 131.4  131.3  129.5  //.. How do I construct a stem and leaf display using stems of 127, 128, 129, ... 134? I also need to find all quartiles.. Thank you to anyone...

eq1 := {
diff(S_h(t),t)= mu_h*(N_h-S_h(t))-(bi_h*b)/(N_h+m)*S_h(t)*I_v(t),
diff(I_h(t),t)=(bi_h*b)/(N_h+m)*S_h(t)*I_v(t)-(mu_h+ga)*I_h(t),
diff(R_h(t),t)=ga*I_h(t)-mu_h*R_h(t),
diff(S_v(t),t)=A-(bi_v*b)/(N_h+m)*S_h(t)*I_h(t)-mu_v*S_v(t),
diff(I_v(t),t)=(bi_v*b)/(N_h+m)*S_v(t)*I_h(t)-mu_h*I_h(t),
mu_h=0.0000457,mu_v=0.25,b=1,ga=0.167,
bi_h=0.4, bi_v=0.4,m=0,N_h=10000,A=5000,
S_h(0)=10000,
I_h(0)=1,R_h(0)=0,S_v(0)=10000,I_v(0)=1
};

Hi all,

I have a problem with 'Rank' when trying to find the rank of a matrix.

For some purpose, I have to load both with(LinearAlgebra) and with(Statistics) packages.

Without using Statistics[Tally], (not loading the Statistics package), the Rank works fine.

With the Statistics package, Rank sometimes gives an error, saying,

Error, (in Statistics:-Rank) expected 1-dimensional Array, but .....

I now fix this by using LinearAlgebra[Rank].

In my complex root finding problem it is essential to obtain complex roots in each period of the function. to do this i have write the following code with functional periods but it doesnt work. would you please tell me why? and how can i correct the code?

A curve has the equation y=f(x).

Find the eqn of the normal to the curve at the point x=x0 in the form y=g(x, x0) and write a procedure to plot curve y=f(x) with its normal at any point on the curve.

Animate the plot so that the normal is seen sliding along the curve.

How can I simplify the following expression

sin(x+pi/4)+cos(x+pi/3)

to the following form

A*sin(x+B) or A*cos(x+B)

where A and B are calculated constant

How do I convert the following trigonometric expression?

->

Hi!

I want to program a specific type of tensor product in to Maple. For two 2x2x2 tensors (hypermatrices)

(A|B) and (C|D), there is a product x defined by equation (2) in the link that yields a 2x2x2x2 tensor

(it would be too difficult to type the product here). If someone

could please let me know how to write a short algorithm that takes as input (A|B) and (C|D) 

and outputs the product (represent it however is most convienent). 

Hi I am writing a program that studies the stability of a dynamical system. I want to sort the eigenvalues of the matrix by magnitude in ascending order and then assign theses eigenvalues to a variable and then check to know those that are outside the unit circle. I am dealing with a 5 by 5 matrix. Do not want to go through  the permuation of thses eigenvalue which is lengthy. can someone help me out. JUS HOW TO ASSIGN EACH EIGENVALUE TO A VARIABLE. THANK YOU