MathDB

E 20

Source:

May 25, 2007

modular arithmeticnumber theory

Problem Statement

Verify that, for each

r \ge 1

, there are infinitely many primes

p

with

p \equiv 1 \; \pmod{2^r}