home *** CD-ROM | disk | FTP | other *** search
- Path: sparky!uunet!zaphod.mps.ohio-state.edu!samsung!balrog!web.ctron.com!wilson
- From: wilson@web.ctron.com
- Newsgroups: sci.math
- Subject: Partition number question
- Message-ID: <4574@balrog.ctron.com>
- Date: 23 Jul 92 14:09:39 GMT
- Sender: usenet@balrog.ctron.com
- Reply-To: wilson@web.ctron.com ()
- Organization: Cabletron Systems INc.
- Lines: 18
- Nntp-Posting-Host: web
- Originator: wilson@web
-
-
- For n >= 0, let p(n) be the unrestricted partition number of n.
-
- 1. For all k >= 0, is it true that
-
- a. 5 | p(5k+4)
- b. 7 | p(7k+5)
- c. 11 | p(11k+6)
-
- 2. Given (1) is true, are there other triples (a > 0, b > 0, c >= 0)
- such that a | p(bk+c) for all k >= 0?
-
- 3. Why does 11 divide so many small partition numbers?
- --
- David W. Wilson (wilson@ctron.com)
-
- Disclaimer: "Truth is just truth...You can't have opinions about truth."
- - Peter Schikele, introduction to P.D.Q. Bach's oratorio "The Seasonings."
-