On the largest prime factor of the partition function of n
Let p(n) be the function that counts the number of partitions of n. For a positive integer m, let P(m) be the largest prime factor of m. Here, we show that P(p(n)) tends to infinity when n tends to infinity through some set of asymptotic density 1. In fact, we show that the inequality P(p(n))>loglogloglogloglogn holds for almost all positive integers n. Features of the proof are the first term in Rademacher’s formula for p(n), Gowers’ effective version of Szemerédi’s theorem, and a classical lower bound for a nonzero homogeneous linear form in logarithms of algebraic numbers due to Matveev.
KeywordsPartition function Largest prime factor
Mathematics Subject Classification (2000)11P99 11A05
Unable to display preview. Download preview PDF.
- 6.Matveev, E.M.: An explicit lower bound for a homogeneous rational linear form in logarithms of algebraic numbers, II. Izv. Akad. Nauk SSSR, Ser. Mat. 64, 125–180 (2000) (Russian); translation in Izv. Math. 64 1217–1269 (2000) Google Scholar
- 10.Stewart, C.L.: On divisors of Lucas and Lehmer numbers. Preprint (2010) Google Scholar