Maple 13 Questions and Posts Maple 13 Questions and Posts Feed

These are Posts and Questions associated with the product, Maple 13

 

 

Dear sir

 

I try the below program and it is not executing because of error and that error is " unable to match delimiters" 

Please can you varify it.

sol1 := dsolve([diff(diff(diff(f(eta),eta),eta),eta)+f(eta)*diff(diff(f(eta),eta),eta)+((2*n)/((n+1)))*(1-diff(f(eta),eta)^2) = 0, 1/(Pr) *diff(diff(theta(eta),eta),eta)+f(eta)*diff(theta(eta),eta)-((2*p)/((n+1)))diff(f(eta),eta)*theta(eta) = 0, f(0) = 0, D(f)(0) = 1+lambda*'@@'(D,2)(f)(0), D(f)(10) = 1, theta(0)=0, theta(0)=1+sigma*D(theta(0)),theta(10)=1], numeric, method = bvp);  plots[odeplot](sol1, [eta, `@@`(D,2)(f)(eta)], color = red,axes=boxed);

RVTL Cream is a brand-new skincare item readily available which claims to "powerfully combined with properly reduce wrinkles forever" with the use of an active ingredient that is distinct to their cutting-edge product formula. Ageless skin is a usual dream individual, young and also old, are aiming for. Unless you start to acknowledge that it takes more than simply a wrinkle Cream to make it occur, you will certainly not have the ability to attain this objective. RVTL Anti-Aging Cream could buy online from its official website http://hikehealth.com/rvtl-anti-aging-cream-reviews/

Naturally Not! L'etoile Cream is definitely free from any type of economical fillers and extreme chemicals that decrease the opportunity of side-effects. It is created with herbal essences that are medically and also scientifically examined in the qualified labs in order to preserve the high quality of an item. This formula is the most effective age-defying remedy that conveniently battles against premature indicators of aging. It is medically tested anti-aging item that helps you to acquire a more youthful, healthy and balanced, vibrant and also radiant skin in a short period of time. This anti-aging product is recommended by the various skin treatment professionals, medical professionals, skin doctors and also numerous users. The free trial of L'etoile Anti-Aging Skin Cream is now available here http://hikehealth.com/letoile-anti-wrinkle-cream/

 

dear sir 

 

i dont know the method how to download shooting command in mapple 13, so please can you tell how to download it.

> restart;
> libname = [shootlib, libname];
> with(shoot);
Error, invalid input: with expects its 1st argument, pname, to be of type {`module`, package}, but received shoot
> with(plots);
Pr := 10; s = -.1; lambda := 0; Gr := 1.0; Gm := 1.0; beta := -1.20;
10
s = -0.1
0
1.0
1.0
-1.20
> M := 0.; z := .1; Xi := .5; Nt := .5; Nb := .2; l := 5; Nr := .5; epsilon1 := .2; epsilon2 := .2;
0.
0.1
0.5
0.5
0.2
5
0.5
0.2
0.2
> Prff := Pr/(1+4.*N*(1/3));
10
-----------------
1 + 1.333333333 N
> FNS := {f(eta), h(eta), r(eta), u(eta), v(eta), theta(eta), `ϕ`(eta)};
{f(eta), h(eta), r(eta), u(eta), v(eta), theta(eta), ϕ(eta)}
> ODE := {diff(h(eta), eta)+.75*l*f(eta)*h(eta)-(1/4)*l*u(eta)*epsilon2-Nt*(.75*f(eta)*r(eta)-(1/4)*u(eta)*epsilon1+Nb*r(eta)*h(eta)+Nt*r(eta)*r(eta))/Nb = 0, .75*f(eta)*r(eta)+diff(r(eta), eta)-(1/4)*u(eta)*epsilon1+Nb*r(eta)*h(eta)+Nt*r(eta)*r(eta) = 0, diff(v(eta), eta)+3*(f(eta)*v(eta)-u(eta)*u(eta))/(4*Pr)-(M+lambda)*u(eta)+theta(eta)-Nr*`ϕ`(eta) = 0, diff(f(eta), eta) = u(eta), diff(u(eta), eta) = v(eta), diff(theta(eta), eta) = r(eta), diff(`ϕ`(eta), eta) = h(eta)};
/ / d \
{ 0.75 f(eta) r(eta) + |----- r(eta)| - 0.05000000000 u(eta)
\ \ deta /

2 / d \ 3
+ 0.2 r(eta) h(eta) + 0.5 r(eta) = 0, |----- v(eta)| + -- f(eta) v(eta)
\ deta / 40

3 2 / d \
- -- u(eta) + theta(eta) - 0.5 ϕ(eta) = 0, |----- h(eta)|
40 \ deta /

+ 3.75 f(eta) h(eta) - 0.1250000000 u(eta) - 1.875000000 f(eta) r(eta)

2
- 0.5000000000 r(eta) h(eta) - 1.250000000 r(eta) = 0,

d d d
----- f(eta) = u(eta), ----- u(eta) = v(eta), ----- theta(eta) = r(eta),
deta deta deta

d \
----- ϕ(eta) = h(eta) }
deta /
> IC := {f(0) = s, h(0) = xi, r(0) = tau, u(0) = 0, v(0) = alpha(0), theta(0) = 1-(1/4)*epsilon1, `ϕ`(0) = (1/4)*epsilon2};
{f(0) = s, h(0) = xi, r(0) = tau, u(0) = 0, v(0) = alpha(0),

theta(0) = 0.9500000000, ϕ(0) = 0.05000000000}
> L := 2;
2
> BC = {u(L) = 0, theta(L) = 0, `ϕ`(L) = 0};
BC = {u(2) = 0, theta(2) = 0, ϕ(2) = 0}
> S := Shoot(ODE, IC, BC, FNS, [alpha = .42453091564332, tau = -.21166705749821127, xi = -.4944583739651814]);
/ / / d \
Shoot|{ 0.75 f(eta) r(eta) + |----- r(eta)| - 0.05000000000 u(eta)
\ \ \ deta /

2 / d \ 3
+ 0.2 r(eta) h(eta) + 0.5 r(eta) = 0, |----- v(eta)| + -- f(eta) v(eta)
\ deta / 40

3 2 / d \
- -- u(eta) + theta(eta) - 0.5 ϕ(eta) = 0, |----- h(eta)|
40 \ deta /

+ 3.75 f(eta) h(eta) - 0.1250000000 u(eta) - 1.875000000 f(eta) r(eta)

2
- 0.5000000000 r(eta) h(eta) - 1.250000000 r(eta) = 0,

d d d
----- f(eta) = u(eta), ----- u(eta) = v(eta), ----- theta(eta) = r(eta),
deta deta deta

d \
----- ϕ(eta) = h(eta) }, {f(0) = s, h(0) = xi, r(0) = tau, u(0) = 0,
deta /

v(0) = alpha(0), theta(0) = 0.9500000000, ϕ(0) = 0.05000000000}, BC,

{f(eta), h(eta), r(eta), u(eta), v(eta), theta(eta), ϕ(eta)}, [

alpha = 0.42453091564332, tau = -0.21166705749821127,

\
xi = -0.4944583739651814]|
/
RungeKutta(ODE, BC, alpha = .42453091564332, tau = -.21166705749821127, xi = -.4944583739651814, output=plot);
/ / / d \
RungeKutta|{ 0.75 f(eta) r(eta) + |----- r(eta)| - 0.05000000000 u(eta)
\ \ \ deta /

2 / d \ 3
+ 0.2 r(eta) h(eta) + 0.5 r(eta) = 0, |----- v(eta)| + -- f(eta) v(eta)
\ deta / 40

3 2 / d \
- -- u(eta) + theta(eta) - 0.5 ϕ(eta) = 0, |----- h(eta)|
40 \ deta /

+ 3.75 f(eta) h(eta) - 0.1250000000 u(eta) - 1.875000000 f(eta) r(eta)

2
- 0.5000000000 r(eta) h(eta) - 1.250000000 r(eta) = 0,

d d d
----- f(eta) = u(eta), ----- u(eta) = v(eta), ----- theta(eta) = r(eta),
deta deta deta

d \
----- ϕ(eta) = h(eta) }, BC, alpha = 0.42453091564332,
deta /

\
tau = -0.21166705749821127, xi = -0.4944583739651814, output = plot|
/
>

 

 

Dear sir 

in the above problem im geiitng the problem with , with(shoot) command and even it is not executing at

S := Shoot(ODE, IC, BC, FNS, [alpha = .42453091564332, tau = -.21166705749821127, xi = -.4944583739651814]) this command, here alpha,tau and zi variable should change.

> restart;
> with(plots);
> Eql := diff(f(eta), eta, eta, eta)+.5*f(eta)*(diff(f(eta), eta, eta)) = 0;
/ d / d / d \\\ / d / d \\
|----- |----- |----- f(eta)||| + 0.5 f(eta) |----- |----- f(eta)|| = 0
\ deta \ deta \ deta /// \ deta \ deta //
> blt := 10;
10
> bcs1 := f(0) = f0, (D(f))(0) = 0, (D(f))(blt) = 1;
f(0) = f0, D(f)(0) = 0, D(f)(10) = 1
> L := [0];
[0]
> for k to 1 do R := dsolve(eval({Eql, bcs1}, f0 = L[k]), f(eta), numeric, output = listprocedure); X1 || k := rhs(R[3]); X2 || k := rhs(R[4]) end do;
[
[eta = proc(eta) ... end;, f(eta) = proc(eta) ... end;,
[

d
----- f(eta) = proc(eta) ... end;,
deta

d / d \ ]
----- |----- f(eta)| = proc(eta) ... end;]
deta \ deta / ]
proc(eta) ... end;
proc(eta) ... end;
> print([X2], [1 .. 1, 0]);

 

dear sir/madam

 

in the above problem i should get the asnser (at print line) but its not getting so please can you tell me why it is not getting.

 

 

Dear sir/madam

 

Iwas using the shooting technic to solve my problem. But i'm not getting the solution because in that problem the shooting command is not working. So Kindly requesting you that can tell me what is the shootlib or shoot command or shootlib.

CogniShield        `        Once you've acknowledged a problem is improving oneself, is in fact very easy. All it takes is one minor energy everyday. Give attention to one facet of personality or your lifetime you'd like to boost, and ensure it is your mantra. Target every exercise, every discussion that evening around that primary, and stick with it. You may experience good!
http://nutrahealthtrimsite.com/cognishield-reviews/

A prime producing polynomial.

 

Observations on the trinomial n2 + n + 41.

 

by Matt C. Anderson

 

September 3, 2016

 

The story so far

 

We assume that n is an integer.  We focus our attention on the polynomial n^2 + n + 41.

 

Furthur, we analyze the behavior of the factorization of integers of the form

 

h(n) = n2 + n + 41                                          (expression 1)

 

where n is a non-negative integer.  It was shown by Legendre, in 1798 that if 0 ≤ n < 40 then h(n) is a prime number.

 

Certain patterns become evident when considering points (a,n) where

 

h(n) ≡ 0 mod a.                                             (expression 2)

 

The collection of all such point produces what we are calling a "graph of discrete divisors" due to certain self-similar features.  From experimental data we find that the integer points in this bifurcation graph lie on a collection of parabolic curves indexed by pairs of relatively prime integers.  The expression for the middle parabolas is –

 

p(r,c) = (c*x – r*y)2 – r*(c*x – r*y) – x + 41*r2.           (expression 3)

 

The restrictions are that 0<r<c and gcd(r,c) = 1 and all four of r,c,x, and y are integers.

 

Each such pair (r,c) yields (again determined experimentally and by observation of calculations) an integer polynomial a*z2 + b*z + c, and the quartic h(a*z2 + b*z + c) then factors non-trivially over the integers into two quadratic expressions.  We call this our "parabola conjecture".  Certain symmetries in the bifurcation graph are due to elementary relationships between pairs of co-prime integers.  For instance if m<n are co-prime integers, then there is an observable relationship between the parabola it determines that that formed from (n-m, n).

 

We conjecture that all composite values of h(n) arise by substituting integer values of z into h(a*z2 + b*z + c), where this quartic factors algebraically over Z for a*z2 + b*z + c a quadratic polynomial determined by a pair of relatively prime integers.  We name this our "no stray points conjecture" because all the points in the bifurcation graph appear to lie on a parabola.

 

We further conjecture that the minimum x-values for parabolas corresponding to (r, c) with gcd(r, c) = 1 are equal for fixed n.  Further, these minimum x-values line up at 163*c^2/4 where c = 2, 3, 4, ...  The numerical evidence seems to support this.  This is called our "parabolas line up" conjecture.

 

The notation gcd(r, c) used above is defined here.  The greatest common devisor of two integers is the smallest whole number that divides both of those integers.

 

Theorem 1 - Consider h(n) with n a non negative integer. 

h(n) never has a factor less than 41.

 

We prove Theorem 1 with a modular construction.  We make a residue table with all the prime factors less than 41.  The fundamental theorem of arithmetic states that any integer greater than one is either a prime number, or can be written as a unique product of prime numbers (ignoring the order).  So if h(n) never has a prime factor less than 41, then by extension it never has an integer factor less than 41.

 

For example, to determine that h(n) is never divisible by 2, note the first column of the residue table.  If n is even, then h(n) is odd.  Similarly, if n is odd then h(n) is also odd.  In either case, h(n) does not have factorization by 2.

 

Also, for divisibility by 3, there are 3 cases to check.  They are n = 0, 1, and 2 mod 3. h(0) mod 3 is 2.  h(1) mod 3 is 1. and h(2) mod 3 is 2.  Due to these three cases, h(n) is never divisible by 3.  This is the second column of the residue table.

 

The number 0 is first found in the residue table for the cases h(0) mod 41 and h(40) mod 41.  This means that if n is congruent to 0 mod 41 then h(n) will be divisible by 41.  Similarly, if n is congruent to 40 mod 41 then h(n) is also divisible by 41.

After the residue table, we observe a bifurcation graph which has points when h(y) mod x is divisible by x.  The points (x,y) can be seen on the bifurcation graph.

 

< insert residue table here >

 

Thus we have shown that h(n) never has a factor less than 41.

 

Theorem 2

 

Since h(a) = a^2 + a + 41, we want to show that h(a) = h( -a -1).

 

Proof of Theorem 2

Because h(a) = a*(a+1) + 41,

Now h(-a -1) = (-a -1)*(-a -1 +1) + 41.

So h(-a -1) = (-a -1)*(-a) +41,

And h(-a -1) = h(a).

Which was what we wanted.

End of proof of theorem 2.

 

Corrolary 1

Further, if h(b) mod c ≡ = then h(c –b -1) mod c ≡ 0.

 

We can observe interesting patterns in the “graph of discrete divisors” on a following page.

 

Patriot Power GreensIt's easy to incorporate exercise into your normal activities each day. Even if you have a very busy schedule, muscle building or aerobic training can be added to your day through your normal daily activities. For instance, hang onto the kitchen counter do a set of push ups as dinner is cooking.

 

 

 

Read more>>> http://www.perfecthealthcentre.com/patriot-power-greens/

 

Dear Colleagues,

 

I am not sure if there exist a simple way to handle the issues I am facing. I am trying to obtain numeric roots for a polynomial f(x,a). I know for sure that there can be many roots depending on the value of parameter a. However, I cannot say for sure how many roots are possible for each value of parameter a. Some of these roots are complex numbers. Also, I need to choose only those roots that have following properties:

1. They are real.

2. f(x*,a) i.e., function value at a root is positive. 

 

How do I solve f(x,a)=0 to store all roots in a set? Furthermore, how do I select and print roots that have the properties mentioned above? Is there a way to do filtering of a set specifying properties of the members of the set? Please suggest. Your help is highly appreciated.

 

Regards,

 

Omkar

 

 

It's most likely not an exaggeration to express that the PE market niche needs as reliable Male Enhancement reviews while can get. It joins the ranks of industries that produce products that deal with issues such as weight loss, hair growth, teeth whitening products while. To satisfy your curiosity, these people are the three primary reasons we require additional make enhancement reviews so you can know the most pertinent details.

i want a scheme of fractional differential equation so that i solve my questions and make a code of it.

please provide me the scheme

i have an example, u[t] = u[xx]^2+u[yy]^2+u[zz]^2 with subject to b.c. u[0](x,y,z,t):=2*sin(x)*sin(y)*sin(z)
i used adomian method to solve this P.D.E, but i failed to construct a code of 2D P.D.E.
kindly help me in this regard

Typically sets are created like:

A:={a,b,c};

B:={c,q,w,e};

and then you can carryout A union B or B\A

 

what if  you wanted to create the set as

A:={values in some three dimensional space};

B:={volume, based on values taken from A};

Can these relationships be set up in Maple? If so, how? If there are commands that specifically handle these types of sets, what does maple call them?  I've seen the term 'set function' but what might Maple call them?

Note: I am not even sure i 'tagged' this correctly because it I am not sure the proper terms for these functions/sets.

Thanks in advance for any help.

1 2 3 4 5 6 7 Last Page 1 of 43