On the number of partitions into primes
โ Scribed by R. C. Vaughan
- Publisher
- Springer US
- Year
- 2007
- Tongue
- English
- Weight
- 316 KB
- Volume
- 15
- Category
- Article
- ISSN
- 1382-4090
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Let Q(n) denote the number of partitions of an integer n into distinct parts. For positive integers j, the first author and B. Gordon proved that Q(n) is a multiple of 2 j for every non-negative integer n outside a set with density zero. Here we show that if i 0 (mod 2 j ), then In particular, Q(n)
It is shown that any Boolean expreGon in clisjunctk\*: normal form h;l\ing k ccjnlunctk. (\*an hate at most Zk pnme implicants. However. there csist such expressions thnt ha1.t' ? ' r.rirnc implicants. It is also shown that any Boolean eqw:s~ion m II din,tinct prnpo4ticm;~l ~:~rinlA-~ call have at m