On the Distributions of Pseudoprimes, Carmichael Numbers, and Strong Pseudoprimes
نویسنده
چکیده
Building upon the work of Carl Pomerance and others, the central purpose of this discourse is to discuss the distribution of base-2 pseudoprimes, as well as improve upon Pomerance's conjecture regarding the Carmichael number counting function [8]. All conjectured formulas apply to any base b ≥ 2 for x ≥ x0(b). A table of base-2 pseudoprime, 2-strong pseudoprime, and Carmichael number counts up to 1015 from [4] is included in the Appendix. We also discuss strong pseudoprimes and probabilistic primality testing.
منابع مشابه
The Pseudoprimes to 25 • 109
The odd composite n < 25 • 10 such that 2n_1 = 1 (mod n) have been determined and their distribution tabulated. We investigate the properties of three special types of pseudoprimes: Euler pseudoprimes, strong pseudoprimes, and Carmichael numbers. The theoretical upper bound and the heuristic lower bound due to Erdös for the counting function of the Carmichael numbers are both sharpened. Several...
متن کاملNotes on some new kinds of pseudoprimes
J. Browkin defined in his recent paper (Math. Comp. 73 (2004), pp. 1031–1037) some new kinds of pseudoprimes, called Sylow p-pseudoprimes and elementary Abelian p-pseudoprimes. He gave examples of strong pseudoprimes to many bases which are not Sylow p-pseudoprime to two bases only, where p = 2 or 3. In this paper, in contrast to Browkin’s examples, we give facts and examples which are unfavora...
متن کاملThere are Infinitely Many Perrin Pseudoprimes
This paper proves the existence of infinitely many Perrin pseudoprimes, as conjectured by Adams and Shanks in 1982. The theorem proven covers a general class of pseudoprimes based on recurrence sequences. The result uses ingredients of the proof of the infinitude of Carmichael numbers, along with zero-density estimates for Hecke L-functions.
متن کاملThe Distribution of Pseudoprimes
The RSA crypto-system relies on the availability of very large prime numbers. Tests for finding these large primes can be categorized as deterministic and probabilistic. Deterministic tests, such as the Sieve of Erastothenes, offer a 100 percent assurance that the number tested and passed as prime is actually prime. Despite their refusal to err, deterministic tests are generally not used to fin...
متن کامل