Open-access mathematical research insights
About Contact
Home / Erdos Problems / Problem #971

Problem #971: Let $p(a,d)$ be the least prime congruent to $a\pmod{d}$

Let $p(a,d)$ be the least prime congruent to $a\pmod{d}$. Does there exist a constant $c>0$ such that, for all large $d$,\[p(a,d) > (1+c)\phi(d)\log...

Problem Statement

Let $p(a,d)$ be the least prime congruent to $a\pmod{d}$. Does there exist a constant $c>0$ such that, for all large $d$,\[p(a,d) > (1+c)\phi(d)\log d\]for $\gg \phi(d)$ many values of $a$?
Categories: Number Theory

Progress

Erdős [Er49c] could prove this is true for an infinite sequence of $d$. He also proved that, for any $\epsilon>0$,\[p(a,d)< \epsilon \phi(d)\log d\]for $\gg_\epsilon \phi(d)$ many values of $a$.

Source: erdosproblems.com/971 | Last verified: January 19, 2026

Stay Updated

Get weekly digests of new research insights delivered to your inbox.