Large-scale computing in number theory

MaRDI QIDQ2878167zbMATH OpenFDO

Authors Herman te Riele

Publication date 28 August 2014

Published in Nieuw Archief voor Wiskunde. Vijfde Serie (Search for Journal in Brave)

Full work available at URL http://www.nieuwarchief.nl/serie5/pdf/naw5-2013-14-4-236.pdf

zbMATH Keywords

prime pairsprimes in arithmetic progressions

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to number theory (11-04) Nonreal zeros of (zeta (s)) and (L(s, chi)); Riemann and other hypotheses (11M26) Distribution of primes (11N05)

Review text

This is a very interesting paper on the use and success of large scale calculation in number theory over the last 40 years. To this end the author discusses five important subjects:NEWLINENEWLINE1. the search for perfect numbers and their generalizations,NEWLINENEWLINE2. prime factorization of very large numbers (cryptography!),NEWLINENEWLINE3. the Riemann hypothesis,NEWLINENEWLINE4. the Goldbach conjecture `and friends',NEWLINENEWLINE5. the Mertens conjecture.NEWLINENEWLINESpecifically, the 5th point discusses several results concerning this success, cf. [\textit{A. M. Odlyzko} and the author, J. Reine Angew. Math. 357, 138--160 (1985; Zbl 0544.10047)].

Cited in

(7)

• scientific article; zbMATH DE number 4162966 (Why is no real title available?)
• scientific article; zbMATH DE number 3990005 (Why is no real title available?)
• scientific article; zbMATH DE number 2154277 (Why is no real title available?)
• scientific article; zbMATH DE number 780070 (Why is no real title available?)
• scientific article; zbMATH DE number 780071 (Why is no real title available?)
• scientific article; zbMATH DE number 833673 (Why is no real title available?)
• Computers as a novel mathematical reality. III: Mersenne numbers and sums of divisors

This page was built for publication: Large-scale computing in number theory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2878167)