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 cowboy ... is well on his way to becoming a figure of magnificent proportions. Bowlegged and gaunt, he stands as the apotheosis of manly perfection. Songs, novels, movies, magazines, and operettas have made the least inquiring of us well acquainted with his extraordinary courage, unfailing gallantry, and uncanny skill with gun or lariat. The farmer, meanwhile, sits stolidly on his tractor, bereft of romance and adventure.
    —For the State of Kansas, U.S. public relief program (1935-1943)

    Know that, on the right hand of the Indies, there is an island called California, very near to the Terrestrial Paradise, which was peopled with black women.... Their arms were all of gold.
    —For the State of California, U.S. public relief program (1935-1943)