Codex Wiki
OurBigBook.com
Site
Source code
Dirichlet theorem on primes in arithmetic progressions
Home
Mathematics
Area of mathematics
Number theory
OurBigBook.com
Words: 10
If
g
cd
(
a
,
m
)
=
1
, infinitely many primes satisfy
p
≡
a
(
mod
m
)
.
(1)
Ancestors
(4)
Number theory
Area of mathematics
Mathematics
Home
Incoming links
(1)
Solution