Let \(p_u(n)\) be the number of ways to partition the integer \(n\) into unique factors. For example, 7 can be partitioned into \(\{3,4\}\) or \(\{1,2,4\}\) or \(\{2,5\}\) or \(\{1,6\}\) or \(\{7\}\).

Likewise, let \(p_o(n)\) be the number of ways to partition \(n\in\mathbb{N}\) into odd valued integers. As before, 7 can be partitioned into \(\{1,1,1,1,1,1,1\}\) or \(\{1,1,1,1,3\}\) or \(\{1,3,3\}\) or \(\{1,1,5\}\) or \(\{7\}\).

Prove that \(p_u(n) = p_o(n)\) for all values of \(n\in\mathbb{N}\).

No vote yet

1 vote

×

Problem Loading...

Note Loading...

Set Loading...

Easy Math Editor

`*italics*`

or`_italics_`

italics`**bold**`

or`__bold__`

boldNote: you must add a full line of space before and after lists for them to show up correctlyparagraph 1

paragraph 2

`[example link](https://brilliant.org)`

`> This is a quote`

Remember to wrap math in \( ... \) or \[ ... \] to ensure proper formatting.`2 \times 3`

`2^{34}`

`a_{i-1}`

`\frac{2}{3}`

`\sqrt{2}`

`\sum_{i=1}^3`

`\sin \theta`

`\boxed{123}`

## Comments

Sort by:

TopNewestLet \(Q(x)=(1+x+x^2...)(1+x^3+x^6...)(1+x^5+x^{10}...)...=\frac{1}{1-x}.\frac{1}{1-x^3}...\).Then the coefficient of \(x^n\) will be \(p_{0}(n)\).

Now let \(P(x)=(1+x)(1+x^2)...\).Then the coefficients here would be \(p_u(n)\).

But if we multiply \(P(x)\) by \((1-x)(1-x^2)...\) and divide by that, terms will cancel and we will get \(P(x)=Q(x)\).Then we just compare coefficients.

Log in to reply