The influence of computers in the development of number theory

DOI10.1016/0898-1221(82)90026-8MaRDI QIDQ1164656zbMATH OpenOpenAlexFDO

Authors Hugh C. Williams

Publication date 1982

Published in Computers & Mathematics with Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0898-1221(82)90026-8

zbMATH Keywords

Abel's problemalgebraic number theoryBibliographybibliographycomputers in number theorydevelopment of number theorydiophantine equationsfactoringFermat's last theoremprimality testingRiemann hypothesisSyracuse problemtwin prime conjecture

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to number theory (11-02) History of number theory (11-03) Software, source code, etc. for problems pertaining to number theory (11-04) Primes (11A41) Radix representation; digital problems (11A63) Higher degree equations; Fermat's equation (11D41) (zeta (s)) and (L(s, chi)) (11M06) Distribution of primes (11N05) Iwasawa theory (11R23) Units and factorization (11R27) Software, source code, etc. for problems pertaining to field theory (12-04) Analysis of algorithms and problem complexity (68Q25)

Cites work

• 12,758
• A Counterexample to Euler's Sum of Powers Conjecture
• A Lower Bound for the Set of Odd Perfect Numbers
• A method for obtaining digital signatures and public-key cryptosystems
• A Method of Factoring and the Factorization of F 7
• A modification of the RSA public-key encryption procedure (Corresp.)
• A monte carlo method for factorization
• A Note on Class-Number One in Pure Cubic Field
• A stopping time problem on the positive integers
• An Effective Number Geometric Method of Computing the Fundamental Units of an Algebraic Number Field
• Asymptotically Fast Factorization of Integers
• Calculation of the Regulator of Q(√D) by use of the Nearest Integer Continued Fraction Algorithm
• Computational problems, methods, and results in algebraic number theory
• Evaluation of Artin's Constant and the Twin-Prime Constant
• Every Prime Has a Succinct Certificate
• Factorization of the Eighth Fermat Number
• Fibonacci Series Modulo m
• Four Large Amicable Pairs
• scientific article; zbMATH DE number 3646980 (Why is no real title available?)
• scientific article; zbMATH DE number 3654208 (Why is no real title available?)
• scientific article; zbMATH DE number 3659688 (Why is no real title available?)
• scientific article; zbMATH DE number 3743343 (Why is no real title available?)
• scientific article; zbMATH DE number 3750146 (Why is no real title available?)
• scientific article; zbMATH DE number 3460351 (Why is no real title available?)
• scientific article; zbMATH DE number 3465380 (Why is no real title available?)
• scientific article; zbMATH DE number 3492781 (Why is no real title available?)
• scientific article; zbMATH DE number 3522065 (Why is no real title available?)
• scientific article; zbMATH DE number 3520475 (Why is no real title available?)
• scientific article; zbMATH DE number 3528292 (Why is no real title available?)
• scientific article; zbMATH DE number 3552620 (Why is no real title available?)
• scientific article; zbMATH DE number 3556213 (Why is no real title available?)
• scientific article; zbMATH DE number 3572255 (Why is no real title available?)
• scientific article; zbMATH DE number 3616509 (Why is no real title available?)
• scientific article; zbMATH DE number 3630832 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 3637954 (Why is no real title available?)
• scientific article; zbMATH DE number 1954367 (Why is no real title available?)
• scientific article; zbMATH DE number 3344628 (Why is no real title available?)
• Irregularities in the Distribution of Primes and Twin Primes
• Machine Proof of a Theorem on Cubic Residues
• New Primality Criteria and Factorizations of 2 m ± 1
• On a Method of Solving a Class of Diophantine Equations
• On computing fundamental units
• On distinguishing prime numbers from composite numbers
• On Fermat's Quotient, Base Two
• On Square Fibonacci Numbers
• On the "3x + 1" Problem
• On the Non-Existence of Fibonacci Squares
• On the Zeros of the Riemann Zeta Function in the Critical Strip
• Probabilistic algorithm for testing primality
• Recent developments in primality testing
• Sharper Bounds for the Chebyshev Functions θ(x) and ψ(x)
• Sharper Bounds for the Chebyshev Functions θ(x) and ψ(x). II
• Six New Factors of Fermat Numbers
• Some Factorizations of 2 n ± 1 and Related Results
• Some Results Concerning Voronoi's Continued Fraction Over (√[3]D)
• Some Very Large Primes of the Form k ⋅2 m + 1
• Succinct Proofs of Primality for the Factors of Some Fermat Numbers
• THE EQUATIONS 3x²−2 = y² AND 8x²−7 = z²
• The First Occurrence of Large Gaps Between Successive Primes
• The Ideal Waring Theorem for Exponents 401-200,000
• The Irregular Primes to 125000
• The Problem of Sierpinski Concerning k ⋅2 n + 1
• The Pseudoprimes to 25 ⋅10 9

Cited in

(3)

• A search for Fibonacci-Wieferich and Wolstenholme primes
• A search for Wieferich and Wilson primes
• Some uses of microcomputers in number theory research

This page was built for publication: The influence of computers in the development of number theory

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