Name
Abstract | ||
|---|---|---|
It is known that there are infinitely many primes congruent to 1 (mod n) for any integer n > 1. In this paper, we use an elementary argument to prove that the least such prime is at most 2(phi(n)+1) - 1, where phi is the Euler totient function. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.4169/amer.math.monthly.118.08.737 | AMERICAN MATHEMATICAL MONTHLY |
Field | DocType | Volume |
Fibonacci prime,Integer,Prime (order theory),Combinatorics,Algebra,Multiplicative group of integers modulo n,Modulo,Congruence (geometry),Mathematics,Euler's totient function | Journal | 118 |
Issue | ISSN | Citations |
8 | 0002-9890 | 0 |
PageRank | References | Authors |
0.34 | 1 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| R. Thangadurai | 1 | 5 | 3.78 |
| A. Vatwani | 2 | 0 | 0.34 |