The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
There are Infinitely Many Carmichael Numbers
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Approximate formulas for some functions of prime numbers
Rosser, J. B., & Schoenfeld, L. (1962) · Illinois Journal of Mathematics · doi:10.1215/ijm/1255631807 · Cited by 1,546
On Distinguishing Prime Numbers from Composite Numbers
Adleman, L. M., Pomerance, C., & Rumely, R. S. (1983) · The Annals of Mathematics · doi:10.2307/2006975 · Cited by 305
Self-citationA combinatorial problem on finite Abelian groups, I
Olson, J. E. (1969) · Journal of Number Theory · doi:10.1016/0022-314x(69)90021-3 · Cited by 290
The Carmichael Numbers up to 10 15
Pinch, R. G. E. (1993) · Mathematics of Computation · doi:10.1090/s0025-5718-1993-1202611-7 · Cited by 57
Diophantine problems in variables restricted to the values 0 and 1
Baker, R. C., & Schmidt, W. M. (1980) · Journal of Number Theory · doi:10.1016/0022-314x(80)90039-6 · Cited by 46
An uncertainty inequality and zero subsums
Meshulam, R. (1990) · Discrete Mathematics · doi:10.1016/0012-365x(90)90375-r · Cited by 40
A combinatorial problem on finite abelian groups, 3
Boas, P. V. E., & Kruyswijk, D. (1969) · Data Archiving and Networked Services (DANS) · Cited by 39
Cited by
Handbook of applied cryptography
(1997) · Choice Reviews Online · doi:10.5860/choice.34-4512 · Cited by 10,357
Elementary Methods in Number Theory
(2000) · Graduate Texts in Mathematics · doi:10.1007/b98870 · Cited by 305
Zero-sum problems in finite abelian groups: A survey
Gao, W., & Geroldinger, A. (2006) · Expositiones Mathematicae · doi:10.1016/j.exmath.2006.07.002 · Cited by 262
A generalization of the consecutive Davenport constant and the related inverse problem
Molla, M. I. (2026) · Proceedings - Mathematical Sciences · doi:10.1007/s12044-026-00856-7
Metadata
- Authors
- Alford, W. R., Granville, A., & Pomerance, C.
- Venue
- The Annals of Mathematics
- Publisher
- JSTOR
- Published
- 1994-05
- Volume
- 139
- Issue
- 3
- Pages
- 703
- ISSN
- 0003-486X (ISSN-L)
- OpenAlex
- W2330778380
- Cited by
- 333
- References
- 7
- FWCI
- 15.96
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.