Riemann's Hypothesis and Tests for Primality

Miller, G. L. (1976). Riemann's Hypothesis and Tests for Primality. Proceedings of seventh annual ACM symposium on Theory of computing - STOC '75.

Type

Conference paper

Intellectual base

Primary research

Year

1976

DOI

10.1145/800116.803773

DOI registrant

Association for Computing Machinery

Link

https://doi.org/10.1145/800116.803773

Cited by

1 citation across 1 artifact.

Domain-specific

• Miller–Rabin primality test
  • For odd n, the test writes n−1=2ˢd with d odd and checks whether aᵈ or a successive square reaches the residues required of primes; a violating base proves compositeness.

Verification

Does it exist? Confirmed. This work's DOI resolves to a registered record, which fixes its identity. That is all it fixes.

Does it back the claim? Not recorded. The single citation of this work carries no recorded support check.

Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.

See how references were verified.

Registry ID ref:1c7901567b13 · see in the full table