
I'm interested in the following two complementary questions:
Are there an infinite number of primes $p$ such that there exists some $1\le n < p$ with $2^n \equiv 3 \bmod p$?
Are there an infinite number of primes $p$ such that for all $1\le n < p$, $2^n \not\equiv 3\bmod p$?
A resolution to Art...