Some uses of microcomputers in number theory research
type: Item
instance of: scholarly article
title: Some uses of microcomputers in number theory research
zbMATH Open document ID: 0699.10001
DOI: 10.1016/0898-1221(90)90041-H
publication date: 1990-01-01T00:00:00Z
Mathematics Subject Classification ID: 11-04
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 11A41
Mathematics Subject Classification ID: 11P05
Mathematics Subject Classification ID: 11-02
Mathematics Subject Classification ID: 11B83
zbMATH DE Number: 4145975
zbMATH Keywords: factorization of integers
zbMATH Keywords: primality testing
zbMATH Keywords: computational number
zbMATH Keywords: theory
zbMATH Keywords: microcomputers
zbMATH Keywords: research in number theory
zbMATH Keywords: Waring's problem
author: Samuel S. jun. Wagstaff
describes a project that uses: CFRAC
MaRDI profile type: Publication
cites work: The influence of computers in the development of number theory
cites work: New Congruences for the Bernoulli Numbers
cites work: Q3737488
cites work: On the Zeros of the Riemann Zeta Function in the Critical Strip. IV
cites work: Factorizations of 𝑏ⁿ±1, 𝑏=2, 3, 5, 6, 7, 10, 11, 12 Up to High Powers
cites work: A Method of Factoring and the Factorization of F 7
cites work: Q4745878
cites work: Q3220644
cites work: The Multiple Polynomial Quadratic Sieve
cites work: A Monte Carlo Factoring Algorithm With Linear Storage
cites work: Discrete logarithms in \(\mathrm{GF}(p)\)
cites work: Q3726006
cites work: A Photo-Electric Number Sieve
cites work: A Pipeline Architecture for Factoring Large Integers with the Quadratic Sieve Algorithm
cites work: Q3935355
cites work: Q3773945
cites work: Primality Testing and Jacobi Sums
cites work: On distinguishing prime numbers from composite numbers
cites work: Implementation of a new primality test
cites work: The Primality of R1031
cites work: Larger Carmichael numbers
cites work: Disproof of the Mertens conjecture.
cites work: Is \(\pi\) normal ?
cites work: Numerical investigation of Waring's problem for cubes
cites work: Q5844333
cites work: A Proof of the Seven Cube Theorem
cites work: Rational approximations to algebraic numbers
cites work: Q5646971
cites work: The Schnirelmann Density of the Squarefee Integers
cites work: The Schnirelmann Density of the Sums of Three Squares
cites work: Counting Sums of Three Squares
full work available at URL: 0898-1221(90)90041-h
OpenAlex ID: W2008925134
published in: Computers & Mathematics with Applications
Recommended article: Q3677829
Recommended article: Q5583162
Recommended article: Q3490058
Recommended article: Q3781156
Recommended article: On the use of computer technology in the study of the discipline «Numbers theory»
Recommended article: A computer approach to number theory
Recommended article: Q4777363
Recommended article: Some computational experiments in number theory
Recommended article: Q3783347
description: scientific article; zbMATH DE number 4145975