All of his should work very readily
 

Download DISGUSTING.mw

Hey,

Is anyone of you capable of simplifying this expression

f1:=(-3*sin(8*x) + 3*sin(8*x + 2*y) - 3*sin(8*x + 6*y) + 3*sin(8*y + 8*x) + 3*sin(8*y + 6*x) + 3*sin(8*y) - 18*sin(8*y + 4*x) + 3*sin(8*y + 2*x) - 45*sin(6*y + 6*x) + 87*sin(4*y + 6*x) - 3*sin(6*x - 2*y) - 87*sin(6*x + 2*y) + 18*sin(4*x - 4*y) - 93*sin(4*x + 4*y) + 93*sin(4*x + 6*y) - 51*sin(2*x - 4*y) - 342*sin(2*x + 4*y) - 3*sin(-6*y + 2*x) + 51*sin(6*y + 2*x) - 93*sin(-2*y + 4*x) + 342*sin(-2*y + 2*x) + 639*sin(2*x + 2*y) - 639*sin(2*x) + 45*sin(6*x) + 93*sin(4*x) + 231*sin(4*y) - 225*sin(2*y) - 63*sin(6*y) - 57*sqrt(3)*cos(2*x) - 375*sqrt(3)*cos(2*y) + sqrt(3)*cos(8*y + 8*x) - 5*sqrt(3)*cos(8*x + 6*y) - 7*sqrt(3)*cos(8*y + 6*x) + sqrt(3)*cos(8*x) + 192*sqrt(3)*cos(2*y + 4*x) + 43*sqrt(3)*cos(-2*y + 4*x) - 7*sqrt(3)*cos(6*x + 2*y) + 7*sqrt(3)*cos(-6*y + 2*x) - 5*sqrt(3)*cos(6*y) - 149*sqrt(3)*cos(4*x + 4*y) - 149*sqrt(3)*cos(4*x) - 65*sqrt(3)*cos(6*y + 2*x) + 126*sqrt(3)*cos(2*x + 4*y) - 65*sqrt(3)*cos(2*x - 4*y) - 5*sqrt(3)*cos(8*x + 2*y) - sqrt(3)*cos(8*y) + 7*sqrt(3)*cos(8*y + 2*x) + 6*sqrt(3)*cos(8*x + 4*y) - 57*sqrt(3)*cos(2*x + 2*y) + 125*sqrt(3)*cos(4*y) + 126*sqrt(3)*cos(-2*y + 2*x) - 7*sqrt(3)*cos(6*x - 2*y) + 19*sqrt(3)*cos(6*x) + 43*sqrt(3)*cos(4*x + 6*y) + 19*sqrt(3)*cos(6*y + 6*x) - 7*sqrt(3)*cos(4*y + 6*x) + 246*sqrt(3))/(2*(-261*sin(4*x + y) - 297*sin(2*x + 3*y) - 48*sin(5*y + 6*x) + 126*sin(5*y + 2*x) + 9*sin(5*y + 8*x) + 12*sin(7*y + 6*x) - 9*sin(7*y + 4*x) - 36*sin(5*y + 4*x) + 261*sin(3*y + 4*x) + 9*sin(-3*y + 4*x) + 297*sin(-y + 2*x) - 135*sin(3*y) - 21*sin(5*y) - 147*cos(y)*sqrt(3) - 9*sqrt(3)*cos(7*y + 4*x) - 3*sqrt(3)*cos(5*y + 8*x) - 3*sqrt(3)*cos(3*y + 8*x) + 54*sqrt(3)*cos(6*x + 3*y) + 5*sqrt(3)*cos(-5*y + 2*x) + 5*sqrt(3)*cos(7*y + 2*x) - 2*sqrt(3)*cos(6*x - y) - 20*sqrt(3)*cos(6*x + y) - 69*sqrt(3)*cos(4*x + y) + 68*sqrt(3)*cos(4*x - y) + 2*sqrt(3)*cos(8*x + y) + 2*sqrt(3)*cos(7*y + 8*x) - 20*sqrt(3)*cos(5*y + 6*x) - 2*sqrt(3)*cos(7*y + 6*x) + 68*sqrt(3)*cos(5*y + 4*x) - 9*sqrt(3)*cos(-3*y + 4*x) - 69*sqrt(3)*cos(3*y + 4*x) - 171*sqrt(3)*cos(2*x + 3*y) - 35*sqrt(3)*cos(5*y) + 171*sqrt(3)*cos(3*y) - 171*sqrt(3)*cos(-y + 2*x) + 354*sqrt(3)*cos(2*x + y) + sqrt(3)*cos(7*y) + 639*sin(y) - 9*sin(3*y + 8*x) - 12*sin(6*x - y) + 3*sin(7*y) - 9*sin(7*y + 2*x) + 9*sin(-5*y + 2*x) + 48*sin(6*x + y) + 36*sin(4*x - y) - 126*sin(2*x - 3*y)))

into

cos(y-Pi/3).

PS: Actually I managed by expanding the thing out and converting to exp then expanding again and using radnormal. In essence I leave the question, because maybe somebody can explain to me why radnormal seems to be superior (sometimes) to simplify which I thought of as the USEALL choice. Thanks

Download q1stringtool.mw

Does Maplesoft provide success percentage of this toolbox on benchmark functions?. I cannot see much options in the global solve command (from maple help page) other than population size etc. 

I recieved the following error:

Error, (in ifactor/QuadraticSieve:-SieveCube) sieving failure

But when I review the procedure ifactor, it doesnt tell me anything about A Quadratic Sieve algorithm, and it's really long and looks dodgey and suspicious, like line 24 for example, why is it computing the greatest integer divisor of a local variable and a random enormous square free number? and then another with an additional factor a few lines later? 

Hello

I need to solve or reduce (similar to the command Reduce in Mathematica) sets of nonlinear equations.  One such example is shown below:

eqns := {-1+theta[3, 6] = 0, 1-theta[3, 6] = 0, alpha+rho-theta[2, 2]+theta[3, 3] = 0, -theta[3, 6]^2+1 = 0, theta[2, 2]*theta[3, 6]-alpha = 0, theta[2, 2]*theta[3, 6]^2-alpha = 0, -2*theta[3, 3]*theta[3, 6]-2*rho = 0, theta[1, 2]*theta[2, 1]*theta[3, 6]^2+1 = 0, -alpha^2+rho^2+theta[2, 2]^2-theta[3, 3]^2 = 0, -theta[2, 2]^2*theta[3, 6]+2*theta[2, 2]*theta[3, 3]*theta[3, 6]+alpha^2+2*alpha*rho = 0, -theta[1, 3]*theta[2, 2]^2*theta[3, 0]+theta[1, 3]*theta[2, 2]*theta[3, 0]*theta[3, 3]-alpha^2*beta-alpha*beta*rho = 0, -theta[1, 2]*theta[2, 1]*theta[2, 2]*theta[3, 6]+2*theta[1, 2]*theta[2, 1]*theta[3, 3]*theta[3, 6]-alpha-2*rho = 0, -theta[1, 2]*theta[2, 1]*theta[2, 2]*theta[3, 3]+theta[1, 2]*theta[2, 1]*theta[3, 3]^2+theta[1, 3]*theta[2, 2]*theta[3, 0]*theta[3, 6]+alpha*beta+alpha*rho+rho^2 = 0, -alpha^2*rho-alpha*rho^2+theta[1, 2]*theta[2, 1]*theta[2, 2]-theta[1, 2]*theta[2, 1]*theta[3, 3]+theta[1, 3]*theta[3, 0]*theta[3, 6]-theta[2, 2]^2*theta[3, 3]+theta[2, 2]*theta[3, 3]^2+alpha+beta+rho = 0}

 and the indeterminates are:

fc := {theta[1, 2], theta[1, 3], theta[2, 1], theta[2, 2], theta[3, 0], theta[3, 3], theta[3, 6]}

Since I do know the solution, I issued the following command to check for typos.

seq(subs(theta[1,2]=-1,theta[1,3]=-1,theta[2,1]=1,theta[2,2]=alpha,theta[3,0]=beta,theta[3,3]=-rho,theta[3,6]=1,eqns[i]),i=1..nops(eqns))

and the outcome is zero for all equations.

When I try the command solve as follows:

solve(eqns,fc);

the result is

{theta[1, 2] = theta[1, 2], theta[1, 3] = theta[1, 3], theta[2, 1] = -1/theta[1, 2], theta[2, 2] = alpha, theta[3, 0] = -beta/theta[1, 3], theta[3, 3] = -rho, theta[3, 6] = 1}

that should be right but it is not what I am expecting.  

How can maple return the solution needed?

Some sets of solutions do not have a solution as the one above.  Some indeterminates cannot be found, is there a way maple returns the solution of the ones that can be solved and reduced the set of equations into two parts, solved ones e non solved ones?  I can provide an example if needed.

Many thanks.

Ed

Non-Linear overdetermined equations - which is best method? with less number of iterations

When I use Jacobi it takes 25 iterations.

Any other method which takes less iterations?

I would like to know whether a local optimizer is combined with the present global optimization toolbox?. I read that toolbox has differential evolution and surrogate optimization techniques etc. These methods guarantee near-optimal solutions and it is often recommended to use a local optimization technique in conjunction with global optimization techniques. 

I search saveplot and sleep function here

i had kept close filename function and move plot setup default to first line

but thread no sleep in maple 12

then I remove sleep and can save image file

but after I call it in a function and run a for loop for this function

the file is not updated after sleep 3 seconds 

how to run a for loop call it and it can refresh 

Is anyone accessing the https://www.mapleprimes.com/questions redirected to this page https://www.mapleprimes.com/errors/500.aspx?aspxerrorpath=/questions/default.aspx ?

https://www.mapleprimes.com/errors/500.aspx?aspxerrorpath=/questions/default.aspx

I tried to control z-axes by writing

plot3d(sech((1/2)*sqrt(3/5)*(x-2*t)), x = -10 .. 10, t = -10 .. 10, scaling = constrained, style = patchnogrid)

but I could not change the height of z axes. I want to change the dimensions like in the following figure.

example-graph.pdfexample-graph.pdf

Although the range of z-axix is small but it appears very clear. Can anyone help me, please.

The following message is displayed at the beginning of my worksheet when i reopen it, no data is lost because the nature of my code retrives it's optimal boundaries for the loops but i dont know what the hell this is telling me this for:

"Warning, .hdb help databases are deprecated, 'C:\Users\the_r\maple\toolbox\Syrup\lib\Syrup.hdb' will not be used, see ?HelpTools,Migrate help page for more information"

It appears in blue standard size courier font if that is help thank you

Is it asking me to migrate? My passport was stolen by clandestine pharmacists 
 

 Dear fellows
I have the problme with first seq command.
for i while i <= M1-2 do for j while j <= M1-2 do for k while k <= M1 do Eq[i, jk] := simplify(eval(R, [x = i/(M1-2.), y = j/(M1-2.), t = k/(M1-1.)])) = 0 end do end do end do:

Sol := fsolve({seq(BC1[m8, m9]$m8 = 1 .. M1, m9 = 1 .. M1), seq(BC2[m10, m11]$m10 = 1 .. M1, m11 = 1 .. M1), seq(BC3[m12, m13]$m12 = 1 .. M1, m13 = 1 .. M1), seq(BC4[m14, m15]$m14 = 1 .. M1, m15 = 1 .. M1), seq(IC1[m4, m5]$m4 = 0 .. M1, m5 = 1 .. M1), seq(IC2[m6, m7]$m6 = 0 .. M1, m7 = 1 .. M1), seq(Eq[m1, m2, m3]$m1 = 1 .. M1-2, m2 = 1 .. M1-2, m3 = 1 .. M1-1)});

Got the following error.

Error, invalid input: seq expects its 3rd argument, step, to be of type numeric, but received m3 = 1 .. 1

Please help me in this regard.

Error, (in Optimization:-NLPSolve) the objective gradients at the initial point are too small

So this error indicates that the initial point is a local minimum or very very close to it right?

I'm very new to Maple (and coding in general). I'd like to know a very large coefficient of a certain 𝑞-series involving the Dedekind 𝜂-function. For example

s:=series(subs(q=q^6, eta^4), q, N);

where eta := series(q^(1/24)*product(1 - q^n, n = 1 .. 100), q, N). I know the command coeftayl(s, q=0, N) but for certain 𝑞-series it doesn't recognize the numerical value of this coefficient when 𝑁 is too large (even after subtracting the principal part of 𝑠, if there is any) - instead it realizes the coefficient as a HUGE limit of something. Cheers.