MaplePrimes Questions

I'm working on my master thesis and trying to solve this equation on maple, after I developed my equation and solving it for N=2,3 and then trying to solve it for N=4 and 5 it took so much long time(more than two days without get any answer), so i'm asking you now to help me reducing the time for solving this complicated equation. 

Shklovskii_N_spheres_with_tails.mw

a := .4; lB := .714; R := 3.2; Z := 24; L := 88; `ℓ` := 2*Z/eta; eta := 1; b := .7; N := 4; Lx = (-N*l+L)/N; r = Lx+2*R

.4

 

.714

 

3.2

 

24

 

88

 

48

 

1

 

.7

 

3

 

Lx = 88/3-l

 

r = Lx+6.4

(1)

F := N*(l*ln(R/a)-l*ln(l/R)+(l-`ℓ`)^2/(2*R))+((N-1)*((L-l)/(N-1)))*ln((L-l)/((N-1)*a))+2*(L-l)*ln((L-l)/((N-1)*a))/(N-1)+sum(((N-q)*(l-`ℓ`)*(l-`ℓ`))/(q*(2*R+l)+(q-1)*(L-l)/(N-1)), q = 1 .. N)+sum((2*N-2*q)*(l-`ℓ`)*ln(((L-l)/(N-1)+(2*q-1)*R+(q-1)*(L-l)/(N-1))/((2*q-1)*R+(q-1)*(L-l)/(N-1))), q = 1 .. N-1)+sum((2*(l-`ℓ`))*ln(((L-l)/(N-1)+(2*q-1)*R+(q-1)*(L-l)/(N-1))/((2*q-1)*R+(q-1)*(L-l)/(N-1))), q = 1 .. N)+sum((N-q-1)*((2*(L-l)/(N-1)+2*q*R+(q-1)*(L-l)/(N-1))*ln(2*(L-l)/(N-1)+2*q*R+(q-1)*(L-l)/(N-1))-2*((L-l)/(N-1)-2*q*R+(q-1)*(L-l)/(N-1))*ln((L-l)/(N-1)-2*q*R+(q-1)*(L-l)/(N-1))+(2*q*R+(q-1)*(L-l)/(N-1))*ln(2*q*R+(q-1)*(L-l)/(N-1))), q = 1 .. N-1)+sum(2*((2*(L-l)/(N-1)+2*q*R+(q-1)*(L-l)/(N-1))*ln(2*(L-l)/(N-1)+2*q*R+(q-1)*(L-l)/(N-1))-2*((L-l)/(N-1)-2*q*R+(q-1)*(L-l)/(N-1))*ln((L-l)/(N-1)-2*q*R+(q-1)*(L-l)/(N-1))+(2*q*R+(q-1)*(L-l)/(N-1))*ln(2*q*R+(q-1)*(L-l)/(N-1))), q = 1 .. N-1)+(2*(L-l)/(N-1)+2*N*R+(N-1)*((L-l)/(N-1)))*ln(2*(L-l)/(N-1)+2*N*R+(N-1)*((L-l)/(N-1)))-2*((L-l)/(N-1)+2*N*R+(N-1)*((L-l)/(N-1)))*ln((L-l)/(N-1)+2*N*R+(N-1)*((L-l)/(N-1)))+(2*N*R+(N-1)*((L-l)/(N-1)))*ln(2*N*R+(N-1)*((L-l)/(N-1)))

6.238324626*l-3*l*ln(.3125000000*l)+.4687500000*(l-48)^2+2*(88-l)*ln(110.0000000-1.250000000*l)+2.*(l-48.)^2/(6.400000000+l)+(l-48.)^2/(56.80000000+1.500000000*l)+6.*(l-48.)*ln(14.75000000-.1562500000*l)+4.*(l-48.)*ln((97.60000000-1.*l)/(53.60000000-.5000000000*l))+2.*(l-48.)*ln((148.-1.500000000*l)/(104.-1.*l))+3.*(94.40000000-1.*l)*ln(94.40000000-1.*l)-6.*(37.60000000-.5000000000*l)*ln(37.60000000-.5000000000*l)+35.64092141+2.*(144.8000000-1.500000000*l)*ln(144.8000000-1.500000000*l)-4.*(75.20000000-1.*l)*ln(75.20000000-1.*l)+2.*(56.80000000-.5000000000*l)*ln(56.80000000-.5000000000*l)+(195.2-2*l)*ln(195.2-2*l)-2*(151.2-(3/2)*l)*ln(151.2-(3/2)*l)+(107.2-l)*ln(107.2-l)

(2)

s := diff(F, l)

.9375000000*l-3*ln(.3125000000*l)+4.*(l-48.)/(6.400000000+l)-2.*(l-48.)^2/(6.400000000+l)^2-41.76167537-2*ln(110.0000000-1.250000000*l)-2.500000000*(88-l)/(110.0000000-1.250000000*l)-1.500000000*(l-48.)^2/(56.80000000+1.500000000*l)^2-.9375000000*(l-48.)/(14.75000000-.1562500000*l)-3.000000000*ln(144.8000000-1.500000000*l)+4.*ln(75.20000000-1.*l)-1.000000000*ln(56.80000000-.5000000000*l)+2*(l-48.)/(56.80000000+1.500000000*l)+2.*(l-48.)*(-1.500000000/(104.-1.*l)+1.*(148.-1.500000000*l)/(104.-1.*l)^2)*(104.-1.*l)/(148.-1.500000000*l)+6.*ln(14.75000000-.1562500000*l)+4.*ln((97.60000000-1.*l)/(53.60000000-.5000000000*l))+2.*ln((148.-1.500000000*l)/(104.-1.*l))+4.*(l-48.)*(-1./(53.60000000-.5000000000*l)+.5000000000*(97.60000000-1.*l)/(53.60000000-.5000000000*l)^2)*(53.60000000-.5000000000*l)/(97.60000000-1.*l)-3.*ln(94.40000000-1.*l)+3.000000000*ln(37.60000000-.5000000000*l)-2*ln(195.2-2*l)+3*ln(151.2-(3/2)*l)-ln(107.2-l)

(3)

solve(s, l)

104.4945628

(4)

NULL



Download Shklovskii_N_spheres_with_tails.mwShklovskii_N_spheres_with_tails.mw

 

I have two lists with differential monomials, like this: [y'y'', y''', (y'')^2].

List is rather big, i want to check if one such a list contains in other.

Seems to be that there is some internal procedure for this operation.

But I don't know what it is...

I have an ode in the form:

 

diff(u(x),x)-f(x)=u(x)^3+B(X)*u(x)+g(x)

how to extaract and name the different coefficients of the equation?

 

Thanks 

Hamada

Having a little trouble getting data from openstreetmap from export here

http://www.openstreetmap.org/export#map=17/43.4763/-80.5459

 

Dear friends:

If

n:=197

then

d:=convert(n,base,10) --> returns [7,9,1]

Is there a simple way for getting back n from d, i.e., 197 from [7,9,1] , not using a for loop?

Thanks and best regards

César Lozaada

 

 

 

 

 

 

 

 

 

Nm= p1. p2 ...pm + 1, for m more than or equals 1.

 

So N1 = p1 + 1 = 2 + 1 = 3, N2 = p1 p2 + 1 = 2  3 + 1 = 7, etc.

 

We prove that Nm is not divisible by any of p1, p2, . . . , pm, so that Nm is either a prime or it is divisible by a prime larger than pm.

 

(c) Use Maple to find out which of these numbers Nm, for m = 1, 2, . . . , 15, is actually prime.

 

Use Maple to compare pm with the smallest prime number that divides Nm, for m =1, 2, . . . , 15.

 

So I am brand new to using Maple and am trying to solve a system of ODE's. When I try and use dsolve however I reciever the error "function expected" and I am not sure why. The code I have is as follows

 

sys_ode := diff(A(t), t) = a*(A(t)+B(t))-b1*A(t)*(C(t)+D(t))-g1*A(t)*B(t), diff(B(t), t) = -b2*B(t)*(C(t)+D(t))+g1*A(t)*B(t), diff(C(t), t) = e*(b1*A(t)+b2*B(t))*C(t)-g2*b2*C(t)*B(t)-g3*C(t)*D(t), diff(D(t), t) = g2*b2*C(t)*D(t)-m*D(t)

dsolve([sys_ode])

 

I'm sure it is something simple, but I just can't seem to figure out where the issue is. Any help is much appreciated.

I'm trying to substitute one Differential equation into another differential equation.

 

eq1:=d*n(t)/dt = (rho(t)-beta)*n(t)/Lambda+lambda*C(t)+q

eq2:=diff(eq1, t)

resulting in -> eq2 := d*(diff(n(t), t))/dt = (diff(rho(t), t))*n(t)/Lambda+(rho(t)-beta)*(diff(n(t), t))/Lambda+lambda*(diff(C(t), t))

then I'm given that (diff(C(t), t)) is given by another equation: 

eq3:=d*C(t)/dt = beta*n(t)/Lambda-lambda*C(t)

 

At this point I'm trying to substitute equation 3 into equation 2 for diff(C(t),t)

eq4 := subs(diff(C(t), t) = rhs(eq2), eq5)

 

however no matter what way's I try this I get an error: 

Error, (in simpl/reloprod) invalid terms in product: (d*(diff(n(t), t))/dt = (diff(rho(t), t))*n(t)/Lambda+(rho(t)-beta)*(diff(n(t), t))/Lambda+lambda*(diff(C(t), t)))^-1

 

I then tried to map it but again i got an error specifically about the first parameter: 

Error, invalid operator parameter name

eq5:=map((d/dt C(t))->beta/Lambda*n(t)-lambda*C(t),eq2)

 

I'm just wondering if what I am trying to do is even possible in Maple? 

If anyone can help I would greatly appreciate it! 

The system :

 

Hello ..

 

I need codes bifurcation and cobweb for logistic map by maple ..

 

can you help me ?

 

 

 

Thanks ...

I am trying to recreate journal work for validating using another computer program so I am trying to use maple to solve the ODE, based on further research I found using laplace might be the best but I am having some trouble.

 

eq8:=d*(n(t)+C(t))/drho = -rho(t)/(l*alpha*K_c)

given the initial conditions of:

ICs:= n(0) = n_0, rho(0) = rho_0, C(0) = (beta-rho_0)*n_0/(l*lambda)

therefore: 

equation9 := dsolve({equation8, ICs}, {C(t), n(t)}, method = laplace)

 

Following this process I get the error: 

Error, (in dsolve) invalid initial condition

 

According to the journal work the solution I am looking for is: 

C(t)=-n(t)+(rho_0^2+rho(t)^2)/(2*l*alpha*K_c)+((Beta+l*lambda-rho_0)*n_0)/(l*lambda)

 

is there something that I'm doing wrong or missing? 

Any help would be greatly Appreciated! 

 

I want to simulate Inelastic collision

 

 

There has 2 ball which I can change  Quality and Radius.

 

 

 

one ball  move to another stirless ball with diferent angle

Hi

I need your help .. I solve a system and I get the error Warning, solutions may have been lost.

The maple code is attached.

testerror.mw

Thank you for your help.

 

hi everyone , i need your point of view in my question,any help would be appreciated in advance .

we have a discrete function named g(t) and a continous function f(t) in in convolution integral just like this :
int(f(t-x)*g(x),x=0..t) ; 
we have just g(x) in some special points int the interval (0..t) , thus i need to convert this integral to a series.
how should i do this ? can anyone help or any idea ? i need at first a mathematical solution or idea about how to do this and then, how to do this in a software ?
tnx again.

I am trying to define some functions by recursion relations but I get this error:

Error, (in type/realcons) too many levels of recursion

Please see the attached file for details:

File.mw

First 1383 1384 1385 1386 1387 1388 1389 Last Page 1385 of 2464