>M1:=146996733613391:

>M2:=1348471408813:

>teks:=numtheory[cfrac](M1/M2,'quotients');

tekssifer:=[109,101,115,115,97,103,101]

Hi, how should i rewrite my command to decrease the execution time?

Thank you~=]]

 For solving polynomial systems I used RootFinding[Isolate]. But after discussing the question http://www.mapleprimes.com/questions/211774-Roots-Of--Expz--1
I decided to compare Isolate and evalf(solve ([...], [...])). It seemed to me that solve some convenient. The only if in the equation there are integers as a real, they should be recorded with a decimal point. (For real solutions of this procedure should be used with (RealDomain).)  Examples:

SOLVE_ISOLATE.mw

I wonder why then the need Root Finding [Isolate]?

Hello evrey one , I need help for solve these equation with boundary conditions 

 Boundary Conditions

My COde + equation 

Download mp.mw

Thank you 

Download Analysis_and_Design_of_Machine_Foundations_1.mw

Good Morning Mapleprime Community,

Would anybody please help in the attached worksheet. I'm trying to use the new function in Maple that is the clicable method, but I was having problem in some of my output such as zeta_y and zeta_phi as this two equations are generating an error message.

Regards,

Moses

Like there is key shortcut ctrl+T for text mode in Maple, is there any key shortcut for math mode ???

Regards

H, how i need to write my command to get n times of the sentences i insert.

For example, 

>teksbiasa:= `Hello Bob`;

Hello Bob

So, if i want 5 times of `Hello Bob` like 

Hello Bob Hello Bob Hello Bob Hello Bob Hello Bob 

What should i write?

Thank you ~=]]

I would like to add threads to this code that compiles cleanly:

RECTmatrixSEQ :=  (FD,m, n, xw, yw, tr, k, rho, dmax) ->
 
   [seq
     (seq
        # A return of 0 means there is no choice - no digit possible
        # result of a 4 means there is a choice of (-1 or 0)
        (add(RECTpred(m, n, i, j, iter1, k, rho)*(2*abs(iter1)+1), iter1 = -dmax .. dmax)
        + (2*dmax+1)*(RECTpredR(m, n, i, j, dmax, k, rho)+
        RECTpredL(m, n, i, j, -dmax, k, rho))+
        .5*RECTpredOR(m, n, i, j, dmax, k, rho)+
        .5*RECTpredOL(m, n, i, j, -dmax, k, rho),
      i = -ceil(2*dmax+2*rho)*2^m .. ceil(2*dmax+2*rho)*2^m-1),
    j = 0 .. 2^(n-yw)-1)]:

I've added thead calls like this, still no syntax errors:

RECTmatrixSEQ :=  (FD,m, n, xw, yw, tr, k, rho, dmax) ->

   CodeTools:-Usage( Threads:-Wait(
   [seq (Threads:-Create
     (seq
        # A return of 0 means there is no choice - no digit possible
        # result of a 4 means there is a choice of (-1 or 0)
        (add(RECTpred(m, n, i, j, iter1, k, rho)*(2*abs(iter1)+1), iter1 = -dmax .. dmax)
        + (2*dmax+1)*(RECTpredR(m, n, i, j, dmax, k, rho) +
        RECTpredL(m, n, i, j, -dmax, k, rho))+
        .5*RECTpredOR(m, n, i, j, dmax, k, rho)+
        .5*RECTpredOL(m, n, i, j, -dmax, k, rho),
      i = -ceil(2*dmax+2*rho)*2^m .. ceil(2*dmax+2*rho)*2^m-1),
    j = 0 .. 2^(n-yw)-1)) ] )
    ):

I do get a runtime error:

                 "PROC:feasibilitycheckproONCE

                   "
Error, (in CodeTools:-Usage) invalid input: too many and/or wrong type of arguments passed to Threads:-Create; first unused argument is j = 0 .. 3

Any help spotting this problem would be appreciated. Thanks in advance.

Bonnie

Hi, here is the code I used to try to generate all invertible 4x4 matrices over the finite field F_2 = {0.1}. However, when I look at the elements of GROUP (see below) all the elements are 4x4 matrices with a 2 in each entry. I don't know why this is?

Also, I need help converting all of the invertible 4x4 matrices in the following way: I want the 4x4 matrices to each be written as a string of length 16 with no spaces, commas or brackets. So for example the matrix

a b c d

e f g h

i j k l

m n o p

becomes abcdefghijklmnop

restart:
with(LinearAlgebra):
PRIME := 2;
2

# the group of invertible 4 x 4 matrices over the field F_p

GROUP := []:
M := Matrix([[a,b,c,d],[x,f,g,h],[y,j,k,l],[m,n,o,p]]):
for a from 0 to PRIME-1 do
for b from 0 to PRIME-1 do
for c from 0 to PRIME-1 do
for d from 0 to PRIME-1 do
for x from 0 to PRIME-1 do
for f from 0 to PRIME-1 do
for g from 0 to PRIME-1 do
for h from 0 to PRIME-1 do
for y from 0 to PRIME-1 do
for j from 0 to PRIME-1 do
for k from 0 to PRIME-1 do
for l from 0 to PRIME-1 do
for m from 0 to PRIME-1 do
for n from 0 to PRIME-1 do
for o from 0 to PRIME-1 do
for p from 0 to PRIME-1 do
if Determinant(M) mod PRIME <> 0 then
GROUP := [ op(GROUP), M ]
fi
od od od od od od od od od od od od od od od od:

nops(GROUP);
20160

GROUP;

Is it possible to subscript within a plot?

for example I have

this in principle is what I want but, the N is cursive while is O is not (and it's a bit shifted to the right, not right next to the [2] !???

Also I didnt find the meanings of mi(),mn(),mo(),mfenced()... in the help documentation which I stumbled across while googling.

for example in this case:

what do I need them for since without the mi it doesnt work?!

Is it possible to use latex notation within the plot options for more convenience?

BTW: When plotting a .ps or .eps the plotting device takes over all the features (like the examples above) but when using png instead it just prints the code behind it ( for example the `#mover(mi("x"),mi("~"))` ) and not would it should lead to

How long will MAPLE 16 and future versions of MAPLE will support running on Windows 7? 

MRB

(I hope to defer transferring to Windows 10 until MS stop supporting for Windows 7.)

Hello,

I am unable to use subs() command when using subscript : I'd like to replace YP__1 with dGx in the equation :

"Eq:= YP__1 = Y__2" (Eq:= YP₁=Y₂)

 so I have tried : subs({YP__1=dGx},Eq)

But it doesn't work... It give me : YP__1 = Y__2 and I would like to have dGx = Y__2

I have tried also with subs({YP[1]=dGx},Eq) but doesn't work too.

If I am not using subscript, for exemple : Eq:= YP1 = Y2

And do : subs({YP1=dGx},Eq)

That works great...

But I must use subscript __ because Eq is a result from ODEtools (convertsys).

Can you help me please ?

Thanks you very much.

Regards.

Consider the list [x,y,z], say. Does there in Maple exist some fundamental function for querying the position in the list of x,y, and z, respectively? I am unable to locate any such. Such a function can, of course, be constructed, an example being the following:

listPos := (l::list) -> table(zip(`=`,l,[$(1..nops(l))])):
pos := listPos([x,y,z]);
pos[x],
pos[y],
pos[z];

But that seems unsatisfactory. The same question concerning Vectors: Consider Vector([x,y,z]), say. Here, the following code, say, will perform the task:

VectorPos := (V::Vector) -> table([map(rhs = lhs,op(2,V))[]]):
pos := VectorPos(Vector([x,y,z]));
pos[x],
pos[y],
pos[z];

PS: Of course, list and Vectors can be converted into one another, so any one of the codes above can in practice be used to perform both tasks.

The following code is part of my attempt to answer the recent Question about the bifurcation of the map f:= x-> exp(x^2*(a-x)). Two very weird things are happening. They can be seen by applying trace to f. The first is that the input argument to f seems to be changed to a very large integer. The second is that for some real values of a and x, I get imaginary results from this obviously real-valued function. Why are these things happening?

Download bifurcation.mw

How to show what class of bifurcation is in this function :   exp(x²*(a-x)) ?

I have a long list of two element lists, for example,

A := [ [2,3], [4,5] ,[6,7]];

I want apply '/' to the elements of each sublist.

The result will be

R := [2/3, 4/5, 6/7];

I do not need the list, I could use vectors or matrices.

Is it possible to do this other than by iteration?

Tom Dean