AN APPLICATION OF HIGH-SPEED COMPUTING TO FERMAT'S LAST THEOREM

DOI10.1073/PNAS.40.1.25MaRDI QIDQ5825792zbMATH OpenOpenAlexWikidataFDO

Authors D. H. Lehmer, H. S. Vandiver, E. T. Lehmer

Publication date 1954

Published in Proceedings of the National Academy of Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1073/pnas.40.1.25

zbMATH Keywords

number theory

Cited in

(11)

• Fermat comes to America: Harry Schultz Vandiver and FLT (1914--1963).
• \(p\)-adic proofs of congruences for the Bernoulli numbers
• Irregular Primes and Cyclotomic Invariants to Four Million
• Irregular Primes and Cyclotomic Invariants
• Some recent results of number theory discovered with electronic computers
• Irregular primes to two billion
• WOLSTENHOLME TYPE THEOREM FOR MULTIPLE HARMONIC SUMS
• On the distribution of irregular primes
• Galois deformation rings and modularity in the residually reducible case
• The equation \(1^p+2^p+3^p+\ldots+n^p=m^q\)
• Number crunching vs. number theory: computers and FLT, from Kummer to SWAC (1850--1960), and beyond

This page was built for publication: AN APPLICATION OF HIGH-SPEED COMPUTING TO FERMAT'S LAST THEOREM

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