Hello, 

So I have two simultaneous equations, 

T= n1/(1+|T-S|) and S=n2/(n3+|T-S|) 

Where n1, n2 and n3 are constant parameters (from here on I fix n1=1 and n3=0.3). So I want to plot T, S against n2 for different values of n2. 

If I also fix n2 (say, n2=1.5) I  can get values for T and S no problem. 

But I've no idea (after many hours of searching) how to progresss. I know I need the program to put various values of n2 into the two equations and then plot the solutions numerically but I'm unsure what to try next.

Could anyone please shed some light on this?!

Thanks!

I'm trying to numerically calculate the following:

int(e^(-1.5*t)/sqrt(t*(t+1)), t = 1 .. infinity)

But Maple can't do it.

I then made it a lot simpler and tried to calculate the following:

evalf(int ((e^(-t)), t=1..infinity));

Thats just e^(-t), integrated from t=1 to t=infinity.

Maple just gives me back the original equation in the first case, and in the second gives me a limit that I can see has a numerical answer, but Maple can't. Is this something Maple should be able to do and I'm just now pushing the right buttons? I'm using Maple 12, which I know is old and limited, but these really aren't very complicated numerical integrations.

solve matrix equation Ax+Bx=C,x is n*n matrix ,forA,B,C is n*n matrix . write maple procedure and check a 2*2 case.

I can not interpret this answer.

I think here I is the complex unit.

Hi all,

I tried to used some statistical methods to analyze the data in maple and encountered some problems.

I wanted to perform a cluster analysis to quantify differences among individual samples and hoped to create the dendrogram like this:

For example, each sample is assigned to a cluster and there are about 4 main clusters plus additional outliers in this case through the dendrogram method.

But I didn't find any related command to create this kind of graph. How to realize this analysis in Maple? 

I'd appreciate any help on this topic. Thank a lot.

How to find inverse function of a multivariable function

for example

f := x^2 + y + z^3

f := x^2 + y^3

Gentlepeople.

Given 6 teams [A,B,C,D,E,F] I require that each team plays each other once.

 I can generate the pairs:

lst:=combinat:-choose({A,B,C,D,E,F}, 2);  

{{A, B}, {A, C}, {A, D}, {A, E}, {A, F}, {B, C}, {B, D}, {B, E}, {B, F},  {C, D}, {C, E}, {C, F}, {D, E}, {D, F}, {E, F}}

On a competion night three pairs will compete and it will take 5 nights for all teams to play each other.

now I need some eredite richard who can show me how to produce the five night output:

(instead of comma a 'v' needs to be mapped)

AvF

BvD

CvF

.....

I am trying to invert a function and, during the course, wind up with something like,

a_1*V^P*V + a_2*V^P*V^2 + a_3*V^P*V^3 + a_4*V^P*V^3 + a_5*V^P*V^3 + a_6*V^P*V^4 + \cdots

is there a way to get the poly into a form 

(a_1+a_2+...)*V^P + (b_1+b_2+...)*V^(P+1) + (c_1+c_2+...)*V^(P+2) + .....

?

Thanks. Attached is my Maple 16 sheet.

Download invert2.mw

Hi Maple Prime-ers!

I have a question about efficiency.  I have a set of algebraic equations with some polynomials, that I would like to solve at different points.  I've tried using a for-loop and a map-loop.  Here is a example:

n:=10000;  #Number of solving points
eq1:={b = ''a^2'', c = b^3/2, d = c^(1/2)*4 + b^2}; #Equation to solve

a := convert([seq(i,i=1..n)],Vector);  #timesteps

ans := Vector[column](n)

## Try solving in a for-next loop
t1 := time():
for q from 1 to n do
ans(q):=solve(subs({'a' = a(q)},eq1)):
od:
t2 := time() - t1;

## try solving in a map loop
t1s := time():
ans_s := map(q->solve(subs({'a' = a(q)},eq1)),a);
t2s := time() - t1s;

On my computer (2.2Ghz, 2 cores), these both take 115s to solve.  Using Map over For-Next did not speed up computational speed.  

The problem I wish to tackle has 12 equations, invovles 5th order polynomials, and n ~= 300000.  Solving this set of equations takes 2-3 hours.

Anyone know a more efficient method?  Thanks for reading :D

Please look at the following set.

Why?

Download Set.mw

I'd expect the following to give the result "c+2".

> c := a+b

> simplify(a+b+2)

How can I let Maple know that I'd prefer it to write "c" in place of "a+b" when possible?

The result of the following lines in Maple is V := [5., 3.,5. 11., 6.] that I think should be V := [5., 3.,5. 0., 6.], is there somthing wrong?

v1:= Vector([-28., -63., -17., -55., 17.], datatype= float[8]):

V:= LinearAlgebra:-Modular:-Mod(11, v1, float[8]);

bug.mw

Hello, Please how do I compute cdf of student t distribution in maple Tξ+1(.). I have a function that i nvolves student t distribution but finding it difficult to compute student t in the funcion. I am new to maple.

Hi all,

I tried to create the*.exe file by C and call the kernel of maple for calculation.

To understand the OpenMaple, I ran the OpenMaple C code sample, “simple.c” in “<Maple>\ samples\OpenMaple\simple” through Microsoft Visual C++ 2008 but got the incorrect result:

It’s seems that the error is happen due to the wrong maple directory. But according to the description of "kernelopts" in help, the value of mapledir cannot be set.

Refer to the description of  "OpenMaple,Examples" in help , both header file path and library file path had been set:

O/S: Windows (32-bit)

Header file Directories: "C:\Program Files\Maple 17\extern\include"

Library Directories: "C:\Program Files\Maple 17\bin.win"

Environment Variable: "C:\program files\Maple 17\bin.win"

I'd appreciate any help on this topic. Thank a lot.

Dear Maple experts:

I have a very simple question:

I have a polynomial p(x) with integer coefficients and a prime p.  I want to reduce the exponents of this polynomial mod p.  So for example, if p(x) = 1 + x^3 + x^17 + x^19 and p is 17. Then I want Maple to output 1+x^3+1+x^2.

I know how to reduce the coefficients mod p, but not the exponents. Can someone suggest how I might go about doing this.  Thank you very much for your help.

Best wishes

Sunil