Items tagged with maple


If I pass "a := x + y;"

as a string

can it turn to command?

if so, can it export this feature into c# or python?

Hello guys,

I´ve a little bit problem by plotting an pyramid with an triangle in it. When I want to display both

parts, in the drawing the left and the right part and the top of the pyramid is missing. What is the problem ???


I've implemented the optimal taxation model proposed in this paper using Maple.

But it never stops running and get stuck in the last line for integral computation. Any idea of what's wrong with that?

This is the last line:

Here is the full code.

plot(A[1](t),,labels=["Time t","n times derivative of X[1](t)"]);

I have a code like above. I run it. Then,

in the labels; it was written "n times derivative of X[1](t)"] why not "2 times derivative of X[1](t)"]) ? and why was not the subscript appeared ? I mean that I want to see X1 instead of  X[1]?

Help me please.

Thank you.


When Maple 2017?. Are there anybody about the new features of this version?. I,m waiting for a special project.

In maple we have type/symmfunc check for a symmetric function. I want to write cycfunc function.

Example: cycfunc(a^2*b + b^2*c + c^2a, [a,b,c]) return true.

Thanks you very much.

This is simplified from a larger example.  I never saw Maple exit from a numercal calculation.

> 123456789 ^ 987654321:
Execution stopped: Stack limit reached.

Process Maple R2016 exited abnormally with code 158

> kernelopts(maxdigits);

> lprint(123456789. ^ 987654321.);

kernelopts(memusage) shows about 2~3 meg bytes used.

The system has 16G Ram.  16G swap.

Seems like something maple should have caught.

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

We have just released an update to Maple.  It includes updates to the Maple Workbook, the video component, the Physics package, and many other small improvements throughout the product. It is available through Tools>Check for Updates in Maple, and is also available from our website on the Maple 2016.2 download page.


Hi all, i wan to write getCoeff() function get coefficient general.


f := a^2*b^2*c^2 + 2*a^2*b^2 + 2*a^2*c^2 + 2*b^2*c^2 + a^2 - 6*a*b - 6*a*c + b^2 - 6*b*c + c^2 + 8

getCoeff(f,a^2*b^2*c^2) return 1.

getCoeff(f,a^2*b^2) return 2.

getCoeff(f,a*b) return -6.

getCoeff(f,a^2) return 1, ...

and how to get coefficients freedom ?

Thank you very much.

I'm trying to generate 100 equation to solve them numerically , buy maple won't let me , here's the code :

for i by 0 to 99 do
a := a[i]+a[i+1] = i^2
end do ;

Let L = {a1, a2, ..., an} (or L = [a1, a2, ..., an]) with is homogeneous polynomial. How to create function createDegree() return elements of degree <= n from L.

Expamle. L = {a-2b, b^2, (a+c)^2}.

createDegree(L,1) return {a - 2b}.

createDegree(L,2) return {b^2, (a - 2b)^2, (a+c)^2, a - 2b}.

createDegree(L,3) return {b^2, (a - 2b)^2, (a - 2b)^3, (a+c)^2, (a - 2b)b^2, (a - 2b)(a+c)^2, a - 2b}.

Thanks you very much.



Is this a bug?

hypergeom([1, -1, 1/2], [-12,-3], 1);
Error, (in hypergeom/check_parameters) function doesn't exist: missing appropriate negative integers in the first list of parameters to compensate the negatives integer(s): [-3], found in the second list.

Yet this hypergeometric series terminates and Maple should be able to handle it, at least according to the Maple help page (the second rule below applies, yet the numerator has a smaller absolute value, so the first rule below applies).

If some   n[i] is a non-positive integer, the series is finite (that is,   F(n, d, z)  is a polynomial in    z).
If some  d[j]  is a non-positive integer, the function is undefined for all non-zero  z, unless there is also a negative upper parameter of smaller absolute value, in which case the previous rule applies.


Interestingly, the Wolfram Mathematica app can evaluate this to 311/312.



Hi all, I have a problem someone can help me

F := {a^2, b^2, c^2, ab, bc, ca}

G := [a^2, b^2, c^2, ab, bc, ca]

How to convert F to G and G to F ?

Thanks you very much.

Ian Thompson has written a new book, Understanding Maple.

I've been browsing through the book and am quite pleased with what I've read so far. As a small format paperback of just over 200 pages it packs in a considerable amount of useful information aimed at the new Maple user. It says, "At the time of writing the current version is Maple 2016."

The general scope and approach of the book is explained in its introduction, which can currently be previewed from the book's page on (Click on the image of the book's cover, to "Look inside", and then select "First Pages" in the "Book sections" tab in the left-panel.)

While not intended as a substitute for the Maple manuals (which, together, are naturally larger and more comprehensive) the book describes some of the big landscape of Maple, which I expect to help the new user. But it also explains how Maple is working at a lower level. Here are two phrases that stuck out: "This book takes a command driven, or programmatic, approach to Maple, with the focus on the language rather than the interface", followed closely by, "...the simple building blocks that make up the Maple language can be assembled to solve complex problems in an efficient way."




1 2 3 4 5 6 7 Last Page 1 of 269