Square of Wieferich prime is Poulet number

From Number

Statement

Suppose p is a Wieferich prime, i.e., a prime number such that:

2p11(modp2)

Then, p2 is a Poulet number (also called Sarrus number), i.e., a Fermat pseudoprime to base 2.

Particular cases

There are only two known Wieferich primes: 1093 and 3511. Hence, this fact gives only two Poulet numbers: 10932=1194649 and 35112=12327121.

Proof

Given: p is a prime such that 2p11(modp2)

To prove: 2p211(modp2)

Proof: We have:

p21=(p1)(p+1)

Thus, p1 divides p21. This gives that:

2p112p211

Combining this with the given information, we get that 2p211(modp2).