Some uses of microcomputers in number theory research
From MaRDI portal
Publication:912884
DOI10.1016/0898-1221(90)90041-HzbMath0699.10001MaRDI QIDQ912884
Publication date: 1990
Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)
factorization of integers; Waring's problem; theory; primality testing; microcomputers; computational number; research in number theory
68Q25: Analysis of algorithms and problem complexity
11P05: Waring's problem and variants
11-02: Research exposition (monographs, survey articles) pertaining to number theory
11B83: Special sequences and polynomials
11-04: Software, source code, etc. for problems pertaining to number theory
11A41: Primes
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On distinguishing prime numbers from composite numbers
- Is \(\pi\) normal ?
- Discrete logarithms in \(\mathrm{GF}(p)\)
- Numerical investigation of Waring's problem for cubes
- Larger Carmichael numbers
- The influence of computers in the development of number theory
- Factorizations of 𝑏ⁿ±1, 𝑏=2, 3, 5, 6, 7, 10, 11, 12 Up to High Powers
- Disproof of the Mertens conjecture.
- A Monte Carlo Factoring Algorithm With Linear Storage
- Primality Testing and Jacobi Sums
- On the Zeros of the Riemann Zeta Function in the Critical Strip. IV
- The Primality of R1031
- Implementation of a new primality test
- The Multiple Polynomial Quadratic Sieve
- New Congruences for the Bernoulli Numbers
- A Pipeline Architecture for Factoring Large Integers with the Quadratic Sieve Algorithm
- A Method of Factoring and the Factorization of F 7
- The Schnirelmann Density of the Sums of Three Squares
- Counting Sums of Three Squares
- A Photo-Electric Number Sieve
- The Schnirelmann Density of the Squarefee Integers
- A Proof of the Seven Cube Theorem
- Rational approximations to algebraic numbers
