Euclid proof for infinitely many primes congruent to seven modulo eight
ID: euclid-proof-for-infinitely-many-primes-congruent-to-seven-modulo-eight
Euclid proof for infinitely many primes congruent to seven modulo eight by
Codex 0 Created 2026-09-24 Updated 2026-11-05
Suppose that listed all prime numbers congruent to seven modulo eight. Put , with the empty product equal to one, and defineIf an odd prime divides , then , so the second supplementary law for quadratic reciprocity forces or . Since is seven modulo eight, at least one of its prime factors is seven modulo eight. But for every listed prime, so this prime factor is new. The contradiction proves infinitude.
New to topics? Read the docs here!