Dear friends, I recently answered a query concerning the action of the automorphism group of the Petersen graph on its edges at math.stackexchange.com. The algorithm that I present is quite naive, but it does produce the desired result. I thought I would share it here because it makes a nice Maple programming exercise e.g. for a talented student at high school level. (I have always thought that Polya counting and permutation groups belong into the high school curriculum.) It makes extensive use of Maple's internal hash function for compound objects to efficiently compare them during the computation. It is quite interesting to observe how Maple does work hard for several minutes to do this computation and then comes up with the correct answer. (Obviously the core computation needs to be done only once.) Enjoy!

Best regards, Marko Riedel

If you come up with a better algorithm then please do share it at the stackexchange link.

Important update Mar 24 2016. The algorithm at the above post is middling to say the least, but can perhaps serve as an example of Maple computational techniques. There is an efficient algorithm including Maple code here at math.stackexchange.com.

Maple T.A. 9 is here!

The new release includes a large selection of useful new features and enhancements, including:

- Content. Maple T.A. 9 includes an easy mechanism to share questions with the community and access questions created by others, through the Maple T.A. Cloud. The Maple T.A. Cloud already contains thousands of questions that you can use and modify.

- Adaptive Testing. Expanding on the adaptive question...

Dear friends,

I have recently been calculating a sum from this link.

The problem here is to calculate the sum sum_{n>=1} (-1)^(n+1)/(n^2+a) with a some positive real number. You probably all agree that it is preferable to express it using elementary functions from basic calculus as opposed to the Gamma, Zeta and Digamma...

The latest version of the Iterator package is now available at the Maplesoft Application Center.  It provides a new export, MultiPartition, extensions to existing exports, and options to most exports for transforming the output to a more desirable form. The help pages have been improved, with some hopefully interesting examples.  Here is one, showing how it can be used to write a procedure for solving a generalized ...

I just posted and then clicked 'logout' (upper right on the page).

After going back I recognize I am still logged in. Strange. Does
the page not clear the data (= cookies?) for that demand?

restart;
a:= 2.75:  b:= 7.:  N:= 2^4:
X:= t-> add(sin(b^k*t)/a^k, k= 0..N):
Y:= t-> add(cos(b^k*t)/a^k, k= 0..N):
plot(
   [X, Y, 0..2*Pi], numpoints= 2^12
  ,scaling= constrained
  ,axes= none
  ,color= cyan
  ,caption= cat("Happy New Year ", StringTools:-FormatTime("%Y"))

In ?ChiSquareIndependenceTest a contingency table is needed for input.
To construct such a table from raw data is not trivial. I suggest to include this in the statistics package.
A first try:

Crosstab := proc(A,i,j,first::evaln,second::evaln)
  

J:=Int((3*v^2+4*v+2)*(-(3*v^2+2*v+1)/(3*v^2+8*v+4))^(1/2)/(1+2*v)^2,
      v = -2 .. -2/3) 

Then J = -8/3*EllipticK(1/3) + 8/3*EllipticPi(-1/3,1/3) + 3*EllipticE(1/3)


That integral caught my attention through a private discussion. Both MMA and Maple
only succeded up to a limit in the lower boundary, which could not be determined.

Re-writing the integrand as A/(polynomial of degree 4) using the command 'rationalize'

Reposting an old piece of code, but with two corrections.

yuletide.mw

Maple has  combinat [composition] (n, m)  command, which returns all possible lists of positive integers of  m  terms, the sum of which in each list is n. But there is no similar command for multiplication.

Wrote recently procedure  Factoring, which solves this problem. Formal arguments:  n> 1 - an integer, m - an optional parameter...

This example was reported to me after a Calculus II student encountered this ridiculous result:

f := (k+5)/sqrt(k^7+k^2):
Int( f, k=1..infinity ):
% = value( % );
             /infinity                              
            |              k + 5                    
            |          -------------- dk = -infinity
            |                   (1/2)               
           /1          / 7    2\                    
                       \k  + k /                    

Maple 16 introduces the ?ModuleIterator method, which can be assigned in a module so that it can be used  in a for-loop, or in the seq, add, and mul procedures.

ModuleIterator should return two procedures.  The first (referred to as hasNext) is a predicate that returns true if the iterator is not finished.  The second (referred to as ...

I would like to be able to look at the maple video tutorials with the MaplePlayer on the Ipad. Hope that this is made possible.