Highly composite numbers. Annotated by Jean-Louis Nicolas and Guy Robin

From MaRDI portal
Revision as of 04:05, 31 January 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:1127608

DOI10.1023/A:1009764017495zbMath0917.11043OpenAlexW126940454MaRDI QIDQ1127608

Srinivasa Ramanujan

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




Related Items

Small values of signed harmonic sumsChebyshev's bias for Ramanujan's \(\tau\)-function via the deep Riemann hypothesisThe sum of divisors function and the Riemann hypothesisUnnamed ItemTwo-sided estimates for the number of fixed points of a discrete logarithmOn SA, CA, and GA numbersEULER PRODUCT ASYMPTOTICS FOR DIRICHLET -FUNCTIONSEuler products of Selberg zeta functions in the critical stripA NEW UPPER BOUND FOR THE SUM OF DIVISORS FUNCTIONThe Riemann hypothesis and an upper bound of the divisor function for odd integersLarge values of an additive function linked with generalized divisors of an integerClassical geometry from the tensionless stringOn Robin's inequalityOn Robin's criterion for the Riemann hypothesisThe largest prime factor of Landau's functionLarge values of the function \(\sigma (n)/\sigma ^{*}(n)\)Robin's inequality for new families of integersOn the number of factorizations of polynomials over finite fieldsExistence of unimodular triangulations — positive resultsTHE MAXIMAL ORDER OF ITERATED MULTIPLICATIVE FUNCTIONSLandau's function for one million billionsHighly composite numbers and the Riemann hypothesisRamanujan's theorem and highest abundant numbersEuler’s constant: Euler’s work and modern developmentsSome open questionsConstructing Carmichael numbers through improved subset-product algorithmsNew results for witnesses of Robin’s criterion