hi let's look for the intersection of 2 functions the first one f1 := unapply(CurveFitting[Spline]([[1.55, 1], [1.6, 0], [1.65, 0], [1.7, 0], [1.75, 0], [1.80, 0], [1.85, 0], [1.9, 0], [1.95, 0]], x, degree = 1), x); the second one r := unapply(CurveFitting[Spline]([[1.55, 0], [1.6, 1], [1.65, 1], [1.7, 1], [1.75, 0], [1.80, 0], [1.85, 0], [1.9, 0], [1.95, 0]], x, degree = 1), x); when we plot the 2 functions : plot({f1(x), r(x)}, x = 1 .. 1.95, y = 0 .. 1, thickness = 3); we see that there is 2 intersections that are 1.575000000, RealRange(1.750000000, infinity) but maple gives 1.575000000, 1.550000000, RealRange(1.750000000, infinity)

hi lets say i have an array like this one a:=[1.575000000, BottomProp, BottomProp,1.6, RealRange(1.750000000, infinity)]; i would like to have from this array only a:=[1.575000000,1.6]; how to do that thank you

Hi I want to know whether it is possible to obtain the third order tensor (second derivative) and also the higher order derivatives in Maple just as we can find the Jacobian. Then how? For example, x=array(1..n): f:=[x[1]^2-2x[2], x[2]^3-3x[3]]: jac:=jacobian(f,x); we can get the jacobian. Can we get the second derivative (n by n by n matrix) and also the higher order derivatives. Thanks.

I have conmpleted a maplet application. It takes 45 seconds to initiate the application. I understand to speed up my application is to convert it into a module. Can someone show me how to convert my applicatioh into module. Consider the application: with(Maplets[Elements]):Hello:=Maplet(["Hello World!", Button("OK", Shutdown())]): Maplets[Display](Hello): thanks in advance. Pat

How would I plot the points of f[i,j,k] versus t[i,j,k] where i, j, and k are from -n to n? Please let me know if you need clarification or further details as to what I'm trying to do.

Hello, I have an equation to solve over the integers. I already know that there are an infinite number of solutions, but I would like to know how I can get Maple to reproduce my results. I used isolve, but it returned nothing. Is there a trick or way of phrasing the question to get Maple to solve the problem? Thanks isolve((x+y+z)^3 = x*y*z) I also tried (with the same results): isolve((x+y+z)^3-x*y*z = 0) The solution is obviously: {0, n,-n} or some permutation of this set. Note I would like to be able to solve this as if I had no guess! Thank you.

This is from Introduction To Maple by Andre Heck page 63, exercise 4(b): "with(numtheory); ... Find the prime number that is closest to 9876543210123456789." Here is a solution that does not use numtheory: View 4937_IntroductionToMaplePage63Exercise4b.mw on MapleNet or Download 4937_IntroductionToMaplePage63Exercise4b.mw
View file details

Hello all, I have been trying to include maple output graphs into latex, I converted the output to eps and to gif, with eps I can not compile my tex to pdf, it says file not found but the same tex file can be compiled to dvi without any problem. the problem with eps is that they are gray images while I want to include the colourful maple graph. I used epstopdf package to let latex convert the eps to pdf format then include the pdf image but compiling the tex file to pdf gives the error : epstopdf..disabled image.pdf not found, of course it can not find image.pdf because the epstopdf package is for some reasons disabled and compiling it to dvi gives a colourful image but the image takes almost a whole page so not nice, not in the size and place I want to show it.

This is from Introduction To Maple by Andre Heck page 63, exercise 3(c): Use Maple to "fator the polynomial x^8+x^6+10*x^4+10*x^3+8*x^2+2*x+8 modulo 13". I think that my problem is that I don't know what it means to factor a polynomial modulo and integer.

I need to unpack this function f(x)=2*x in Fourier on segment [0,1]...help me,I don't know how...

Hi guys, i wrote this fairly simply routine, to basically generate n equations, generate relations between those equations, then attempt to solve them by comparing coeffients, upon which i group together the information about the coefficients, for example i could have the equation ax+by=4x, so from that x=4,b=0 The equations in question are Dx=[x,Dy]+[Dx,y], when D is a map which maps x and y to A, where x and y span A's basis. so Dx and Dy would be a linear combination of x and y. This would be for the 2 dimensional case, for the n dimensional case x and y would extend to n variables.

Hi, I am trying to create a multi-linear procedure with a memory (remember). I would like the function to implement (x,y)-> int(int(x*y),t=0..tf),tf=0..T) where x and y would normally be functions of t. I don't seem to be able to figure out how make this happen. The above function is effectively an inner product. I would like to calculate the inner product for the basis functions and remember their values. This will speed up my future computations drastically. If I just define the function without the multilinear property, the function does recognize the linear combinations with the remember. That is if I compute f(a,c) and f(b,c), the lookup table does not know how to process f(a+b,c). It should just equal f(a,c)+f(b,c).

I am looking for some lecture notes covering 'the' 'elementary' properties of the Laplace transform, preferable (but not already written) using Maple for the proofs. What I would like to see is L(f, s) = Int(f(t)*exp(-t*s),t = 0 .. infinity) where s may be _complex_ and is not assumed to be real.

Hi guys, I've forgotten how to count down in a for loop, so something like for i from 4 to 1 do i; end for: Any advice??

Hello Maple experts, during my studies, I have developed a number of Maple procedures that deal with quantum information/quantum computation. This means I use excessively the Matrix data structure and the LinearAlgebra package. Given the fact that I'm not the most talented programmer in general and also that I had no experience with Maple before, I have now a Maple package that is sometimes really slow. Especially when working numerically, I'm often jealous about the performance I could have achieved with Matlab. This is although I already try to use Digits=14 (which should, in principle, enable hardware floating point operations). However, procedures involving Matrix objects are mostly not supported by evalhf (and cannot be compiled, right?). In order to improve that I want to do a profiling. One way of doing that is using