# Is there a proof of infinitely many primes $p$ such that $2^p-1$ is composite

Are there infinitely many primes $p$ such that $2^p-1$ is composite? Can someone help with another possible case other than the one listed below? Thanks for help in advance.

If the prime $p \equiv 3 \bmod 4$ and $p$ is a Sophie Germain prime ($2p+1$ is also prime), then $2p+1$ divides $2^p-1$, and therefore not prime. From this there should be infinitely many primes $p$ such that $2^p-1$ is composite, but the problem is the infinitude of Sophie Germain primes remains unproven. Second, if the Sophie Germain primes were proven to be infinite, we would still need to prove there are inifnitely many $3\bmod 4$, then this can be a proof that there are infinitely many primes $p$ such that $2^p-1$ is composite. Is there an alternate solution to proving my question?

• To me, it is not clear what you are asking for. If there are infinite Sophie Germain primes, there are infinite composite numbers of the form $2^p-1$, that is a fact. However, both the infinitude of Sophie Germain primes and the infinitude of composite numbers of the form $2^p-1$ are open problems. Are you asking us a way to tackle an open problem among them? Sep 15, 2016 at 14:34
• I think you are right. I am aware of the theorem that for any odd prime p, 2 is a square modulo p if and only if p is congruent to 1 or 7 modulo 8. Mar 18, 2020 at 2:17