On Euler's Theorem

Abstract

Euler's theorem asserts that $A(n)=B(n)$ where $A(n)$ is the number of partitions of $n$ into distinct parts and $B(n)$ is the number of partitions of $n$ into odd parts. In this paper, it is proved that for $n>0$, \begin{align*} A(n)=B(n)=C(n+1)=\frac{1}{2}D(n+1), \end{align*} where $C(n)$ is the number of partitions of $n$ with largest part even and parts not exceeding half of the largest part are distinct, and $D(n)$ is the number of partitions of $n$ into non-negative parts wherein the smallest part appear exactly twice and no other parts are repeated.

Submitted for publication