- #1
e2theipi2026
- 9
- 1
Prove that the number of unordered partitions of an even number [tex]2n[/tex] into [tex]2[/tex] composites is greater than the number of unordered partitions of an odd number [tex]2n+1[/tex] into 2 composites for [tex]n>1[/tex] and [tex]n\ne p[/tex] prime.
Last edited: