Sets of parts such that the partition function is even
Ben Saïd, J.-N. Nicolas (2003)
Acta Arithmetica
Similarity:
Ben Saïd, J.-N. Nicolas (2003)
Acta Arithmetica
Similarity:
P Erdös, P. Turán (1971)
Acta Arithmetica
Similarity:
W. Klonecki (1966)
Applicationes Mathematicae
Similarity:
Ji, Kathy Qing (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Robert Karpe (1973)
Archivum Mathematicum
Similarity:
Kağan Kurşungöz (2010)
Acta Arithmetica
Similarity:
Subbarao, M.V. (2004)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Sellers, James A. (2003)
Integers
Similarity:
Sellers, James A. (2004)
Journal of Integer Sequences [electronic only]
Similarity:
L. Chawla, Ellen Torrance (1977)
Acta Arithmetica
Similarity:
Karol Pąk (2015)
Formalized Mathematics
Similarity:
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].