Michael Penk

Learn More
All primes less than 101000 of the form n\± 1 or 2 • 3 • 5 • • ■ p ± 1 are determined. Results of Brillhart, Lehmer, and Selfridge are used together with a fast algorithm that applies to primality tests of integers N for which many factors of N ± 1 are known. Let p% denote the product of all primes that are < p; for example 7# = 2 • 3 ■ 5 • 7 = 210. In this(More)
  • 1