Partition of Integer where Part Appears no more than Twice

From ProofWiki
Jump to navigation Jump to search

Theorem


Proof


Examples

Partition of $4$ where Part Appears no more than Twice

The integer $4$ can be partitioned such that no part appears twice as follows:

$4$
$3 + 1$
$2 + 2$
$2 + 1 + 1$