Square of Wieferich prime is Poulet number

From Number
Revision as of 19:55, 2 January 2012 by Vipul (talk | contribs) (Created page with "==Statement== Suppose <math>p</math> is a fact about::Wieferich prime, i.e., a prime number such that: <math>2^{p-1} \equiv 1 \pmod{p^2}</math> Then, <math>p^2</mat...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

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.

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).