Pentagonal Number Theorem - Example Program

Example Program

Here is a simple Python program which computes p(n), the number of partitions, using the recurrence resulting from the pentagonal number theorem.

pentagonal = lambda n : n*(3*n-1)/2 def generalised_pentagonal(n): # 0, 1, -1, 2, -2 if n < 0: return 0 if n%2 == 0: return pentagonal(n/2+1) else: return pentagonal(-(n/2+1)) pt = for n in range (1, 1000+1): r = 0 f = -1 i = 0 while 1: k = generalised_pentagonal(i) if k > n: break if i%2==0: f = -f r += f*pt i += 1 pt.append(r) print pt

Read more about this topic:  Pentagonal Number Theorem

Famous quotes containing the word program:

    “The actions of each dancer were scrutinized with great care and any little mistake noted and remembered. The strain upon a dancer was consequently so great that when a fine dancer died soon after a feast it was said, “The peoples’ looks have killed him.””
    —Merle Colby, U.S. public relief program (1935-1943)

    “A ‘spasm band’ is a miscellaneous collection of a soap box, tin cans, pan tops, nails, drumsticks, and little Negro boys. When mixed in the proper proportions this results in the wildest shuffle dancing, accompanied by a bumping rhythm.”
    —For the City of New Orleans, U.S. public relief program (1935-1943)