I need some help. I'm trying to solve this system of equations, but maple says the solutions may have been lost.

I don't know why. Here are the equations:

I have four equations,very unknown variables in the equation.

I am trying to solve for any 4 unknowns ,not must had be Zoo1.Zoo2.th1.th2,it can be Za1.Za2.Zb1.Zb2.  

Any help  would be greatly appreciated.

I was calculating the total derivative of a function but maple does not respond to the commands like alias,diff,totaldiff etc.

please see the attached pdf.multiplier.pdfmultiplier.pdf

The summation takes too long time. Please help me
 

We conjecture that the polynomial h(n) = n^2 + n + 41 is prime for an infinite number of values n.
We furthur conjecture that p(n) = n^2 + 1 is prime an infinite number of times.

I have shown that the set (x,y) with h(y) mod x is congruent to 0 can be written down.  It is p(x,y).  p(x,y) is the set of all divisors of h(n).  See

https://sites.google.com/site/primeproducingpolynomial/

landau.mw

Regards,

Matt

  how can I find equation discribing elliptic intersections and use lagrange to show the higest and lowest value ?    g 

I am trying to solve the particular system of partial differential equation. But I get the following error.pdsolve.mw
 

Download pdsolve.mw

I am trying to evaluate the following double integral where hypergeom([x,1/2],[3/2],C) is gauss hypergeometric function 2f1. maple gives back it unevaluated. I doubt it may be due to slow convergence of hypergeometric function. 
 

Download DOUBLE_INT_2.mw

I am trying to evaluate the following triple integral but it takes much time so i kill the job.

Download int_maple_prime2.mw

Dear sir,

in the program boundary conditions D(f)(0)=0 doesn't showing result but when use d(f)(0)=1 it will execute, why is this can you explain this ?program.mw
 

Hi Mapleprimes,

We know that '' rsolve '' is a recurrence equation solver.  It is more than an expression simplifier.

Congratulations to the Maple computer algebra team for creating such a great computer tool.  simply want to know more.

rsolve_on_May_16_2017.pdf

Surely there are many steps to determine the values to place.

Regards,

Matt

Dear please check once it showing an error program.mw as intial value is not conververging

I assigned

before an algebraic calculation so I would like to get  or have the program print the 70 digits of the answer and not just 10 digits. Because when I press ENTER, I get only 10 digits.

> restart;

with(plots);

pr := .72; p := 0; n := [.5, 1, 1.5]; s := 0; a := .2; b := 0; L := [red, blue, green]; l := 0; k := 1;

for j to nops(n) do R1 := 2*n[j]/(1+n[j]); R2 := 2*p/(1+n);

sol1 := dsolve([diff(diff(diff(f(eta), eta), eta), eta)+f(eta)*(diff(diff(f(eta), eta), eta))+R1*(1-(diff(f(eta), eta))^2) = 0, diff(diff(theta(eta), eta), eta)+pr*k*f(eta)*(diff(theta(eta), eta))+R2*pr*k*(diff(f(eta), eta))*theta(eta)+(2*(a*(diff(f(eta), eta))+b*theta(eta)))/(1+n[j]) = 0, f(0) = 1, (D(f))(0) = b*((D@@2)(f))(0), (D(f))(1.8) = 0, theta(0) = 1+s*(D(theta))(0), theta(1.8) = 1], numeric, method = bvp);

fplt[j] := plots[odeplot](sol1, [eta, diff(diff(f(eta), eta), eta)], color = L[j], axes = boxed); tplt[j] := plots[odeplot](sol1, [[eta, theta(eta)]], color = L[j], axes = normal) end do; plots:-display([seq(fplt[j], j = 1 .. nops(n))]);

plots:-display([seq(tplt[j], j = 1 .. nops(n))]);

staganation_point1.mw
 

can we chage the axis sir ?? like  f'' vs eta to f'' vs lambda.

Download staganation_point1.mw

> restart; for j to nops(n) do sys := diff(f(eta), eta, eta, eta)+f(eta)*(diff(f(eta), eta, eta))+1-(diff(f(eta), eta))^2 = 0, (diff(diff(theta(eta), eta), eta))/pr+f(eta)*(diff(theta(eta), eta))-(diff(f(eta), eta))*theta(eta) = 0; bcs := f(0) = 0, (D(f))(0) = l+b*((D@@2)(f))(0), (D(f))(-.5) = 1, theta(0) = 1+s*(D(theta))(-.5), theta(2) = 0; n := [1, 2, 3, 4, 5, 6]; pr := .71; p := 0; q := 0; b := 0; l := 0; s := 0; L := [red, blue, orange]; R1 := 2*n[j]/(1+n[j]); R2 := 2*p/(1+n); p := proc (f1, th1, { output::name := 'number' }) local res1, fvals, thvals, res2; option remember; res1 := dsolve({sys, f(1) = 0, theta(0) = 1+th1, (D(f))(0) = f1, (D(theta))(0) = th1, ((D@@2)(f))(0) = f1-1}, numeric, :-output = listprocedure); fvals := (subs(res1, [seq(diff(f(eta), [`$`(eta, i)]), i = 0 .. 2)]))(0); thvals := (subs(res1, [seq(diff(theta(eta), [`$`(eta, i)]), i = 0 .. 1)]))(0); res2 := dsolve({sys, f(0) = fvals[1], theta(0) = thvals[1], theta(5) = 0, (D(f))(0) = fvals[2], (D(f))(5) = 1}, numeric, :-output = listprocedure); if output = 'number' then [fvals[3]-(subs(res2, diff(f(eta), `$`(eta, 2))))(0), thvals[2]-(subs(res2, diff(theta(eta), eta)))(0)] else res1, res2 end if end proc; p1 := proc (f1, th1) p(args)[1] end proc; p2 := proc (f1, th1) p(args)[2] end proc; p(.3, -.2); par := fsolve([p1, p2], [.3, -.2]); res1, res2 := p(op(par), output = xxx); plots:-display(plots:-odeplot(res1, [[eta, f(eta)], [eta, theta(eta)]]), plots:-odeplot(res2, [[eta, f(eta)], [eta, theta(eta)]])); plots:-display(plots:-odeplot(res1, [[eta, diff(f(eta), eta)], [eta, diff(theta(eta), eta)]]), plots:-odeplot(res2, [[eta, diff(f(eta), eta)], [eta, diff(theta(eta), eta)]])); plots:-display(plots:-odeplot(res1, [[eta, diff(f(eta), eta, eta)]]), plots:-odeplot(res2, [[eta, diff(f(eta), eta, eta)]])); plots:-display(plots:-odeplot(res1, [[eta, diff(f(eta), eta)]])); fplt[j] := plots[odeplot](res1, [eta, diff(diff(f(eta), eta), eta)], color = L[j], axes = boxed); tplt[j] := plots[odeplot](res1, [[eta, theta(eta)]], color = L[j], axes = boxed) end do;
> plots:-display([seq(fplt[j], j = 1 .. nops(n))]);

Dear Sir

In my above problem i trying to plot for set of values of n but in plot command it not executing , can you do this why it is not executing ??

hy

i have to develop a code i which i have system of nonlinear equation 

i have to generate the matrix of that nonlinear equation then i want to do or apply any method say newton method and make a loop which help us to find a solution using some tolerance 

at the end i get a result in form of a table which give nth matrix then value of function matrix at nth value then error i-e xn-x(n-1) 

thanx in advance