On the largest prime factor of the partition function of n
From MaRDI portal
Publication:693027
DOI10.1007/S11139-011-9346-6zbMATH Open1286.11158OpenAlexW2078815166MaRDI QIDQ693027FDOQ693027
Authors: 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
Recommendations
Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05) Distribution of integers with specified multiplicative constraints (11N25) Elementary theory of partitions (11P81)
Cites Work
- Existence of primitive divisors of Lucas and Lehmer numbers (with an appendix by M. Mignotte)
- Title not available (Why is that?)
- A new proof of Szemerédi's theorem
- Approximate formulas for some functions of prime numbers
- A lower bound for linear forms in logarithms
- Modular functions and transcendence questions
- Arithmetic properties of Apéry numbers
- On divisors of Lucas and Lehmer numbers
- Multiplicative properties of the partition function
- An explicit lower bound for a homogeneous rational linear form in logarithms of algebraic numbers. II
Cited In (5)
This page was built for publication: On the largest prime factor of the partition function of \(n\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q693027)