restart; with(plots); Eq1 := diff(f(eta), `$`(eta, 3))-(diff(f(eta), eta))^2+m*f(eta)*(diff(f(eta), `$`(eta, 2)))-(M^2+lambda*P)*(diff(f(eta), eta)) = 0; Eq2 := diff(theta(eta), `$`(eta, 2))+m*pr*f(eta)*(diff(theta(eta), eta))-lambda1*pr*theta(eta)*(diff(f(eta), eta)) = 0; bcs1 := f(0) = s, (D(f))(0) = -1, (D(f))(10) = 1; pr := .72; M := 1; m := 2; lambda := 1; lambda1 := 1; bcs2 := theta(10) = 0, theta(0) = 1; L := [0.5e-1, .1, .2, .4, .6, .8, 1, 5, 10, 20]; for k to 10 do R := dsolve...

Hi everyone, I am getting this error message in maple can i get any help

Error, (in DynamicSystems:-RouthTable:-RouthTable) the polynomial must not contain complex values

Hi all

Can anyone suggest ways of speeding up this code ?

div_vec := proc(a::Vector,b::Vector)
  # procedure returns the element-byelement
  # division of vector a by vector b
  local i,c:
  c:=Vector(Dimension(a)):
  for i from 1 to Dimension(a) do
    c[i]:= a[i]/b[i]:
  end do:
  return c:
end proc:

Thanks

LR

Let G be an undirected graph having the vertices V={1,...,n}. A subset {i,j,k} is said to be a triangle of G if the complete graph with these vertices is a subgraph of G.
How to find the number of all triangles of G in an optimal way? The code should work with RandomGraph(400,1000).

Is there a simple way to have Maple re-formulate an expression like:

  r^2 * sum(A(j)*r^(n+j))

to :

  sum(A(j)*r^(n+j+2)

simplity, collect doesn't seem to do it.

Is there a simple function, or does one have to revert to the subsop procesure reported in a 2008 post.

Thanks.

I want maple 15 to show me how it works out the formula (transposition) from N = 40^(1.5t) to t = 0.666..7(ln(1/40)*N)

I want to know how it transposes this formula from N to t I want the steps the actual working, I can't seem to figure it out as I'm using maple 15 as a learning tool, I have all the student modules installed but have no idea what I'm doing here

> N = 40*exp(1.5*t);
                       N = 40 exp(1.5 t)

Hi all,

I wonder if it makes sense to use tables as datatype for efficient maple code. I need this datatype to pass parameters to a procedure which is called many times.

In particular, I have the following criteria:

* efficient (fast) to access for read and write.

* potentially thread save ( I can also imagine having individual copies for each thread)

* present in future Maple versions

* easy to transform into C-code later

I was introduced to the geometric interpretation of correlation and linear regression recently.

Orignially due to the famous statistician R.A.Fisher, the idea is that the correlation between 
two variables is the cosine of the angle between the 2 vectors in n-dimensional space.
This can be demonstrated in Maple as follows:

First, we represent each variable as a vector and transform it so that it is centred at its
mean and has a length equal...

I want to solve equations,program in maple as follows:

solve({n = b+2*c+q+2*r, (a+b+c)/(p+q+r) = 9, n*b-3.32*a*(a+p+2*n)*10^(-7)*t^(5/2)*exp(-18.27*10^4/t) = 0, n*c-3.32*a*(a+p+2*n)*10^(-7)*t^(5/2)*exp(-32.035*10^4/t) = 0, n*q-3.32*p*(a+p+2*n)*10^(-7)*t^(5/2)*exp(-9.16*10^4/t) = 0, n*r-3.32*p*(a+p+2*n)*10^(-7)*t^(5/2)*exp(-18.77*10^4/t) = 0, a+b+c+p+q+r+n-.73*10^28/t = 0}, {a, b, c, n, p, q, r})

I can't get the results but  "Warning, solutions may have been lost"

Can anyone help me write a procedure for Maple 15 that does the following:

INPUT: number of unknowns and equations n; augmented matrix A=[aij], where 1<=i<=n and 1<=j<=n+1.
OUTPUT: solution x[1], x[2], ... , x[n] or message that the linear system has no unique solution.

Step 1: For i=1,...,n-1 do steps 2-4.  # Elimination process.

Step 2: Let p be the smallest integer with i<=p<=n and A[p,i]≠0.
          ...

every time I enter / or ^, maple automatically changed the text I entered into fraction or power, and I am having hard time enter equations normally like the way I do in graphic calculator or matlab. I am forced to type all my equations on a text pad and then copy over.

is there a way to stop maple from auto formatting my input text? I am more of a matlab guy and I really need to use symbolics and integration abilities right now, but this version of maple is making...

Problem. Let MNPQ be a square.  Find the other two vertices,  knowing that,  the vertices M(5; 3; -1), P(2; 3; -4) and N lies on the plane x + y - z  - 6 = 0.

This is my code

> restart:

with(LinearAlgebra):

M:=<5,3,-1>:

P:=<2,3,-4>:

N:=<x,y,z>:

A:=DotProduct(M-N,P-N,conjugate =false):

I have this

plotS := plots[:-implicitplot3d](S0(2, 1, x0, sigmaH) = S0(c, delta, xT, sigmaL), c = 0 .. 4, delta = 1 .. 3, xT = .8 .. 1)

to draw the graph below. What I would really like is to revert the direction of the xT axis. Any way to do this??

Thank you for your help

neeeeed help
Can someone help me to figure out what's wrong with my polygon's point representation inside my attachmed program? I  am not so much experieced with maple,actually I am a beginner, so can't see the fault in coding...

I'd really appreciate one's help,thx 

Hi,

Im trying to animate a simple pendulum with maple 15. I'm able to make to the pendulum masse move, but, somehow, I can't animate the rope of the pendulum. I tried to draw the rope with the plottools library line , but no success.

Pendulum:=proc(x,y)plots[pointplot]([x,y],color=blue, symbol=solidcircle,symbolsize=25) end proc:
A:=animate(Pendulum,[XCoordinate,YCoordinate],t=0..8,frame=100):
Rope:=plottools[line]([0,1],[XCoordinate,YCoordinate],color=blue,thickness=3):