[seqfan] Prime numbers with primitive base 2

[Tomasz Ordowski]

Dear number lovers!

Let's define:
Primes p such that 2^(p-x) == x (mod p) has the only solution x = 1.
5, 7, 13, 17, 19, 23, 41, 43, 67, 89, 101, 107, 113, 127, 131, 157, ...
An odd prime p is a term if and only if 2^n =/= -n (mod p) for every n <
p-1.
How to prove that there are infinitely many such prime numbers?

Best regards,

Tom Ordo
_______________
Cf. https://oeis.org/A001122
Primes with primitive root 2.