On the largest prime factor of the partition function of \(n\)

DOI10.1007/s11139-011-9346-6zbMath1286.11158OpenAlexW2078815166MaRDI QIDQ693027

Florian Luca

Publication date: 7 December 2012

Published in: The Ramanujan Journal (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11139-011-9346-6

zbMATH Keywords

partition functionlargest prime factor

Mathematics Subject Classification ID

Elementary theory of partitions (11P81) Distribution of integers with specified multiplicative constraints (11N25) Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05)

Related Items

A REMARK ON PRIME DIVISORS OF PARTITION FUNCTIONS

Cites Work

• Unnamed Item
• On divisors of Lucas and Lehmer numbers
• Multiplicative properties of the partition function
• Approximate formulas for some functions of prime numbers
• Existence of primitive divisors of Lucas and Lehmer numbers
• An explicit lower bound for a homogeneous rational linear form in the logarithms of algebraic numbers. II
• Arithmetic properties of Apéry numbers
• A lower bound for linear forms in logarithms
• Modular functions and transcendence questions
• A new proof of Szemerédi's theorem