Euler’s Partition Theorem
Affiliation:
1. Institute of Informatics University of Białystok Ciołkowskiego 1M, 15-245 Białystok Poland
Abstract
Abstract
In this article we prove the Euler’s Partition Theorem which states that the number of integer partitions with odd parts equals the number of partitions with distinct parts. The formalization follows H.S. Wilf’s lecture notes [28] (see also [1]).
Euler’s Partition Theorem is listed as item #45 from the “Formalizing 100 Theorems” list maintained by Freek Wiedijk at http://www.cs.ru.nl/F.Wiedijk/100/ [27].
Publisher
Walter de Gruyter GmbH
Subject
Applied Mathematics,Computational Mathematics