Maple Questions and Posts

These are Posts and Questions associated with the product, Maple

Just wonder if there are any known issues when using dots in Maple code attachment names?

Only issue so far that I can see is that error messages are split a bit strange.

How can i plot stream lines by using velocity components (tx+1, -ty-t^2)? or by stream function?

how can i sort [x,x/3] to [x/3,x]

sort([x, x/3]) ?

I looking to create a GUI may be from outside say script language or any given language may be 

The main intention is I have my

maple code

And 

A python code

In the same folder say

I create a GUI with two buttons

When I click one button it runs my maple file in that folder and generates the output

Second button runs the python file that folder generates the output

Is such a coding  creatable 

One more import is can we call a maple code to run from python like how we call exe files

And 

Can we call python compiler attached and file from maple and run it 

I need help to solve this ODE,

I didn't get series values F(k+3),Theta(k+2),phi(k+2),error comes in summation values.and

How to find the unknown parameters A,B,C.

 TLF.mw

Please why does 

roots(x^5 - C__1*x^4 -C__2*x^3 -C__3*x^2 -C__4*x +C__5, x);

returns  [ ]?

How can I animate the revolution surface around the red line?

RevolSurfaceQ.mw

Hi every one

Let F=[f1,...,f10] be a  list of homogeneous polynomials with different degrees. I want to create a list of lists s.t. any list satisfies the following conditions:

1. all elements of a list have the same degree.

2. the lists contained in the main list sort increasingly.

For example if F=[x-y, y+z, x^3-xyz+z^3, y^3-xz^2, y^6-x^4y^2, x^5y-z^6+x^2y^2z^2] then 

L=[[x-y, y+z],[x^3-xyz+z^3, y^3-xz^2],[y^6-x^4y^2, x^5y-z^6+x^2y^2z^2]] is the output.

Thanks for your answers.

It would be nice to have a point probe for images ie.pixel location. 

Maple code for solving system of ODE using forward-backward sweep method.

While working a test workbook in Maple 2023 - added a file went away for a while and came back and started adding code to the workbook when I suppose it did an autosave and this error came up 4x in a row. 

Dears,
How can I work with a LogNormal distribution represented by a mean and standard deviation?
I see that is with exp(Normal(mu,sigma)), but I dont sure. Would you please help me with a example using LN(mean=20,standard deviation=5)?
I will use in PDF, CDF and RandomVariable. 

For a table

T := table(sparse = {}, [1 = {a}, 2 = {b}])

T[3] returns {}. 

Is there an equivalent for an rtable?

restart

T := table(sparse = {}, [1 = {a}, 2 = {b}])

table( [( 1 ) = {a}, ( 2 ) = {b} ] )

T[1]; T[2]

{a}

{b}

Get the default value here

T[3]

{}

But (as documented), the sparseness of the table is not inherited - all elements are filled

Vector[row](6, T, storage = sparse); op(%)

Vector[row](%id = 36893490697130506636)

6, {1 = {a}, 2 = {b}, 3 = {}, 4 = {}, 5 = {}, 6 = {}}, datatype = anything, storage = sparse, order = Fortran_order, shape = []

fill = {} should fill in all unspecified values. but this is incompatible with storage = sparse (as documented).

Vector[row](6, {1 = T[1], 2 = T[2]}, storage = sparse, fill = {}); op(%)

Vector[row](%id = 36893490697130478916)

6, {1 = {a}, 2 = {b}}, datatype = anything, storage = sparse, order = Fortran_order, shape = []

And the default fill is still zero for datatype=set; I expected {} here.

Vector[row](6, {1 = T[1], 2 = T[2]}, storage = sparse, datatype = set); op(%)

Vector[row](%id = 36893490697130474412)

6, {1 = {a}, 2 = {b}}, datatype = set, storage = sparse, order = Fortran_order, attributes = [_fill = 0], shape = []

NULL

Download Sparse.mw

Hi, 

I am stuck on how to graphically represent my two G and S shapes. Any suggestions to help me illustrate this concept of a ruled surface?

Thank you

SurfaceMP.mw

I expect that there must exist a Maple proc that does the equivalent of the following but I couldn't find it.  Can it be in the combinat package?

And if there isn't one, can the following be improved?  It seems to be horribly inefficient to me, although efficiency is not a major concern for me right now since I need it only for small values of n.

restart;

Proc produces all lists of length n consisting of the

two distinct symbols a and b.

doit := proc(a, b, n::posint)
        local p := 1, L := [ [a], [b] ];
        for p from 1 to n-1 do
                 L := [ map( x -> [a,op(x)], L)[], map( x -> [b,op(x)], L)[] ];
        end do:
        return L;
end proc:

doit(a,b,1);

[[a], [b]]

doit(p,q,3);

[[p, p, p], [p, p, q], [p, q, p], [p, q, q], [q, p, p], [q, p, q], [q, q, p], [q, q, q]]

doit(5,7,3);

[[5, 5, 5], [5, 5, 7], [5, 7, 5], [5, 7, 7], [7, 5, 5], [7, 5, 7], [7, 7, 5], [7, 7, 7]]
 

Download mw.mw

First 96 97 98 99 100 101 102 Last Page 98 of 2097