I got stuck with another divisibility problem. Prove that there exist infinitely many primes p that can be represented in the form $p=4k-1$, where k is a natural number, such that $2^q-1 \equiv 0 \pmod p$ for some prime q.
Divisibility problem with primes
2
$\begingroup$
elementary-number-theory
divisibility
prime-numbers