help me! 

I have a problem with the system, looking forward to everyone's help!

expand((x-c)^2+(y-d)^2-R^2) = 0; algsubs(-R^2+c^2+d^2 = f, %); P := proc (x, y) options operator, arrow; -2*x*c-2*y*d+x^2+y^2+f = 0 end proc; 2 2 P := (x, y) -> -2 x c - 2 y d + x + y + f = 0 P(a*cos(theta), b*sin(theta)); G := unapply(%, theta); #usage des formules d'Euler simplify(expand(4*(exp(I*theta))^2*subs(cos(theta) = (exp(I*theta)+exp(-I*theta))*(1/2), sin(theta) = (exp(I*theta)-exp(-I*theta))/(2*I), G(theta)))); poly := sort(subs(exp(I*theta) = X, exp((2*I)*theta) = X^2, exp((3*I)*theta) = X^3, exp((4*I)*theta) = X^4, %)); coeff(lhs(poly), X^4)/tcoeff(lhs(poly)); # exp(I*theta1),exp(I*theta2),exp(I*theta3),exp(I*theta4) sont les racines de ce polynôme unitaire : exp(I*theta1)*exp(I*theta2)*exp(I*theta3)*exp(I*theta4) =1 exp(I*(θ1+θ2+θ3+θ4)=1 d'où θ1+θ2+θ3+θ4 ≡ 2*Pi

I am trying to construct a procedure which makes a boxplot from a list using the statistics package. 

I have come to this here. However it shows both the x and y - axis. Is there any way to make it show a horizontal boxplot like in my code. But only displays the x- axis ? Meaning the values from the plot? Plus any to make it not stick to x-axis like my code does? I tried the command scale, but it doesn't work in statistics package 

    BoxP:=proc(xd::list) 
        uses Statistics:
        return plots[display](BoxPlot(xd,deciles = false,orientation=horizontal),size=[600,400],axes=normal);
    end proc;

Assume 

matrix([[1,0],[0,1]]) * matrix[[y],[y']]
= a system 

how to get back matrix([[1,0],[0,1]]) from this system in general method if the system is very large?

Is there a function to convert recurrence equation to a system of equations?

I think we will write nested for loops or nested sequences. But I can' t achieve.

Could you help me?

EDITED AND EXTENDED:

In fact, the original question is as follows:

and

where it is a standard inner product on L^2 and u(x,t) is a function. For example; u(x,t) =x*t etc.

(The screenshots is taken from a book)

I want to write a code for finding Matrix U whose elements are u_ij.

Hello!

How can I make MAPLE to create the solution of the following system?

Program of Transfer matrix method for solving the vibrational behavior of a cracked beam. For more details and comprehension check the paper entitled ''A transfer matrix method for free vibration analysis and crack identification of stepped beams with multiple edge cracks and different boundary conditions ''
 

Download transfer.mw

Hi, 

I'm currently solving an equations where the boundary conditions is at infinity. I'm trying to solve it by using dsolve but i can't seem to find a solutions. Here is my equations:

ode1 := diff(f(eta), eta$3)+(diff(f(eta), eta$2))*f(eta)-(diff(f(eta), eta))^2-M . (diff(f(eta), eta))-A . (diff(f(eta), eta)+(1/2)*(eta . (diff(f(eta), eta$2)))) = 0;

ode2 := diff(theta(eta), eta$2)+Pr*(f(eta) . (diff(theta(eta), eta))-(diff(f(eta), eta)) . theta(eta)-A . (theta(eta)+1/2 . eta . (diff(theta(eta), eta)))) = 0;

and my boundary conditions are:

bcs := f(0) = 0, (D(f))(0) = 1, ((D@@2)(f))(inf) = 0, theta(0) = 1, theta(inf) = 0;

The value of Pr=7, M=1 and A=[0,1,2,4]

I really need your help, please. 

Thank you :)

The solution to the logistic map .The solution now oscillates but doesn't appear to show any discernible pattern. The value of X_n seems to "jump around". This  called chaotic.

For convenience, I am looking to extract a sequence of numbers that is generated by a simple procedure.

The attached shows such an example.

In this (simple) case, the output I require is [1,4,9,16,25].

Can anyone suggest a way to do this?

Thank you all ...

MaplePrimes_Example.mw

E-_Original_RSA.pdf

If I want to calculate and know the exact time duration of running step 8, do the current algorithm, 

st := time();

elapsed_time := (time() - st)*sec

is good enough? precise enough? or accurate enough? 

Any other recommendations? 

https://math.stackexchange.com/questions/301068/how-do-you-find-a-corresponding-recurrence-relation-for-some-random-algorithm/301709

according to this link, how to parse or walk through the algorithm in maple to generate recurrence relation formula?

How to remove all punctuation marks in a string read from a text file 

and then store in a list of words according to the ordering of the original text?

Ahead of the upcoming deadline 14 jan 2020 for switching from Windows 7 to Windows 10,  I am investigating whether Maple 2019 will run on an HP Stream laptop: Celeron CPU N3060 @ 1.6GHz, RAM 2GB, 64 bit.running Windows 10.

My guess is that the above spec is too low to successfully run Maple 2019.  But if anyone has had success running Maple on a similar spec device please let me know.

Melvin