I am having a problem in evaluating a fluid flow problem at a boundary that includes infinity using a semi-analytic method Adomian Decomposition Method.

Find the attached code. Thanks in advance.

I recently upgraded to Maple 2022 just to use the new latex command. It seems I still can't export DataFrame types, I'm very disappointed. What am I doing wrong?

restart:
test:= DataFrame( [[1]], columns = [1] );
latex(test);

returns:

Error, (in DataFrame:-type) invalid input: subtype expects its 2nd argument, _t, to be of type type, but received And(symbol,satisfies(u -> substring(u,1 .. 9) = ('`\\mapleref`')))

Using File > Export As > LaTeX also doesn't work.
Printing the function call using printlevel := 100000: returns the following:

I've attached the worksheet for reference. Demo.mw
Does anyone know a workaround?

-Thanks for the Help

dear all

I try to create a table with four columns but someting wrong, the code contains few lines, 

table_columns.mw

Thank you for your help 

dear all

I have a system of 4 equations with 4 unkowns, but maple says that there 7 unknowns, and fsolve does return any solution

problem_solve_system.mw

Thanks

Hi! I'm new to Maplesoft. I would like to use it for my research. However, in order to do so, i have to construct an n-dimensional vector space, with vectors of the form A_1*B, A_2*B, ..., A_k*B, where A_i is a set of  n components from a Field (or ring) and B is the basis for the vector space.

It would REALLY help if you could give some ideas for me to bring this up, or else i will be forced to typset every one of the vectors i'll use in a matrix-multiplication form and will make considerably harder my work.

Just wondering how I do a loop over the contents of the table. I need both the index variable and the stored value associated with it.

This one apparently doesn't work.

Download table_and_loop_1.mw

How do I simplify :

Zin := Rin + omega*L*I + (omega*L)^2/(RL + omega*L*I);
 

so that there are no imaginary terms in the denominator?  

I've tried, 

assum := Rin::real, omega::real, L::real, RL::real, 0 < Rin, 0 < omega, 0 < RL, 0 < L
Zin := Rin + omega*L*I + (omega*L)^2/(RL + omega*L*I);
 
(simplify(Zin) assuming assum);

but this doesn't work.

Dear all

I tried to solve a second order ODE, using dsolve but maple doest not return an explicit solution and no solution plotted. 

solve_ode.mw

thank you for your help 

Hey everyone,

I am trying to solve this differential equation for h(u):

h(u)^2 + 2*a*h(u)/sqrt(1 + diff(h(u), u)^2) = b^2

for given values of a and b. For a=3 and b=1 maple gives :
u - Intat((_a + 1)*(_a - 1)/sqrt(-(_a^2 + 6*_a - 1)*(_a^2 - 6*_a - 1)), _a = h(u)) - _C1 = 0, u - Intat(-(_a + 1)*(_a - 1)/sqrt(-(_a^2 + 6*_a - 1)*(_a^2 - 6*_a - 1)), _a = h(u)) - _C1 = 0

and I dont know what to do from there. Any help would be very much appreciated

Suppose you know that a person's public key modulus m is the following 200 digit number :
 
"166571820085905498772938593207359906487315774156514145089564134\

  67009247675308229223573508773729914408724747749233779284765414\

  62530835296763930087228227919982503096221081674037688617693027\

  1167988018683"

Factor m and check your factorization after the factors are found.  Use the following Fermat factorization method:  Note that if  
                        "m = x^2 - y^2"

 then 
                     "m = (x - y)*(x + y)"

. So if 
                          "1 < x - y"

 we have a non-trivial factorization of m. If m is a product of just two primes then one will be 
                            "x - y"

 and the other will be x + y.  This is the basis of the Fermat factorization method. Note that  
                        "m = x^2 - y^2"

 is equivalent to 
                        "x^2 - m = y^2"

.  So if for some number x we have type(sqrt(x^2 - m),integer) = true then we can set y = sqrt(x^2 - m) and using the above idea we may factor m.  Fermat's method is to take x = 
                        "ceil(sqrt(m))"

 and keep incrementing x by 1 till an x is found such that 
                           "x^2 - m"

 is a square.   [Note that you may need to use ceil(evalf(sqrt(m),200)).] 

If the number m is a product of two primes that are relatively close together then this method will factor m quickly. If you do not find the factors in just a few seconds, you probably have a bug in your program. For some reason Maple does not have this method builtin. 

[N.B. This exercise shows that if care is not taken in choosing the primes p and q used in the RSA system, than the system can be easily broken

Alice sent a message to Bob using the RSA system. The public key used to encode the message was 
[m,e] = [187454749788911503119994043213682616233000961, 23073697474256143563]. 

The enciphered message was
  [99763088506717050716379498520357841718875740, 120165413768425112311337085191282286020515442, 130554852152844850464253187688342192964186591, 30831038803473309186944039044693095063005267, 43791870977158745785820581340119798552660187, 69969965042359538654291028155927734707714502, 33869965925699990903801791477929460546990002, 33844215332363231914638130818590411552396086, 61034870951899306892357141802983347226683758, 152680702248950827958295294572717135277913525, 109591116592896191360922558098912453060002989, 155489947789995346755966254731407091292570943, 30508537854841352888337386800131678916944679, 45657204694505066046067342403378233363404150, 122580283375455701674982424288406984864898071, 63190645718352016104824679398188140019415424, 17253386795565064409576412640690151622064852, 76432681365602448262013510061731737725777808, 4419855123469897669096067167819380964828479, 87913005918401414546998775379426321338719933, 155434516526735215629181544556450169276890711, 74695381359901114443168866905755723039288800, 246854149837977729662442017899408430336317, 121766227774612543867361050340041336298158533, 166784352080096633524033563364825999607054575, 72405993088552642775735865911360107823805504]

Decipher this message. 

[Hint: Use of ifactor with the option 'pollard' may help. When you are finished with the decryption, you should use colons where possible to suppress unnecessary output. ]
 

Hi, 

This chunk of code gives me almost instantly the desired result with Maple 2015 but fails returning a result after 5 minutes when ran from  Maple 2020.
Changing the method or trying to tune their options doesn't fix the issue (for a larger value of the absolute tolerance the result, close to 1, is even obviously false).

Could you please help me to fix this?
TIA

Download 2020_issue.mw

Hi everyone,

I'm new to using Maple and I've got a question concerning the calculation of the Lie Symmetries of an ODE. Basically, I want to us the method described in this paper: https://doi.org/10.1063/1.3097304 in order to find a perturbative solution to a system of first oder ODE's.

I thus need a special form of the generator. However I can't quite figure out the notation from the examples provided in the maple helt. I also can't figure out why I can't calculate the general form of the Symmetries using the following code: 

restart;
with(PDEtools);
with(DEtools);
Imp := 2*diff(y(x), x)*y(x)/A(x) - diff(y(x), x) - diff(A(x), x)*(y(x)/A(x))^2 - C_p*diff(A(x), x) - eta(x)*lambda(x)*sqrt(A(x)*pi)/4*(y(x)/A(x) - 1)^2 = 0;
Conti := diff(y(x), x) - 2*sqrt(A(x)*pi)*beta(x)*(1 - H + C/A(x)) = 0
Cons := diff(eta(x), x) = 0

sys := {Cons, Conti, Imp};
DepVars = {A(x), eta(x), y(x)};
deteqs := DeterminingPDE(sys);

Help or a link to some more examples would be much appreciated. 

Regards,

Johannes

hello,

I have 3 loops that I want to run, each loop runs a different procedure and have no interaction with the other, each loop takes about 5 hours to run so if I run the program in Series it takes about 15 hours, I can't separate the sheet into a few sheets and run it manually because there is initial data and calculations before the loops, so what I'm looking for is a way to parallel run these 3 loops.

The script I wrote so it would be clearer –

for i from 1 to n do 

for j from 1 to n do 

 x__Up[i,j]:= `Xmax__UP,m`(`P__m`(i,j),`I__m`(i,j),`data__upNc`);      

od:

if (i mod 10 =0 ) then  print(evalf((i)/(n))*100); fi:

od: 

for k from 1 to n do 

for m from 1 to n do 

 x__U[k,m]:= `Xmin__UP`(`P__m`(k,m),`I__m`(k,m),`data__upNc`);      

od:

if (k mod 10 =0 ) then  print(evalf((k)/(n))*100); fi:

od: 

Dear all

I tried to redo the same steps as presented in 
https://www.youtube.com/watch?v=l4Y3iQrPBa8
using Maple 

BUT, I  have an error, 

                               Error, (in assembly) bad index into Vector
I hope find the error in maple code

code1.mw

thank you