Partition of Integer into Parts not Multiple of 3

From ProofWiki
Jump to navigation Jump to search

Theorem


Proof


Examples

Partition of $4$ into Parts not Multiple of $3$

The integer $4$ can be partitioned into parts which are specifically not multiples of $3$ as follows:

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