A combinatorial proof of Andrews' smallest parts partition function.
Ji, Kathy Qing (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Ji, Kathy Qing (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Subbarao, M.V. (2004)
International Journal of Mathematics and Mathematical Sciences
Similarity:
P Erdös, P. Turán (1971)
Acta Arithmetica
Similarity:
Eriksson, Kimmo (2010)
Integers
Similarity:
Ben Saïd, J.-N. Nicolas (2003)
Acta Arithmetica
Similarity:
Sellers, James A. (2003)
Integers
Similarity:
Sellers, James A. (2004)
Journal of Integer Sequences [electronic only]
Similarity:
Frank G. Garvan (1994)
Manuscripta mathematica
Similarity:
Kağan Kurşungöz (2010)
Acta Arithmetica
Similarity:
Robert Karpe (1973)
Archivum Mathematicum
Similarity:
W. Klonecki (1966)
Applicationes Mathematicae
Similarity:
M. Skałba (2010)
Colloquium Mathematicae
Similarity:
For any partition of a set of squarefree numbers with relative density greater than 3/4 into two parts, at least one part contains three numbers whose product is a square. Also generalizations to partitions into more than two parts are discussed.
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].