Good morning sir,

I request you to provide the Maple Proc to solve the equations by Muller's method because it requires three 

initial approximations and the iteration process is very much tedious to get the desired accurate approximation.

Hello everyone,

I am dealing with an Eigen value problem, the equations are

restart:with(plots):

Eq1:=diff(f(y),y$2)-a^2*f(y)+a*(h(y)+R*q(y))=0;

Eq2:=diff(h(y),y$2)-a^2*h(y)+a*Z*y*f(y)=0;

Eq3:=diff(q(y),y$2)-a^2*q(y)+a*f(y)=0;

ic:=f(0)=0,f(1)=0,D(h)(0)=0,q(0)=0,h(1)=0,q(1)=0;

where f,h,q are Eigen functions, R, Z are dimensionless...

I am having trouble getting Maple to work with fractional exponents.  When I ask Maple to compute 8^(2/3) and 8^(1/3), it just echoes my input, instead of returning 4 and 2, respectively, as it should (I think the overwhelming majority of mathematicians would agree that Maple should return 4 and 2.  It is conventional not to consider complex numbers when defining, e.g.,  "8^(1/3)" unless a problem specifies that you need to consider complex numbers).  When I ask for 4^(1/2...

Hello,

It's a very easy question but i don't find for the moment.

I want to measure an angle in a revolute joint. For that purpose, i use a probe to measure the angle. The angle is measured in rad. How can i do to change in deg ?

Thank you for your help.

This blog post is a response to a post on MaplePrimes.  MaplePrimes user wkehowski asked how the Task Model could be used to filter combinations.  The basic problem is formalated like this:  We want a function, I'll call it FilterComb, that accepts positive integers...

 how to find 6x^2 +5x+1 mod 2x+1 ? please using maple slove 

Hi all,

I'm getting started with maple. Want to solve the following integral:

int(     (  1+(a*x)^t  )^(-1/t)      , x = 0 .. z)

Constraint: 0<t<1

Maple 8 installed on an old WinXP gave me a solution with

hypergeometric functions. Maple 17 installed on a Linux64

gave me no answer at all. What could explain this difference?

Thx...

Hi!

I'mtrying to use Maple's statistic and linear algebra packages to get a functionality similar R. The biggest problem that I have currently is to find an easy/simple way to import and access data from tables/spreadheets in ascii notation (essentially what read.table(<filename>, <options>) gives you in R). I tried to use something like M:=ImportMatrix(<filename>) for that, which actually reads a table, but I don't know how to use to access/use the...

Hi,

New to maple and I have 2 questions that I'm stuck on.

1) Find the principal arguments of the 5 roots of the polynomial

and enter a decimal approximation to the largest principal argument in the box below.

ans: 2.589502038

2) Find the moduli of the 5 roots of the polynomial

and enter a decimal approximation to the largest modulus in the box below

ans: 2.34880159160143

I dont really know what to write in maple to get the answer. So, if someone could help me out that would be really great. cheers

Hello,

I'm trying to sort a list of symbols respecting some assumptions I have made about them. For example, I'd like to assume that 0<x<1, and I would like [x, x^2, x^3] to be sorted into [x^3, x^2, x]. How would I accomplish that? Making an assumption with assume() does not affect anything, as the sort() function does not seem to be actually comparing the values of symbols (only numeric values). Any help will be appreciated.

Thank you. 

Diff(x1(t),t) - x2(t) = 0;

Diff(x2(t),t) - x3(t) = 0;

Diff(x3(t),t) +3*x3(t) + 4*x2(t) + x1(t) = 2*Diff(u(t),t$2) + 5*Diff(u(t),t) + 7*u(t);

multiply above system by test functions -lambda1(t),-lambda2(t),-lambda3(t) and integrate by part

in order to find adjoint operator in the form

x1 -> Diff(lambda1(t),t) - lambda3(t) = miu1(t)

x2 -> Diff(lambda2(t),t) + lambda1(t) - 4*lambda3(t) = miu2(t)

This is what i have done to find the difference between a ball thrown with different starting angle, and then ploted they into the same plot.

restart; Digits:=20: with(plots):

C_0:=0.4: d:=0.0002: mu:=1.8*10^(-5): rho:=1.2: g:= 9.81:
rho_v:=1000.0: m:=evalf((4/3)*Pi*rho_v*(d/2)^3):   


F_D:=proc(v::list)                 
local k,vx,vy; 
vx:=v[1]; 
vy:=v[2]; 

This is my approach:

sum(1/(4*n+1/3*k),k=1..infinity)

but I end up getting infinity for my answer which is obviously wrong.

Himmelblau.mw

     On the basis of Dragнilev method…

     Is there anyone interested in the algorithm to reduce the distance between the points of the given constraints? The algorithm is adapted for use in R ^ n. This is an example of its work on the surface:  
f = - (x1 ^ 2 x2-.3) ^ 2 - (x1 x2 ^ 2-.7) ^ 2 - 5;  

     Approximate description of the algorithm in pictures.

I am a student taking differential equations and I need to implement Euler's method using Maple 17. I have set up a do loop that looks like this:

for i from 1 to n1 do

k:= f(t,v):

v:= v + h*k:

t := t + h:

od:

Where n1 is initialized to 50, f(t,v) := 0.0207v² -893.58, and h is 0.1. v and t are both initialized as 0.