The Problem of Sierpinski Concerning k ⋅2 n + 1

DOI10.2307/2007516zbMath0472.10008OpenAlexW4255506255MaRDI QIDQ3926666

Gordon V. Cormack, Robert Baillie, Hugh C. Williams

Publication date: 1981

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

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

zbMATH Keywords

large primessequences of composites

Mathematics Subject Classification ID

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

Related Items (2)

The influence of computers in the development of number theory ⋮ On integers of the form 𝑘2ⁿ+1

This page was built for publication: The Problem of Sierpinski Concerning k ⋅2 n + 1