Mathematics – Number Theory
Scientific paper
2009-06-19
Rejecta Mathematica, 2(1):24-43, June 2011
Mathematics
Number Theory
I find the second conjecture (Conjecture 1.0.4) to be more plausible than the first (Corollary 1.0.3), since the latter contra
Scientific paper
Erd\H{o}s conjectured in 1956 that there are $x^{1-o(1)}$ Carmichael numbers up to $x$. Pomerance made this conjecture more precise and proposed that there are $x^{1-{\frac{\{1+o(1)\}\log\log\log x}{\log\log x}}}$ Carmichael numbers up to $x$. At the time, his data tables up to $25 \cdot 10^{9}$ appeared to support his conjecture. However, Pinch extended this data and showed that up to $10^{21}$, Pomerance's conjecture did not appear well-supported. Thus, the purpose of this paper is two-fold. First, we build upon the work of Pomerance and others to present an alternate conjecture regarding the distribution of Carmichael numbers that fits proven bounds and is better supported by Pinch's new data. Second, we provide another conjecture concerning the distribution of Carmichael numbers that sharpens Pomerance's heuristic arguments. We also extend and update counts pertaining to pseudoprimes and Carmichael numbers, and discuss the distribution of One-Parameter Quadratic-Base Test pseudoprimes.
No associations
LandOfFree
On the distribution of Carmichael numbers does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with On the distribution of Carmichael numbers, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the distribution of Carmichael numbers will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-400616