The Primality of R1031

DOI10.2307/2008184MaRDI QIDQ3737483zbMATH OpenOpenAlexFDO

Authors Harvey Dubner, Hugh C. Williams

Publication date 1986

Published in Mathematics of Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2307/2008184

zbMATH Keywords

computational number theorymultiple-precision operationsprimalityrepunit numberspecial purpose microcomputer

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to number theory (11-04) Primes (11A41)

Recommendations

• Repunit \(\text{R}_{49081}\) is a probable prime
• The deceptive primes to 2 10⁷
• Fast Primality Tests for Numbers Less Than 50 ⋅10 9
• Factoring Repunits
• Some Primes of the Form (a n - 1)/(a - 1)

Cited in

(4)

• The deceptive primes to 2 10⁷
• Repunit \(\text{R}_{49081}\) is a probable prime
• Elliptic Curves and Primality Proving
• Some uses of microcomputers in number theory research

This page was built for publication: The Primality of R1031

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