The largest prime factor of Landau's function
type: Item
instance of: scholarly article
title: The largest prime factor of Landau's function
zbMATH Open document ID: 1276.11157
published in: The Ramanujan Journal
publication date: 2012-02-13T00:00:00Z
review text: Let \(g(n)\) denote the maximal order of an element in the symmetric group \(S_n\) on \(n\) letters. \textit{E. Landau} [Arch. Math. Phys. (3) 5, 92--103 (1903; JFM 34.0233.02)] proved that \(\log g(n)\sim\sqrt{n\log n}\) as \(n\to\infty\). Let \(P^+(g(n))\) denote the largest prime divisor of \(g(n)\). \textit{J.-L. Nicolas} [Acta Arith. 14, 315--332 (1968; Zbl 0179.34804)] proved that \(P^+(g(n))\sim\log g(n)\sim\sqrt{n\log n}\) as \(n\to\infty\). In the paper under review, the authors obtain the following estimates for \[ H(n)= P^+(g(n))/\sqrt{n\log n}. \] For \(n\geq 4\), \(H(n)\leq H(215)= 1.26542463,\dots\) with equality only for \(n= 215\) (Th. 5.1). For \(n\geq 2\), \(H(n)\leq 1+{\log\log n+10.8\over 2\log n}\) (Th. 8.1). For \(n\geq 133\), \(H(n)\geq 1+{\log\log n-2.27\over 2\log n}\); further for \(N\geq 1755\), \(H(n)\geq 1\) (Th. 9.1). The authors also give bounds for \(P^+(g(n))- \sqrt{Li^{-1}(n)}\) (Ths. 7.1 and 9.2). The proof of Theorem 10.1 shows that \[ P^+(g(n))- \log g(n)= \Omega_{\pm}(n^{1/4}(\log n)^{1/4}\log\log\log n). \]
reviewed by: Mihály Szalay
Mathematics Subject Classification ID: 11N37
Mathematics Subject Classification ID: 11N05
Mathematics Subject Classification ID: 11A25
Mathematics Subject Classification ID: 11N45
Mathematics Subject Classification ID: 20B30
zbMATH DE Number: 6006055
zbMATH Keywords: maximal order
zbMATH Keywords: symmetric group
zbMATH Keywords: distribution of primes
zbMATH Keywords: Landau's function
author: Marc Deléglise
author: Jean-Louis Nicolas
MaRDI profile type: Publication
full work available at URL: s11139-011-9293-2
OpenAlex ID: W1973298275
cites work: The difference between consecutive primes. II
cites work: Landau's function for one million billions
cites work: The 𝑘^{𝑡ℎ} prime is greater than 𝑘(ln𝑘+lnln𝑘-1) for 𝑘≥2
cites work: The Largest Prime Dividing the Maximal Order of an Element of S n
cites work: Q3998724
cites work: Majoration explicite de l'ordre maximum d'un élément du groupe symétrique
cites work: Évaluation asymptotique de l'ordre maximum d'un élément du groupe symétrique
cites work: Effective Bounds for the Maximal Order of an Element in the Symmetric Group
cites work: The Maximum Order of an Element of a Finite Symmetric Group
cites work: New maximal prime gaps and first occurrences
cites work: Q5580252
cites work: Ordre maximal d'un élément du groupe $S_n$ des permutations et «highly composite numbers»
cites work: Q5597644
cites work: Highly composite numbers. Annotated by Jean-Louis Nicolas and Guy Robin
cites work: Short effective intervals containing primes
cites work: Approximate formulas for some functions of prime numbers
cites work: Sharper Bounds for the Chebyshev Functions θ(x) and ψ(x). II
cites work: Q5776164
cites work: On the maximal order in $S_n$ and $S*_n$
DOI: 10.1007/S11139-011-9293-2
Recommended article: On the largest prime factor of the partition function of n
Recommended article: On the largest prime factor of the partition function of \(n\)
Recommended article: Q3784147
Recommended article: On the largest prime factor of integers
Recommended article: On the largest prime factor of an integer
Recommended article: Exponential sums involving the largest prime factor function
Recommended article: Distributional properties of the largest prime factor
Recommended article: Q4837016
Recommended article: Q5043572
Recommended article: On a thin set of integers involving the largest prime factor function
description: scientific article; zbMATH DE number 6006055