Large-scale computing in number theory (Q2878167)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6335612
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Large-scale computing in number theory |
scientific article; zbMATH DE number 6335612 |
Statements
28 August 2014
0 references
prime pairs
0 references
primes in arithmetic progressions
0 references
Large-scale computing in number theory (English)
0 references
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)].
0 references
