A simplified proof of the partition formula

DOI10.1307/MMJ/1028998729MaRDI QIDQ775356zbMATH OpenOpenAlexFDO

Authors Donald J. Newman

Publication date 1962

Published in Michigan Mathematical Journal (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1307/mmj/1028998729

zbMATH Keywords

circle methodpartition functionproof of the Hardy-Ramanujan formula

Mathematics Subject Classification ID

Applications of the Hardy-Littlewood method (11P55) Analytic theory of partitions (11P82)

Recommendations

• A derivation of the Hardy-Ramanujan formula from an arithmetic formula
• Counting partitions on the abacus
• A Convergent Series for the Partition Function p ( n )
• On an elementary proof of some asymptotic formulas in the theory of partitions
• Short proof of Rademacher's formula for partitions

Cited in

(17)

• The expected number of parts in a partition of n
• Extremal problems for ordered hypergraphs: small patterns and some enumeration
• On the number of conjugate classes of derangements
• Operators without eigenvalues in finite-dimensional vector spaces
• Counting partitions on the abacus
• An effective bound for the partition function
• Hamiltonian coverings of some graphs
• A class of trees and its Wiener index
• Efficiency of polynomials on sequences
• A derivation of the Hardy-Ramanujan formula from an arithmetic formula
• The partition function revisited
• A Combinatorial Proof of a Partition Function Limit
• A Convergent Series for the Partition Function p ( n )
• Maximum entropy and integer partitions
• Superconformal quantum mechanics and growth of sheaf cohomology
• An Elementary Proof of a Theorem of Hardy and Ramanujan
• An elementary derivation of the asymptotics of partition functions

This page was built for publication: A simplified proof of the partition formula

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q775356)