Dear experts

I am interested to solve the following equation numerically by Maple. I would appreciate it if you let me how I can do and what the boundary conditions and initial values are needed

eq:= diff(2*diff(eta(x,y,t),t)+3*eta(x,y,t)*diff(eta(x,y,t),x)+(1/3-1/epsilon/B)*diff(eta(x,y,t),x,x,x),x)+diff(eta(x,y,t),y,y)-1/sqrt(Pi*R)*int(diff(eta(x+zeta,y,t),x,x)/sqrt(zeta),zeta=0..t/epsilon)=0;
where

1) epsilon, B and r are constant

2) 1/epsilon/B is not equal to 1/3 at all

how to show which region of the plan belongs to the argument points between 0 and Pi/2 and the module points between 0 and 2 ?

Can anyone please help me out with the following integration

                      f(x) = tanh(x)/sqrt(x^2+1)

limits x_initial =1, x_final =100

Thanks

I am trying to work through an example in a textbook, but its a few years old and uses maple 2015. I am currently using the 2018 edition of maple. The code is an example of how to generate the points on an elliptic curve given a specific input. 
Here is the example code from the textbook:

epoints := proc(ec, x, ub, p)
    local ecurve, z, pct, k, i;
    pct := 0;
    for k from 0 to p-1 while pct <= ub do
        z := subs(x=k, ec) mod p;
        if z = 0 then
           pct := pct+1;
           ecurve[pct] := [k,z];
        fi:
        if z &^ ((p-1)/2) mod p = 1 then
           z := z &^ ((p+1)/4) mod p;
           ecurve[pct+1] := [k,z];
           ecurve[pct+2] := [k, -z mod p];
           pct := pct+2;
        fi:
    od:
    if pct > ub then
       pct := ub:
    fi:
    seq(ecurve[i], i=1..pct):
end:

Here is my code, written to work with Maple 2018:

ecpoints := proc (ec, x, ub, p) local ecurve, z, pct, k, i;
      pct := 0; for k from 0 to p-1 while pct <= ub
         do z := `mod`(subs(x = k, ec), p);
         if z = 0 then pct := pct+1;
            ecurve[pct] := [k, z] end if;
         if `mod`(z^((1/2)*p-1/2), p) = 1 then
            z := `mod`(z^((1/4)*p+1/4), p) = 1;
           ecurve[pct+1] := [k, z];
           ecurve[pct+2] := [k, `mod`(-z, p)];
           pct := pct+2 end if
   end do;
   if ub < pct then pct := ub end if;

   seq(ecurve[i], i = 1 .. pct)
end proc

The problem is with the output. The output should be [0, 5], [0, 14], [2, 4], [2, 15], [3, 6], [3, 13], [4, 6], [4, 13], [6, 0], [10, 16], [10, 3], [12, 6], [12, 13], [14, 16], [14, 3], [18, 17], [18, 2].
What I get is [0, 5 = 1], [0, 14 = 18], [2, 4 = 1], [2, 15 = 18], [3, 6 = 1], [3, 13 = 18], [4, 6 = 1], [4, 13 = 18], [6, 0], [10, 16 = 1], [10, 3 = 18], [12, 6 = 1], [12, 13 = 18], [14, 16 = 1], [14, 3 = 18], [18, 17 = 1], [18, 2 = 18]. 
Any hints on what I could be doing wrong here or what is going on?

Dear All, 

I am trying to solve the following differential equation, which is a kind of Spherical Harmonics. Can anyone please help me out how to solve this?

((D@@2)(y))(r)+(D(y))(r)/r-sin(y(r))*cos(y(r))/r^2+sin(y(r))^2/r-sin(y(r))-sin(2*y(r)) = 0

Thanks 

Dear all

I use Maple 2018 and have following problem:

I define following procedure and want to plot it. However Maple displays the coordinate system but does not plot anything nor gives and error message. Hope you can help.

Thanks

Murad

b:=proc(n)
local b,i:
 for i from 0 to n do
  if i=0 then
   b[0]:=0:
  elif i=1 then
   b[1]:=1:
  else
   b[i]:=(b[i-1]+b[i-2])/2:
  end if:
 end do:

return b[n]

end proc:

plot(b,0..10)

Maple 2018  has recently has  become sluggish to start up  -and very slow to respond to input. Can anyone suggest remedies?  I have plenty of space and CPU. Other apps seem to start fine.  Can any suggest a diagnosis and/or solution?

Melvin

Good day.

Reading through the Fuzzy C-Means routine (attached) written by the one-and-only Carl Love, I was wondering if anybody can tell me how to specify which points in the data belong most strongly to the assigned cluster. 

In the attached routine, there are 2 cases considered; two and three clusters. 

It would be interesting to obtain a list of all points that are assigned to each respective cluster.

Thanks for reading!

Fuzzy_clusters.mw

Any integer in [129,129+13^2[ 1s written as the sum of squares of separate integers equal to or less than 12.
examples:: 129=10^2+5^2+2^2, 130=11^2+3^2... 132=9^2+5^2+4^2+3^2+1^2...
179=12^2+5^2+3^2+1^2...297=12^2+10^2+7^2+2^2. Thank you.

Dear sir, I request to suggest the method for the following posted question.

How to find a rational function with give real roots 1,2,3  and oblique asymptote y=2-x?

Hi everyone,

In the RandomTools package, the Generate(integer(range = A..B)) function generates a random integer in the range A..B. All integers in that range have the same probability to be generated, that is, 1/nops([seq(A..B)]). However, I would like to specify the probabilities of each integer. How to do so?

Example: range = 1..5. Instead of P(X=j)=1/5 with j =1,2,3,4,5, let's say the probabilities should be as follows:

P(X=1) = 0.2, P(X=2) = 0.5, P(X=3) = P(X=4) = P(X=5) = 0.1

How to generate a random integer between 1 and 5 with these probabilities?

Thank you in advance.

Hello Guys and Girls,

I have a problem with animate command with background option..

I attached my maple worksheet for your review.

Could you help me out?  Thanks.

I love Maple,

Sincerely

Ali Guzel

I'm trying show the all roots of equations using Bairstow's methodt, but only shows the roots of Quadratic Factor and don't show the others roots of the other equation. Thanks

This the code:

Only show two roots: 0.4999999993, -0.9999999997, but the other roots are missing: 2, -1, 1+0.5i, 1-0.5i approximately, any solution?

I think it's in this part, but I can't think of how to implement it to get the missing roots.

Download Bairstow.mw