Access

You are not currently logged in.

Access your personal account or get JSTOR access through your library or other institution:

If You Use a Screen Reader

This content is available through Read Online (Free) program, which relies on page scans. Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.

On the Distribution of Pseudoprimes

Carl Pomerance
Mathematics of Computation
Vol. 37, No. 156 (Oct., 1981), pp. 587-593
DOI: 10.2307/2007448
Stable URL: http://www.jstor.org/stable/2007448
Page Count: 7
Preview not available

Abstract

Let $\mathscr{P}(x)$ denote the pseudoprime counting function. With $$L(x) = \exp\{\log x \log \log \log x/\log \log x\},$$ we prove $\mathscr{P}(x) \leqslant x \cdot L(x)^{-1/2}$ for large $x$, an improvement on the 1956 work of Erdös. We conjecture that $\mathscr{P}(x) = x \cdot L(x)^{-1 + o(1)}$.

• 587
• 588
• 589
• 590
• 591
• 592
• 593