Partition of Integer into Odd Parts

Theorem


A particular theorem is missing.
You can help $\mathsf{Pr} \infty \mathsf{fWiki}$ by adding the theorem.
To discuss this page in more detail, feel free to use the talk page.
When this work has been completed, you may remove this instance of {{TheoremWanted}} from the code.



Proof


This theorem requires a proof.
You can help $\mathsf{Pr} \infty \mathsf{fWiki}$ by crafting such a proof.
To discuss this page in more detail, feel free to use the talk page.
When this work has been completed, you may remove this instance of {{ProofWanted}} from the code.
If you would welcome a second opinion as to whether your work is correct, add a call to {{Proofread}} the page.



Examples

Partition of $5$ into Odd Parts

The integer $5$ can be partitioned into odd parts as follows:

$5$
$3 + 1 + 1$
$1 + 1 + 1 + 1 + 1$
This article is issued from ProofWiki. The text is available under Creative Commons Attribution-ShareAlike License unless otherwise noted. Additional terms may apply for the media files.