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 discovery of Pennsylvania’s coal and iron was the deathblow to Allaire. The works were moved to Pennsylvania so hurriedly that for years pianos and the larger pieces of furniture stood in the deserted houses.”
    —For the State of New Jersey, U.S. public relief program (1935-1943)

    “Utah is the only State that gives condemned men a choice between death by hanging or before a firing squad. Most prisoners prefer the firing squad, but one obstinate convict in 1912 elected to be hanged because “hanging is more expensive to the state.””
    —State of Utah, U.S. public relief program (1935-1943)