Prime Numbers and Computer Methods for Factorization

Riesel, H. (1994). Prime Numbers and Computer Methods for Factorization.

Type

Unclassified

Intellectual base

Unclassified

Year

1994

Link

no authoritative link yet

Cited by

1 citation across 1 artifact.

Domain-specific

• Carmichael number
  • A Carmichael number is a positive composite n such that b^n is congruent to b modulo n for every integer b; equivalently, b^(n-1) is congruent to one for every b coprime to n.

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:997e0b87fdea · see in the full table