There are Infinitely Many Carmichael Numbers

W. R. Alford, A. G., & Pomerance, C. (1994). There are Infinitely Many Carmichael Numbers.

Type

Unclassified

Intellectual base

Unclassified

Year

1994

DOI

10.2307/2118576

Link

https://doi.org/10.2307/2118576

Cited by

1 citation across 1 artifact.

Domain-specific

• Carmichael number
  • … instance directly demonstrates that n is composite, square-free, and every prime divisor p of n has p minus one dividing n minus one, equivalently the universal Fermat congruence holds. to An applied instance preserves the same invariant under a changed scale, notation, jurisdiction, dataset, or implementation..

Verification

This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.

Registry ID ref:e5fae5d5c583 · see in the full table