I wish to solve for k interms of x, e is a constant in the equation k=x+e*sin(k). Using the solve function, i got 

RootOf(_Z-x-e*sin(_Z)) and using the function allvalues(RootOf(_Z-x-e*sin(_Z))) still gave the same expression in _Z. Please is there a way out because I need the value of k  as a substitute to another equation. Any help will be highly appreciated.
 

Ì am trying to convert this [APOh.txt] originally coded for mathematica to maple. In mathematica i ran into severa problems in ploting the function etc.. Anyhow so far failed. The code calls inputs from the followin text document [APO-48-10.txt] I am new to maple and its still unfamiliar. Is this possible to convert to maple?

when test most simple case one to one, and many to one these two reasonable cases, it run a very long time without exit the program.

when i test with the example in book Neural Network Design, it can output correctly but only for book example.

restart:
with(ExcelTools):
with(ListTools):
with(plots):
with(LinearAlgebra):
zipplus := proc(mm, pp)
return zip((x,y) -> x+y, mm, pp)
end proc:
zipminus := proc(mm, pp)
return zip((x,y) -> x-y, mm, pp)
end proc:
zipstar := proc(mm, pp)
return zip((x,y) -> x*y, mm, pp)
end proc:

metara := proc(pp,meaght,bb,mapp,deep)
if deep > 0 then
 pp2 := metara([seq(pp[i], i = 1 .. nops(pp))],meaght,bb,mapp,deep-1):
 mp := zip((x,y) -> x*y,pp2,meaght):
 mpsam := sum(mp[m],m=1..nops(pp2)):
 mpb := [seq(0, i = 1 .. nops(pp2))]:
 for ii from 1 to nops(bb) do
  mpb[ii] := evalf(mpsam + bb[ii]);
 od:
 pa := [seq(0, i = 1 .. nops(pp2))]:
 for ii from 1 to nops(bb) do
  pa[ii] := evalf(mapp[deep](mpb[ii])):
 od:
 return pa:
else
 return pp:
end if:
end proc:

perceptronrule1 := proc(p, t1, meaght1, b1, checksum, mapp)
 meaght3 := meaght1:
 b3 := b1:
 checksum2 := checksum;
 print(p[1]):
 while sum(checksum2[jj], jj=1..nops(p)) <> nops(p) do
  #print("sum(checksum2[jj], jj=1..nops(p))");
  #print(sum(checksum2[jj], jj=1..nops(p)));
  for ii from 1 to nops(p) do
   #print("metara(p[ii],meaght3,b3,mapp,1)");
   #print("p[ii]");
   #print(p[ii]);
   #print("b3");
   #print(b3);
   #print("meaght3");
   #print(meaght3);
   #print(metara(p[ii],meaght3,b3,mapp,1));
   #print("t1[ii]");
   #print(t1[ii]);
   e := zipminus(t1[ii], metara(p[ii],meaght3,b3,mapp,1));
   #print("e");
   #print(e);
   meaght2 := meaght3 + zipstar(e,p[ii]);
   #print("meaght2");
   #print(meaght2);
   #print("meaght3");
   #print(meaght3);
   #print("b3");
   #print(b3);
   b2 := b3 + e;
   #print("b2");
   #print(b2);
   #print("b3");
   #print(b3);
   #print("checksum2");
   #print(checksum2);
   diff1 := zipminus(meaght2, meaght3):
   diff2 := zipminus(b2, b3):
   if sum(diff1[m],m=1..nops(diff1)) = 0 and sum(diff2[m],m=1..nops(diff2)) = 0 then
    checksum2[ii] := 1:
   else
    checksum2[ii] := 0:
    b3 := b2:
    meaght3 := meaght2:
   end if:
  od:
 od:
 return [meaght3, b3, checksum];
end proc:

#Example from book
ppp := [[2,2],[1,-2],[-2,2],[-1,1]]:
check1 := [seq(0,ii=1..nops(ppp))];
ttt1 := [[0,0],[1,1],[0,0],[1,1]]:
mmmeaght1 := [seq(0,ii=1..nops(ppp[1]))]:
bbb1 := [seq(0,ii=1..nops(ppp[1]))]:
emap := [(x) -> if x < 0 then 0 else 1 end if, (x) -> evalf(1/(1+exp(x)))]:
#trace(perceptronrule1);
perceptronrule1(ppp,ttt1,mmmeaght1,bbb1,check1,emap);

#my testing for one to one
#after testing, it loop a very long time and not stop
ppp := [[0,0,0,1],[0,0,1,0],[0,1,0,0],[1,0,0,0]]:
check1 := [seq(0,ii=1..nops(ppp))];
ttt1 := [[0,0,0,1],[0,0,1,0],[0,1,0,0],[1,0,0,0]]:
mmmeaght1 := [0,0,0,0]:
bbb1 := [0,0,0,0]:
emap := [(x) -> if x < 0 then 0 else 1 end if, (x) -> evalf(1/(1+exp(x)))]:
#trace(perceptronrule1);
perceptronrule1(ppp,ttt1,mmmeaght1,bbb1,check1,emap);

#my testing for many to one
#after testing, it loop a very long time and not stop
ppp := [[1,1,0,0],[0,1,1,0],[0,1,0,1]]:
check1 := [seq(0,ii=1..nops(ppp))];
ttt1 := [[1,0,0,0],[0,1,0,0],[0,0,0,1]]:
mmmeaght1 := [0,0,0,0]:
bbb1 := [0,0,0,0]:
emap := [(x) -> if x < 0 then 0 else 1 end if, (x) -> evalf(1/(1+exp(x)))]:
#trace(perceptronrule1);
perceptronrule1(ppp,ttt1,mmmeaght1,bbb1,check1,emap);

#my testing for one to many
#after testing, it loop a very long time and not stop
ppp := [[1,0,0,0],[0,1,0,0],[0,0,0,1]]:
check1 := [seq(0,ii=1..nops(ppp))];
ttt1 := [[1,1,0,0],[0,1,1,0],[0,1,0,1]]:
mmmeaght1 := [0,0,0,0]:
bbb1 := [0,0,0,0]:
emap := [(x) -> if x < 0 then 0 else 1 end if, (x) -> evalf(1/(1+exp(x)))]:
#trace(perceptronrule1);
perceptronrule1(ppp,ttt1,mmmeaght1,bbb1,check1,emap);

Can somebody please expand the following double sum to produce a list of sequences?

(Sum(f[i], i = 0 .. 1))*(Sum(g[i, j, k], j = 0 .. 1)) for k = {1,2}

I need to make sure the operation order is correct, so I would like to verify my workings.

Thanks!

The maple I used at school is a much older version and when I do Definite Integrals there and copy it to Word as part of the project, it just copies perfectly.

Now I have Maple 16 at home and when I have a definite integral, I have to copy it using copy special and take it as an image to MS Word. That's not the problem. The problem is the limits sometimes seem to be cut off. The left hand-side image is the older version of Maple. Limits look perfect and even the integral sign is darker and so on. The right hand-side image is the Maple 2016. Can anyone help me change the style on Maple 2016 so it's like the old one so the integrals look better on my project. Thanks alot

Hello,

i need to represent a circle using the command [geometry] circle because i have a problem and i have to calculate an 

intersection between two circles whit command intersection() which is ruled by Package geometry.

For example, with the first circle  i did like the help page says

 But it's Error:

centre of circle(3300;2200)

radius=110

I don't understand the eror. Can you help me?

Thanks in advance.

Hello!

I have a question about densityplot.

I want to get this colormap:

As I understand, I should use plots:-densityplot(...) comand and "HSV" colorscheme, where H = [240..0], S=1, V=1.

But if i use zcoloring with this options, I will get wrong result.

My code:

restart;

a := 0; b := 1; #first and final point

plots:-densityplot(z, dummy = 0 .. 1, z = a .. b, grid = [2, 10], size = [90, 100], colorscheme = ["zcoloring", [proc (z) options operator, arrow; -240*(z-a)/(b-a)+240 end proc, proc (z) options operator, arrow; 1 end proc, proc (z) options operator, arrow; 1 end proc], colorspace = "HSV"], style = surface, axes = frame, labels = ["", ""], axis[1] = [tickmarks = []], title = "Test", titlefont = ["Calibri", "Bold", 16], axesfont = ["Arial", 14], size = [100, 500]); #densityplot with zcoloring option.

My result (zero must be equal to "Blue"):

I can't find mistake....

I am trying to model a disease. The equation is as follows:

S*X - f(X,S,Sp) = 100

I have data for S, I have data for X and I have data for f(X,S,Sp) however I want to find an equation for f(X,S,Sp) that has the best fit with the data because I need to use it later on in my calculation. If anyone is intrested S is the sensitivity of the blood test, Sp is the specificity of the blood test. This means that X*(1-Sp) is the number of false positives.

I currently dont have access to Maple hence I am doing all my modeling in excel 2016. So I am severly limited because excel is useless at algebra.

Maple.xlsx

I have a list
restart;
L := [10*x+y-6*z+66 = 0, 26*x-10*y-3*z+96 = 0, 2*x-y+6 = 0, 2*x-y+6 = 0, 4*x-5*y+3*z-6 = 0, 30*x-22*y+7*z+48 = 0, 2*x-2*y+z = 0, 26*x-19*y+6*z+42 = 0, 22*x-17*y+6*z+30 = 0, 14*x-30*y+23*z-96 = 0, 6*x-10*y+7*z-24 = 0, 2*x-7*y+6*z-30 = 0, 4*x-y-z+10 = 0, 42*x-2*y-19*z+20 = 0, 38*x-2*y-17*z+20 = 0, 30*x-y-14*z+10 = 0, 18*x+2*y-11*z-20 = 0, 6*x+13*y-16*z-130 = 0, 18*x+7*y-16*z-70 = 0, 6*x+2*y-5*z-20 = 0, 14*x+15*y-22*z-150 = 0, 18*x+13*y-22*z-130 = 0, 6*x+4*y-7*z-40 = 0, 26*x-3*y-10*z+110 = 0, 10*x-6*y+z+52 = 0, 2*x-z+8 = 0, 26*x+6*y-19*z+92 = 0, 22*x+6*y-17*z+76 = 0, 2*x+y-2*z+6 = 0, 14*x-18*y+11*z+92 = 0, 2*x-6*y+5*z+20 = 0, 2*x+6*y-7*z-4 = 0, 10*x-3*y-2*z+22 = 0, 26*x-7*y-6*z+66 = 0, 2*x-y = 0, y-z+11 = 0, 4*x-9*y+7*z-77 = 0, 6*x-5*y+2*z-22 = 0, 24*x-13*y+z-11 = 0, 2*x-y = 0, 2*x-y = 0, y-z+11 = 0, 4*x-5*y+3*z-33 = 0, 6*x-4*y+z-11 = 0, 4*x-3*y+z-11 = 0, 18*x-19*y+10*z-110 = 0, 14*x-13*y+6*z-66 = 0, 2*x-2*y+z-11 = 0, 26*x-6*y-7*z+68 = 0, 10*x-2*y-3*z+24 = 0, 2*x-z+2 = 0, 6*x+y-4*z-1 = 0, 4*x+y-3*z-3 = 0, y-z-7 = 0, 4*x+3*y-5*z-17 = 0, 18*x+10*y-19*z-52 = 0, 8*x+17*y-21*z-111 = 0, 4*x+5*y-7*z-31 = 0, 4*x-3*y+z-2 = 0, 10*x-6*y+z+4 = 0, 14*x-10*y+3*z-4 = 0, 26*x-15*y+2*z+14 = 0, 22*x-13*y+2*z+10 = 0, 18*x-26*y+17*z-84 = 0, 2*x-6*y+5*z-28 = 0, 38*x-6*y-13*z-16 = 0, 6*x-y-2*z-2 = 0, 18*x-2*y-7*z-16 = 0, 6*x+y-4*z-22 = 0, 6*x+y-4*z-22 = 0, 14*x+11*y-18*z-138 = 0, 2*x+y-2*z-14 = 0, 2*x+y-2*z-14 = 0, 22*x+2*y-13*z+40 = 0, 14*x+3*y-10*z+22 = 0, 2*x-2*y+z+8 = 0, 2*x-5*y+4*z+14 = 0, 2*x+5*y-6*z-6 = 0, 2*x-z+2 = 0, 6*x+y-4*z+8 = 0, 22*x-12*y+z-2 = 0, 8*x-9*y+5*z-10 = 0, y-z+2 = 0, y-z+11 = 0, 2*x-y-9 = 0, 8*x-3*y-z-25 = 0, 34*x-18*y+z-164 = 0, 18*x-10*y+z-92 = 0, 14*x-10*y+3*z-96 = 0, 28*x-17*y+3*z-159 = 0, 8*x-5*y+z-47 = 0, 2*x+3*y-4*z+29 = 0, 4*x-3*y+z-23 = 0, 32*x-15*y-z-103 = 0, 20*x-9*y-z-61 = 0, 10*x-6*y+z-44 = 0, 14*x-10*y+3*z-76 = 0, 2*x-2*y+z-16 = 0, 4*x-3*y+z-23 = 0, 12*x-19*y+13*z-89 = 0, 16*x-19*y+11*z-87 = 0, 20*x-3*y-7*z-73 = 0, 14*x-3*y-4*z-43 = 0, 4*x+3*y-5*z-47 = 0, 16*x-3*y-5*z-53 = 0, 22*x-2*y-9*z-92 = 0, 12*x+5*y-11*z-105 = 0, 16*x+3*y-11*z-107 = 0, 12*x+y-7*z-13 = 0, 6*x+y-4*z-7 = 0, 10*x-14*y+9*z+4 = 0, y-z-7 = 0, 2*x-z-7 = 0, 2*x+9*y-10*z-70 = 0, 18*x+y-10*z-70 = 0, 12*x+11*y-17*z-119 = 0, 2*x+y-2*z-14 = 0, 2*x-4*y+3*z+15 = 0, 4*x+y-3*z-15 = 0, 2*x-11*y+10*z+50 = 0, 14*x+3*y-10*z-50 = 0, 8*x+13*y-17*z-85 = 0, 4*x+13*y-15*z-75 = 0, 2*x+5*y-6*z-30 = 0, 12*x-7*y+z-101 = 0, 2*x-y-15 = 0, 6*x-4*y+z-56 = 0, 6*x-7*y+4*z-47 = 0, 8*x-7*y+3*z-51 = 0, 2*x-4*y+3*z-24 = 0, 6*x+y-4*z-46 = 0, 2*x+3*y-4*z-10 = 0, 2*x-z-16 = 0, y-z+2 = 0, 6*x-2*y-z-52 = 0, 10*x-2*y-3*z-84 = 0, 10*x+y-6*z-78 = 0, 2*x+y-2*z-14 = 0]

Now I want to write the equation of the planes passing two points A and B and perpendicular to all the equations of the above list. I can't to write a proc. With each plane of List, I tried
with(geom3d);
point(A, 1, 5, 3): 
point(B, -2, -4, 3):
with(geom3d): 
Equation(plane(P, L[5], [x, y, z])): 
line(d, [A, B], t):
 n1 := ParallelVector(d):
 n2 := NormalVector(P):
 with(linalg):
 n3 := crossprod(n1, n2):
 k := sort(primpart(lhs(Equation(plane(R, [A, n3], [x, y, z])))));
k*signum(lcoeff(k)) = 0

I got true answer.

Hello,

How can I rotate vertically label of vertical axis ? Can you help me ?

Thank you.

I use maple 2016 on linux with X.  When minimized, the maple icon is very small.  Also, the help icon is very small.

Are larger icons available?

The maple icon is ./bin/Maple2016.png.  I can not find the help icon.  Any ideas?

I want to solve for the roots of a polynomial, such as a x^2+b x + c = 0, for which the output is only the positive root. All coefficients/variables in the polynomial are positive. 

Recently, someone posted an answer to a question where at some point they performed this task and their solution was really slick. But I can't find it. The answer used either solve, or eval or something like that. (Yes, I did perform a search via the MaplePrimes search before asking this question.) 

I am trying to calculate the integral

where

Maple cannot calculate the integral. I tried to expand theta in the series form and substitute in the integral, still cannot calculate it.

any suggestion to tackle this problem whould be helpful.

Thank you

I have a PDE with boundary conditions, from a NASA paper.  I always seem to have problems expressing the bc.

PDE := diff(u(x, t), t) = (1/4)*exp(2)*exp(-u(x, t))*(diff(diff(u(x, t), x), x))/(x^2+2);

The initial/boundary conditions are

@t=0, u(x, t) = 2-2*ln(-x^2+2)

@x=0, diff(u(x,t),x)=0  ## this is the bc I have problem expressing

@x=1, u(x,t) = 2+ln(1+t)

The exact solution given in the paper:

2 + ln(1+t) - 2*ln(2-x^2)

I tried

ics := u(x, 0) = 2*(1-ln(2-x^2));

bcs := D[1](u(0,t))=0, u(1,t)=2+ln(1+t);

PDEtools[Solve]([PDE,ics,bcs]); ## no solution

How do I do this?

Tom Dean

fn1 and gn1 are the 2x2 matrices. For example
 

fn1:=Matrix(2,2,[seq(f[i],i=1..4)])
gn1:=Matrix(2,2,[seq(g[i],i=1..4)])


eq1:=evalm(Matrix(2,2, [1, 1, 0, 3])&*fn1+gn1)=Matrix(2,2,[0]);

eq2:=evalm(fn1+gn1)=Matrix(2,2, [0]);

how can we find fn1 and gn1 matrices?