MaplePrimes Questions

program a procedure repeatedEls which takes a list and returns the sublist consisting of all elements that appeared more than once in the given list.

repeatedEls([a,b,c,d,c,d,e,f,a]);

[a,b,c]

i need to write a procedure for two sets whose final output is their intersection.

 

help!

I have a set of partial differential equations and one unknown function f(u,v) which must contain u*Heaviside(u) and v*Heaviside(v) multiplications. Heaviside(u) is the Heaviside step function for the parameter u and it is already defined in Maple.

The solution should come in terms of these multiplications, that is, u or v, or Heaviside(u) or Heaviside(v) cannot occur alone.

I tried a solution of the form,

I want to graph nonlinear inequalities in two variables, but  Inequal works only for linear inequalities.  How to proceed?

Alla

Help!  Is anyone using MapleTA authentication with the LDAP on SUN serves.  It requires a two step authentication that I do not understand.  It would be helpful if someone has an example of how this is done.

i've a problem to understanding the concept of generating random number by using modulo. The basic modulo , let say a:= e mod m and i want to extend it to

x 0 = given,     x n+1 = P 1 x n + P 2       (mod N)    n = 0,1,2,...     (*)

But then how to implement that modulo to generate the random generator? and my latpop just 32 bits only. anybody would help me??

okay i need to write a procedure (call it setDiff) that takes two sets and returns the set of elements in the first list that DO NOT appear in the second.

for example.

setDiff({1,2,3,4,5},{2,4,6,8});

would return

{1,3,5}

 

so stuck. please help!!

I have 4 matrixes such as  P, P1, P2,P3

what can i do paint four 3D-lines  in one plot with points in the 4 matrixs?

 P := Matrix(51, 3);

R := proc (s) options operator, arrow; 0.6e-1*(arctan(10*s/1.3-3.0)/Pi+1/2) end proc;

y := proc (s) options operator, arrow; evalf((-1)*0.6e-1*(arctan(10*s/1.3-3.0)/Pi+1/2)*cos(6*Pi*s/1.3)) end proc;

z := proc (s) options operator, arrow; evalf(0.6e-1*(arctan(10*s/1.3-3.0)/Pi+1/2)*sin(6*Pi*s/1.3)) end proc

for i to 51 do

hi

i have a directed graph and i have to find all possible ways from a Node to another. with which command can maple calculate all possibel ways?

 

i just found only a command for minimal spannin tree, but my edges are not weighted.

Greetings All

I've had help creating some commands in mathematica 6 but prefer to use maple 11 (because maple just seems easier for me to use)  Does anyone know how I can convert mathematica 6 commands to maple 11 commands.  The following commands are below and an example of the ouput I'm trying to get with maple 11.

Mathematica 6 code

Input commands:

data ={{0,0},{.5,-1},{1,0},{2,2},{3,0},{4,-2.750000000},{5,-4},{6,-2.750000000},{7,0},

{8,2.937500000},{9,5.500000000},{10,7.312500000},{11,8},{12,7.312500000},

{13,5.5},{14,2.937500000},{15,0},{16,-2.918367347},{17,-5.346938775},

{18,-6.795918367},{18.5,-7},{19,-6.795918368},{20,-5.346938776},

{21,-2.918367347},{22,0},{23,2.84},{24,4.72},{24.5,5},{25,4.72},{26,2.84},{27,0}};

f = Interpolation[data, PeriodicInterpolation -> True];

<< "FourierSeries`"

s[x_] = N[
  FourierTrigSeries[f[x], x, 31, FourierParameters -> {-1, 1/27}]]

discr = Interpolation[data /. {x_, y_} -> {x, y},
   InterpolationOrder -> 0];

g[x_] = Piecewise[{{discr[x], 0 < x < 27}, {0, True}}];

Show[Plot[s[x], {x, 0, 27}, PlotStyle -> Red, PlotRange -> {-9, 10}],
 Plot[g[x], {x, 0, 27}, Filling -> Axis],
 ListPlot[data, Filling -> Axis, PlotRange -> {0, 27}]]

 

Output:

0.61887- 0.680232 Cos[0.232711 x] + 2.96293 Cos[0.465421 x] -
 0.532024 Cos[0.698132 x] - 0.87105 Cos[0.930842 x] -
 0.708467 Cos[1.16355 x] - 0.510603 Cos[1.39626 x] -
 0.236222 Cos[1.62897 x] - 0.112403 Cos[1.86168 x] -
 0.0682778 Cos[2.0944 x] - 0.0317201 Cos[2.32711 x] -
 0.00399665 Cos[2.55982 x] + 0.0110171 Cos[2.79253 x] +
 0.0150056 Cos[3.02524 x] + 0.0156793 Cos[3.25795 x] +
 0.0122262 Cos[3.49066 x] + 0.00657111 Cos[3.72337 x] +
 0.00432201 Cos[3.95608 x] + 0.00341808 Cos[4.18879 x] +
 0.00370543 Cos[4.4215 x] + 0.00333083 Cos[4.65421 x] +
 0.00210063 Cos[4.88692 x] + 0.00505182 Cos[5.11963 x] +
 0.00866377 Cos[5.35234 x] + 0.0110508 Cos[5.58505 x] +
 0.0103873 Cos[5.81776 x] + 0.00850073 Cos[6.05047 x] +
 0.00811838 Cos[6.28319 x] + 0.00689916 Cos[6.5159 x] +
 0.0069005 Cos[6.74861 x] + 0.00596679 Cos[6.98132 x] +
 0.00358397 Cos[7.21403 x] + 2.25013 Sin[0.232711 x] -
 4.51511 Sin[0.465421 x] + 0.380184 Sin[0.698132 x] +
 0.461366 Sin[0.930842 x] + 0.0632479 Sin[1.16355 x] -
 0.135095 Sin[1.39626 x] - 0.160692 Sin[1.62897 x] -
 0.131694 Sin[1.86168 x] - 0.118779 Sin[2.0944 x] -
 0.0966167 Sin[2.32711 x] - 0.0797548 Sin[2.55982 x] -
 0.0599806 Sin[2.79253 x] - 0.0380326 Sin[3.02524 x] -
 0.0247422 Sin[3.25795 x] - 0.0141664 Sin[3.49066 x] -
 0.0078713 Sin[3.72337 x] - 0.0060369 Sin[3.95608 x] -
 0.0062354 Sin[4.18879 x] - 0.00650479 Sin[4.4215 x] -
 0.00560183 Sin[4.65421 x] - 0.00806245 Sin[4.88692 x] -
 0.00982397 Sin[5.11963 x] - 0.00853789 Sin[5.35234 x] -
 0.00582364 Sin[5.58505 x] - 0.00249366 Sin[5.81776 x] -
 0.00125506 Sin[6.05047 x] - 0.0000310571 Sin[6.28319 x] +
 0.000971067 Sin[6.5159 x] + 0.00160663 Sin[6.74861 x] +
 0.00321022 Sin[6.98132 x] + 0.00388205 Sin[7.21403 x]

 

tia sal2

Sorry if I posted in the wrong spot.

I have an old laptop I'm giving to my daughter to play around on and I'm installing Maple V version 3 on it.  Yes, laugh it's a 486 DX4 toshiba laptop, but I got it for free and I don't mind if the kids play around with it. 

I had Maple V version 3 so I installed it on the laptop.  I don't think any of the newer versions above ver.5 would work with a 486, maybe version 6 but I have 5 so I'm using that.

Hello, guys.

I'm having this assignment in one of my school subjects, but I just can't get it right:

"Program Cauchy's problem for the heat conduction equation on the circle S = {x mod 2*Pi}

ut = uxx , u(0, x) = Phi(x), t > 0, x belongs to S

in Fourier series. Illustrate the solution using 2Dplot."

Greetings all

I'm looking for a book or free online source / video that helps explains/teaches recusions

 

tia sal2

Greetings All

Question on array and recursion type of calculations in maple 11 tia sal2

I have a procedure digitalrootxval which calculates part of the final x value

digitalrootxval := proc (n)
if n = 0 then
return 0
elif n = 1 then
return 1
else return modp(n-1, 9)+1
end if
end proc:

and I have two different procedure arrays that determine how the y value should be calculated. The first procedure array addfib:

Dear All, I'm trying to make an asymptotic expansion of the following integral: A := m-> (x-sqrt(x^2+2*x*m+m^2-1))/(sqrt(x)*sqrt(x^2+2*x*m+m^2-1)) ; IntegralA := m-> evalf(Int(A(x, m), x = 0 .. infinity)) ; and similarly for two others P3 := m-> -(-1+4*x^2*m^2+8*x^3*m+2*x*m-3*x^2+m^2)/((2*x^2+1+2*sqrt((x+m)^2/((x+m+1)*(x+m-1)))*x^2)*(x+m+1)*(x+m-1)*sqrt(x)) ; IntegralP3:=m->evalf(Int(P3(x,m)/2,x=0..infinity)); and lastly P1:=(x,m)->sqrt(x)/(sqrt((x+m)^2-1)*(x+m+sqrt((x+m)^2-1))); IntegralP1:=m->evalf(Int(P1(x,1),x=0..infinity));
First 1960 1961 1962 1963 1964 1965 1966 Last Page 1962 of 2155