Years ago I read in the daily paper(!) an account of a new theorem in partition theory. The key was that the guy had had the idea of proving theorems that were not for all cases but for all but a finite number of cases. The theorem had something about the number of ways to partion (prime?) numbers, and all I remember is that when the number of partitioning bins was either 17 or 19 (I forget), the number of ways was 237 "for all numbers except in a finite number of cases". You can see how confused I am. The fault is not the original story, which I remember as being pretty clear, but the long memory gap.(adsbygoogle = window.adsbygoogle || []).push({});

Does this ring a bell for anybody?

**Physics Forums | Science Articles, Homework Help, Discussion**

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Trying to track down a Partition theorem

**Physics Forums | Science Articles, Homework Help, Discussion**