Results 1  10
of
10
Carmichael Numbers of the form (6m + 1)(12m + 1)(18m + 1)
, 2002
"... Numbers of the form (6m + 1)(12m + 1)(18m + 1) where all three factors are simultaneously prime are the best known examples of Carmichael numbers. In this paper we tabulate the counts of such numbers up to 10 for each n 42. We also derive a function for estimating these counts that is remarkably ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
Numbers of the form (6m + 1)(12m + 1)(18m + 1) where all three factors are simultaneously prime are the best known examples of Carmichael numbers. In this paper we tabulate the counts of such numbers up to 10 for each n 42. We also derive a function for estimating these counts that is remarkably accurate.
Uniform distribution of fractional parts related to pseudoprimes
, 2005
"... We estimate exponential sums with the Fermatlike quotients fg(n) = gn−1 − 1 n and hg(n) = gn−1 − 1 P(n) where g and n are positive integers, n is composite, and P(n) is the largest prime factor of n. Clearly, both fg(n) and hg(n) are integers if n is a Fermat pseudoprime to base g, and if n is a ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
We estimate exponential sums with the Fermatlike quotients fg(n) = gn−1 − 1 n and hg(n) = gn−1 − 1 P(n) where g and n are positive integers, n is composite, and P(n) is the largest prime factor of n. Clearly, both fg(n) and hg(n) are integers if n is a Fermat pseudoprime to base g, and if n is a Carmichael number this is true for all g coprime to n. Nevertheless, our bounds imply that the fractional parts {fg(n)} and {hg(n)} are uniformly distributed, on average over g for fg(n), and individually for hg(n). We also obtain similar results with the functions ˜ fg(n) = gfg(n) and ˜ hg(n) = ghg(n). AMS Subject Classification: 11L07, 11N37, 11N60 1
Theorem
"... in celebration of his Sixtieth Birthday Let d be a squarefree integer, which may be positive or negative, and let h(−d) be the class number of Q ( √ −d). In this paper we investigate the frequency of values of d for which 3h(−d). It follows from conjectures of Cohen and Lenstra [3], that asymptot ..."
Abstract
 Add to MetaCart
in celebration of his Sixtieth Birthday Let d be a squarefree integer, which may be positive or negative, and let h(−d) be the class number of Q ( √ −d). In this paper we investigate the frequency of values of d for which 3h(−d). It follows from conjectures of Cohen and Lenstra [3], that asymptotically a constant proportion of values of d have this property. The conjectured proportion is different for positive and negative d, being 1 − (1 − 3 −j) j=1 in the case of imaginary quadratics, for example. It follows from the work of Davenport and Heilbronn [5] that a positive proportion of d have 3 ∤ h(−d), both in the case of d positive and d negative. However it remains an open problem whether or not the same is true for values with 3h(−d). Write N−(X) for the number of positive squarefree d ≤ X for which 3h(−d), and similarly let N+(X) be the number of positive squarefree d ≤ X for which 3h(d). It was shown by Ankeny and Chowla [1] that N−(X) tends to infinity with X, and in fact their method yields N−(X) ≫ X 1/2. The best known result in this direction is that due to Soundararajan [7], who shows that N−(X) ≫ε X 7/8−ε, for any positive ε. In the case of real quadratic fields it was shown by Byeon and Koh [2] how Soundararajan’s analysis can be adapted to prove N+(X) ≫ε X 7/8−ε. The purpose of this note is to present a small improvement on these results, as follows.
Notes by G.J.O. Jameson
"... Recall that Fermat’s “little theorem ” says that if p is prime and a is not a multiple of p, then ap−1 ≡ 1 mod p. This theorem gives a possible way to detect primes, or more exactly, nonprimes: if for some positive a ≤ n − 1, an−1 is not congruent to 1 mod n, then, by the theorem, n is ..."
Abstract
 Add to MetaCart
Recall that Fermat’s “little theorem ” says that if p is prime and a is not a multiple of p, then ap−1 ≡ 1 mod p. This theorem gives a possible way to detect primes, or more exactly, nonprimes: if for some positive a ≤ n − 1, an−1 is not congruent to 1 mod n, then, by the theorem, n is
NEW POLYNOMIALS PRODUCING ABSOLUTE PSEUDOPRIMES WITH ANY NUMBER OF PRIME FACTORS
, 2007
"... Abstract. In this paper, we introduce a certain method to construct polynomials producing many absolute pseudoprimes. By this method, we give new polynomials producing absolute pseudoprimes with any fixed number of prime factors which can be viewed as a generalization of Chernick’s result. By the si ..."
Abstract
 Add to MetaCart
Abstract. In this paper, we introduce a certain method to construct polynomials producing many absolute pseudoprimes. By this method, we give new polynomials producing absolute pseudoprimes with any fixed number of prime factors which can be viewed as a generalization of Chernick’s result. By the similar method, we give another type of polynomials producing many absolute pseudoprimes. As concrete examples, we tabulate the counts of such numbers of our forms. 1.
On the Distributions of Pseudoprimes, Carmichael Numbers, and
, 2009
"... Building upon the work of Carl Pomerance and others, the central purpose of this discourse is to discuss the distribution of base2 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 ..."
Abstract
 Add to MetaCart
Building upon the work of Carl Pomerance and others, the central purpose of this discourse is to discuss the distribution of base2 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 base2 pseudoprime, 2strong pseudoprime, and Carmichael number counts up to 10 15 from [4] is included in the Appendix. We also discuss strong pseudoprimes and probabilistic primality testing. 1
POSITIVE INTEGERS n SUCH THAT na σ(n) − 1
"... Abstract. For a positive integer n let σ(n) be the sum of divisors function of n. In this note, we fix a positive integer a and we investigate the positive integers n such that na σ(n) − 1. We also show that under a plausible hypothesis related to the distribution of prime numbers there exist infi ..."
Abstract
 Add to MetaCart
Abstract. For a positive integer n let σ(n) be the sum of divisors function of n. In this note, we fix a positive integer a and we investigate the positive integers n such that na σ(n) − 1. We also show that under a plausible hypothesis related to the distribution of prime numbers there exist infinitely many positive integers n such that na σ(n) − 1 holds for all integers a coprime to n.