Trying to track down a Partition theorem

[selfAdjoint]

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.


Does this ring a bell for anybody?

 

[hey.like]

Daily problem is that, The math problem is in some famour mind

I see, some simple problem is fun very. but it is mean sole.
As some mean enough math question is to let it free fly... .

 

[M98Ranger]

I'm not familiar with a specific partition theorem that fits this description, but it does sound like the concept of "almost everywhere" theorems in mathematics. These are theorems that hold true for all cases except for a finite number of exceptions. This approach is often used in number theory, where it is impossible to prove a theorem for all numbers due to the infinite nature of numbers. Instead, mathematicians prove the theorem for all but a finite number of cases, which is still considered a strong result. If you can provide more specific details or keywords, I may be able to help you track down the theorem you're looking for.