The influence of computers in the development of number theory

DOI10.1016/0898-1221(82)90026-8zbMath0486.10001OpenAlexW2044840419MaRDI QIDQ1164656

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

bibliographyBibliographyFermat's last theoremRiemann hypothesisdiophantine equationsfactoringalgebraic number theorytwin prime conjectureprimality testingSyracuse problemAbel's problemcomputers in number theorydevelopment of number theory

Mathematics Subject Classification ID

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

Related Items (3)

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

Cites Work

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

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