On the least prime congruent to 1 modulo \(n\) (Q2340210)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the least prime congruent to 1 modulo \(n\) |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the least prime congruent to 1 modulo \(n\) |
scientific article |
Statements
On the least prime congruent to 1 modulo \(n\) (English)
0 references
16 April 2015
0 references
By a famous result of Dirichlet, there are infinitely many prime numbers which are congruent to \(1 \bmod n\).The main result of the author in this paper states that if \(n\) is prime such that \(n\geq 5\), then the smallest prime which is congruent to \(1 \bmod n\) is less than or equal to \((2^n + 1)/3\).
0 references
primes in progression
0 references
arithmetic progressions
0 references
