Use the rational=False flag: >>> print filldedent(solve([eq1,eq2,eq3],[b,n,k], rational=False)) [(-3.44827586206897*log((-0.000335859591913345*p + 0.00110833665331404)/(2.24927535168052e-5*p - 0.000139455071804192)) + 2, 0.689655172413793*p*log((-0.000335859591913345*p + 0.00110833665331404)/(2.24927535168052e-5*p - 0.000139455071804192)), (0.000335859591913345*((-0.000335859591913345*p + 0.00110833665331404)/(2.24927535168052e-5*p - 0.000139455071804192))**1.13793103448276 +...

M := LinearAlgebra:-RandomMatrix(4); [-93 -32 8 44] [ ] [-76 -74 69 92] M := [ ] [-72 -4 99 -31] [ ] [ -2 27 29 67] M[2..4,1..2]; [-76 -74] [ ] [-72 -4] [ ] [ -2 27] M[2..3,..]; [-76 -74 69 92] [ ] [-72 -4 99...

[edited:] I cannot tell whaht your original definition of operator phi is, as there is a syntax error in the original post (invalid syntax). In particular I cannot tell whether you meant, phi := z -> (l*z+a)/(1-l*conjugate(a)*z): or, phi := z -> z (l*z+a)/(1-l*conjugate(a)*z): I used the former below. The...

Yes, you are getting back an equation of the form y(t)=<some series> from your dsolve call. dsol := dsolve({diff(y(t), t) = y(t)*t, y(1) = 1}, y(t), series, t = 1, order = 5); 2 2 3 5 4 / 5\ dsol := y(t) = 1 + (t - 1) +...

Your command has an extra right parenthesis at the end. That is all that the error message is refering to.

That REF you mentioned is very likely just the qualifier around parameters in a `define_external, used to link to compiled functions outside of Maple's kernel and interpreted library. It does not provide pass-by-reference in a broader sense, for Maple procedures. In Maple rtables (Matrix, Vector, Array) and tables are passed...

I found the answer: assume(m::integer, m > 0); assume(k::integer, k >= 0); additionally(k <= m); assume(N::integer, N > 0); assume(r::integer, r > 0); additionally(r >= m); additionally(r <= N-m); ...

The answer you requested from solve depends on the number of terms in the summation. You haven't specified that. If you don't know that, you can specify it by symbols. Change the second arguments of both sums from simply j to j= a..b. I did this, and then I got...

The third paragraph in the Description section of the help-page for the series command mentions that the order parameter specifies the truncation order for the calculation and is not necessarily the order of the returned series. Also, there is a remember table in play, so that a higher order returned...

restart: M := Matrix([[1,1],[1,0]]): str:=time[real](): LinearAlgebra:-Modular:-MatrixPower(73, M, 10^12); [46 46] [ ] [46 0] time[real]()-str; 0.040 ...

I found the answer. In case someone needs it : > X := piecewise(`and`(t <= .2, t >= 0), -t, t <= .4, 8*t-1.8, t <= .6, 3*t+.2, t <= .8, 10*t-4, t <= 1, -20*t+20); Y := piecewise(`and`(t <= .2, t >= 0), 2*t, t <= .4, 2*t, t...

I'm guessing that you intend for n to be a positive integer. If not then please give additional details. Also, why do you mention both N and n? If you mean fully the same thing by both then it's not helpful to use both in your description. One way to...

Automatic simplification is turning your, GenerateFloat()^2+GenerateFloat()^2 into, 2*GenerateFloat()^2 before GenerateFloat() is evaluated. One simple change to get it to work as you expected would be separate them. Eg, restart: with(RandomTools[MersenneTwister]): tries := 10^4: s := 0: for i to tries do t1,t2 := GenerateFloat(),GenerateFloat(); if t1^2+t2^2 < 1 then s...

You appear to be attempting to map the various operations over a list, as evidenced by your use of [x,y,1] in the numerator of the expression in the body of omega. But *, /, and limit will not automatically map over a list. You can map the * and /...

The documentation doesn't make it very clear that one must use, `quit`(n) with name-quotes. interface(prettyprint=0): handler:=proc(e::uneval) local failed; printf("entered\n"); # remove this when satisfied failed:=false; try if evalb(eval(e)) <> true then error; end if;; catch: failed:=true; printf("Error, assertion failed\n"); finally; if failed then `quit`(5); end if; end try; true; end...

plot,integration,numerical,maple

I don't know what you mean by "avoid the singularity". Your function is singular at t=0, and there's no way to change that. Just don't try to evaluate it at 0. Your other problem is caused by trying to differentiate with respect to a number. What you need to do...

You need parens around t-b. You are computing abs(t - (b / t)), which gives you t give or take a small fraction (assuming b and t are nearly equal). What you want is abs((t - b) / t), which will give you their difference as a fraction of t....

This is called the The Discrete Logarithm Problem. It is a difficult problem---computationally intensive. See the Wikipedia page. It has discussion of eight algorithms for the problem. The Maple command is numtheory:-mlog. numtheory:-mlog(82, 10, 543); Maple responds 12 To obtain all such integers j, use the extended form of the...

regex,matlab,pattern-matching,octave,maple

To find the shortest pattern that upon repetition generates the whole string, you can use regular expressions as follows: result = regexp(str, '^(.+?)(?=\1*$)', 'match'); Some examples: >> str = '12341234123412341234'; >> result = regexp(str, '^(.+?)(?=\1*$)', 'match') result = '1234' >> str = '1234123412341234123'; >> result = regexp(str, '^(.+?)(?=\1*$)', 'match') result...

If I've interpretted your examples correctly, then this is the procedure inv_2: inv_2:= proc(n::nonnegint) local N:= convert(n, base, 2), L:= nops(N), i, j, ct:= 0; for i from L by -1 to 1 do if N[i] = 1 then for j from i-1 by -1 to 1 do if N[j]...

That exported zip file from Maple is a Course Module in Maple T.A. The error you report usually occurs when you try importing a Course Module as a Question Bank in Maple T.A. To fix this, go to the Question Repository in Maple T.A. and click on Course Modules >...