Highly composite numbers. Annotated by Jean-Louis Nicolas and Guy Robin
From MaRDI portal
Publication:1127608
DOI10.1023/A:1009764017495zbMath0917.11043OpenAlexW126940454MaRDI QIDQ1127608
Publication date: 29 November 1998
Published in: The Ramanujan Journal (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1009764017495
History of mathematics in the 20th century (01A60) History of number theory (11-03) Nonreal zeros of (zeta (s)) and (L(s, chi)); Riemann and other hypotheses (11M26) Distribution of integers with specified multiplicative constraints (11N25) Rate of growth of arithmetic functions (11N56)
Related Items (27)
Small values of signed harmonic sums ⋮ Chebyshev's bias for Ramanujan's \(\tau\)-function via the deep Riemann hypothesis ⋮ The sum of divisors function and the Riemann hypothesis ⋮ Unnamed Item ⋮ Two-sided estimates for the number of fixed points of a discrete logarithm ⋮ On SA, CA, and GA numbers ⋮ EULER PRODUCT ASYMPTOTICS FOR DIRICHLET -FUNCTIONS ⋮ Euler products of Selberg zeta functions in the critical strip ⋮ A NEW UPPER BOUND FOR THE SUM OF DIVISORS FUNCTION ⋮ The Riemann hypothesis and an upper bound of the divisor function for odd integers ⋮ Large values of an additive function linked with generalized divisors of an integer ⋮ Classical geometry from the tensionless string ⋮ On Robin's inequality ⋮ On Robin's criterion for the Riemann hypothesis ⋮ The largest prime factor of Landau's function ⋮ Large values of the function \(\sigma (n)/\sigma ^{*}(n)\) ⋮ Robin's inequality for new families of integers ⋮ On the number of factorizations of polynomials over finite fields ⋮ Existence of unimodular triangulations — positive results ⋮ THE MAXIMAL ORDER OF ITERATED MULTIPLICATIVE FUNCTIONS ⋮ Landau's function for one million billions ⋮ Highly composite numbers and the Riemann hypothesis ⋮ Ramanujan's theorem and highest abundant numbers ⋮ Euler’s constant: Euler’s work and modern developments ⋮ Some open questions ⋮ Constructing Carmichael numbers through improved subset-product algorithms ⋮ New results for witnesses of Robin’s criterion
This page was built for publication: Highly composite numbers. Annotated by Jean-Louis Nicolas and Guy Robin
