Maple Questions and Posts

These are Posts and Questions associated with the product, Maple

In polar coordinate, when we differentiate er, it becomes e[theta]. However it seems Maple can't do this, even I have set it into polar coordinate.

How can I allow maple to do this?


Any Example can help see the difference between contour and simple integration?

int(XXXX, x, method = contour);

int (XXX, x)

which example can help to see the difference?

hi

I wan`t use maple to solve my problem

x1[n]= ej*( Π/6) *n

Hey, so i guess i dont really know whats going on. I am trying to install Maple 10 on my Macbook Pro. I get an error message Uncaught exception in main method: java.lang.NoClassDefFoundError: org/apache/crimson/parser/XMLReaderImpl when i try to open the program. Any help?

How to make maple to change ln(exp(x)) = x?  for example exp(ln(x)) = x, or ln(exp(x+1)) = x+1

How can I most succinctly and straightforwardly get Maple to simplify f below to g below?

> f:=(6*x^2-6*x+6)^(1/2)*(2*x^2-2*x+2)^(1/2);

                          (1/2)                 (1/2)
          /   2          \      /   2          \     
          \6 x  - 6 x + 6/      \2 x  - 2 x + 2/     

> g:=simplify(f) assuming x::real;

                        (1/2) / 2        \
                     2 3      \x  - x + 1/

> simplify(g-f...

I want to plot a random ... no, sorry, normal distribution of points around a line.  Let's supose we use the line sin(x) from x=0..2*Pi as an example. 

I have a complex nonlinear long term, I have not found a way to simulate this expression,how I can apply the method of least squares

Hi,

I want to evaluate an approximation of the solution of the equation eq1 in [0,1] using 4 digits.

In first try, when I first write Digits:=4,  this seems avoid the command fsolve to display the solution.

In second try, when I write evalf(fsolve(eq1,beta=0..1),4),  evalf seems avoid the command fsolve to display the solution.

In the final try, when I write  
> fsolve(eq1,beta=0..1):
> evalf(%,4);
I have...

when i use u and t in the lower bound of summation, everything works fine, as you can see, proc(2,10) gives me a number.

 

 

now, if i change u to T[3] and t to T[2], suddenly we have a problem! What gives?

I've finally tracked down a problem I was having to a behavior in Maple I find, possibly, understandable, but need to figure out how to prevent.   Specifically, in expressions of the form x^y, where both x and y may sometimes be zero, the behavior I require is for Maple to evaluate y first so x^0=1 whatever the value of x is.   (Maple does evaulate 0^0=1 itself, I note.)

An example where this sort of thing comes up is in an expression like

sum(x^k,k=0..5)

Sequencing sequences doesn't appear to work with round brackets

seq( (seq(i,i=1..10) , seq(j,j=9..2,-1)) ,k=1..4)

 

Hello, I have a problem, when I define some constants like a:=5, b:=6 and than I do some calculation like a+b maple shows immidiately the solution. Is there any way how to make maple to show the numbers at first and then the solution? What I mean is if I define the same constants a:=5, b:=6, then make the calculation a+b. The output i want would be 5+6=11. Is it possible to make maple show the solution this way? I use it for more complex calculation in civil...

 I would like to pay attention to the article "Exploratory Experimentation and Computation" by David H. Bailey and Jonathan M. Borwein just published in Notices of AMS, 2011, V. 58, N 10, 1410-1419
 ( http://www.ams.org/notices/201110/rtx111001410p.pdf ) . It should be noted that Maple is one of the leading characters of this article.

Hi,

I am working on my project related to bioinformatics. I am using Maple 11 for calculations related to matrices.

I need to calculate  Moore-penrose Pseudoinverse. I need to know the algorithm used by Maple function

'MatrixInverse' for calculating pseudo inverse of matrix.

 

Thanks

First 1652 1653 1654 1655 1656 1657 1658 Last Page 1654 of 2224