Solved and unsolved problems in number theory
Solved and unsolved problems in number theory
FFTs in external or hierarchical memory
The Journal of Supercomputing
Numerical recipes in C (2nd ed.): the art of scientific computing
Numerical recipes in C (2nd ed.): the art of scientific computing
On the primality of n!±1 and 2˙3˙5&cdots;p±1
Mathematics of Computation
A course in computational algebraic number theory
A course in computational algebraic number theory
Mathematics of Computation
Topics in advanced scientific computation
Topics in advanced scientific computation
Mathematics of Computation
Algorithmic number theory
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
Factors of generalized Fermat numbers
Mathematics of Computation
The kth prime is greater than k(lnk + ln lnk - 1) for k ≥ 2
Mathematics of Computation
New Fibonacci and Lucas primes
Mathematics of Computation
| Hi-index | 0.00 |
For each prime p, let p# be the product of the primes less than or equal to p. We have greatly extended the range for which the primality of n! ± 1 and p# ± 1 are known and have found two new primes of the first form (6380! + 1, 6917! - 1) and one of the second (42209# + 1). We supply heuristic estimates on the expected number of such primes and compare these estimates to the number actually found.