<abstract xmlns="http://www.w3.org/1999/xhtml"><p>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]). </p><p>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].</p></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].

Euler’s Partition Theorem

Institute of Informatics University of Białystok Ciołkowskiego 1M, 15-245 Białystok Poland

Formalized Mathematics

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.

{"article-title":"Euler\u2019s Partition Theorem"}

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...

Euler’s Partition Theorem

Publicado en línea: 13 ago 2015

Páginas: 93 - 99

Recibido: 26 mar 2015

DOI: https://doi.org/10.1515/forma-2015-0009

Palabras clave
partition theorem

© by Karol Pąk

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.

Euler’s Partition Theorem

Publicado en línea: 13 ago 2015

Páginas: 93 - 99

Recibido: 26 mar 2015

DOI: https://doi.org/10.1515/forma-2015-0009

Palabras clavepartition theorem

© by Karol Pąk

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.

Palabras clave
partition theorem