Problem #115

Pure partitions
Public 05/22/14 10xp Math 100.0%


Author Philippe_57721

A partition of n is pure if it can express every number between 1 and n in exactly one way.
There are 8 pure partitions of 11:
  • 6 3 1 1 = 1 (1+1) 3 (3+1) (3+1+1) 6 (6+1) (6+1+1) (6+3) (6+3+1) (6+3+1+1+1)
  • 6 2 2 1 = 1 2 (2+1) (2+2) (2+2+1) 6 (6+1) (6+2) (6+2+1) (6+2+2) (6+2+2+1)
  • 6 1 1 1 1 1 = 1 (1+1) (1+1+1) (1+1+1+1) (1+1+1+1+1+1) 6 (6+1) (6+1+1) (6+1+1+1) (6+1+1+1+1) (6+1+1+1+1+1+1)
  • 4 4 2 1 = 1 2 (2+1) 4 (4+1) (4+2) (4+2+1) (4+4) (4+4+1) (4+4+2) (4+4+2+1)
  • 4 4 1 1 1 = 1 (1+1) (1+1+1) 4 (4+1) (4+1+1) (4+1+1+1) (4+4) (4+4+1) (4+4+1+1) (4+4+1+1+1)
  • 3 3 3 1 1 = 1 (1+1) 3 (3+1) (3+1+1) (3+3) (3+3+1) (3+3+1+1) (3+3+3) (3+3+3+1) (3+3+3+1+1)
  • 2 2 2 2 2 1 = 1 2 (2+1) (2+2) (2+2+1) (2+2+2) (2+2+2+1) (2+2+2+2) (2+2+2+2+1) (2+2+2+2+2) (2+2+2+2+2+1)
  • 1 1 1 1 1 1 1 1 1 1 1 = 1 (1+1) (1+1+1) (1+1+1+1) (1+1+1+1+1) (1+1+1+1+1+1) (1+1+1+1+1+1+1) (1+1+1+1+1+1+1+1) (1+1+1+1+1+1+1+1+1+) (1+1+1+1+1+1+1+1+1+1)(1+1+1+1+1+1+1+1+1+1+1)
How many pure partitions of 46079 are there?
[My timing: < 100ms]



You need to be a member to keep track of your progress.
Register


Time may end, but hope will last forever.

Other Challenge Sites

Contact

elasolova
[64][103][109][97][105][108][46][99][111][109]