4993 Reputation

15 Badges

9 years, 214 days

MaplePrimes Activity

These are answers submitted by tomleslie

Not sure why you want a "recursive procedure" for this problem unless it is for teaching/learning pruposes.

Ignoring the "recursive" requirement there are many ways to achieve what you want, depending on whether you would like a user-defined error message, or are happy to receive a Maple-generated error message.

See the attached file for a few options

If I force a numerical evaluation of your final integral using

( int
  ( exp(-.3872983346*r*(2.*r-2.))/(r*HeunB(0., -.8801117368*I, -.1936491673, 0., (.8801117368*I)*r)^2),
    r = 0..1

then Maple returns Float(infinity)

If I plot the integrand over the integration range 0..1 using

( exp(-.3872983346*r*(2.*r-2.))/(r*HeunB(0., -.8801117368*I, -.1936491673, 0., (.8801117368*I)*r)^2),
   r = 0 .. 1

then it *seems* reasonably obvious that the integrand heads to infinity as r->0.

Given the expression(s) which you have entered, should Maple return infinity - probably yes, and I don't know why it doesn't. Either way I don't think you are going to have much luck evaluating these integrals, because the answer always seems to be infinite, and I'm pretty sure that is not what you want

Like this

X:=[2, 3, 5, 9]:
Y:=[7, 5.0, 2, 11]:
evalf(add( X[i]*ln(Y[i]), i = 1..numelems(X)));

Too many errors/typos in your original code to list them all
Suggest you read the attached very carefully - It is *close* to what I *think* you want

Don't really need the square bracket suggestion. Solve will produce a sequence (which is an indexable entity) so solutions can be selected using a[i] where i is a number from 1..3.

Or if you only want real solutions then use RealDomain[solve]

See the attached (slightly revised) worksheet


SO many things I wouldn't do this way - such as having text in matrices, keys as a set not a list, etc, etc - but if you just want the quick dirty answer, try


m:=< <"foobar"  | 77>,
     <"faabar"  | 81>,
     <"foobaa"  | 22>,
     <"faabaa"  | 8>,
     <"faabian" | 88>,
     <"foobar"  | 27>,
     <"fiijii"  | 52>>:
keys:={"foo", "faa"};
< seq( < j | add( `if`(m[i,1][1..3]=j,  m[i][2] ,0), i=1..7)>, j in keys) >;

Or you could play with

f:= x -> piecewise( x<0, -(x^2) ,0<=x, x^2) ;
MeanValueTheorem(f, -2..2);

Assuming you have two lists, the first (L1) has elements [x1i, y1i], i=1..n the second (L2) has elements, [x2i, y2i], i=1..n and you want a third list (L3) with elements [x3i, y3i], i=1..n, where x3i=x1i and y3i=y1i*y2i, then all that is required is

L3:= [seq( [L1[j][1], L1[j][2]*L2[j][2]], j=1..numelems(L1))];

The first part of your question can be considered as Maple-specific: the code

A:= Matrix([ [a, a-1, -b],
                  [a-1, a, -b],
                  [b, b, 2*a-1]
algsubs( b^2=2*a*(1-a), Transpose(A).A );

results in an identity matrix which demonstrates that you have a rotation matrix - although you should consider why AT*A=I implies that A is a rotation matrix!

The second part of your question is an *understanding* problem which is not Maple-specific. I suggest you type something like "find rotation axis from matrix" into your favourite search engine and read almost any of the results


M:=Array([seq( [seq( i+j, j=1..5)], i=1..5)]);

Never use [] to produce an "inert" subscript:

a[0] will "print" as a0 but it actually defines the zeroth element of the indexable quantity a ( an implicitly defined table)- which is probably not what you want.

If you just want something which prints as a0 but has no implication of an indexable quantity, then you should use a__0 (that's two underscores).

Check what is printed and consider the difference between




The first of these assigns a:=1 as expected but the statement a[0]:=2 implicitly defines a table called a with a single indexed value (index 0) such that a[0]:=2 - this "overwrites" the original statement a:=1


The second of these just defines two scalar (ie non-indexable) symbols called a and a0 which are completely unrelated to each other


If you want all possible products of primes in your list (with each prime occurring only once in any product) then you could try

prods:=sort([seq(mul(j, j in q), q in combinat[choose]( L )[2..-1])]);

This works for me


eqn1:= diff(y(x),x)+4*y(x)^3-3*y(x)=0:
DEplot(eqn1, y(x), x=-1..1, y=-1..1);

pairs:=[ seq([M[j,1], M[j,2]], j=1..RowDimension(M))]:
PolynomialInterpolation(pairs, x);

Important things to realise are

  1. it is necessary for y<abs(x) so that the arcsin function is meaningful
  2. the function is actually defined for all (x,y) provided a value is defined for (x,y)=(0,0), and the restriction y<=abs(x) is maintained. The OP's requirement for -pi/2<=x,y,<=pi/2 is better interpreted as a region over which to plot than part of the piecewise definition
  3. This function gets very ugly for negative alpha. The factor (x^2+y^2)^alpha -> infinity as (x,y)->(0,0) when alpha is negative, and the value is defined as 0, when (x,y)=(0,0): not a good combination.

I came up with the attached

First 109 110 111 112 113 Page 111 of 113