Square of Wieferich prime is Poulet number: Difference between revisions

From Number
(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...")
 
No edit summary
 
Line 6: Line 6:


Then, <math>p^2</math> is a [[fact about::Poulet number]] (also called Sarrus number), i.e., a [[Fermat pseudoprime]] to base 2.
Then, <math>p^2</math> is a [[fact about::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: <math>1093^2 = 1194649</math> and <math>3511^2 = 12327121</math>.


==Proof==
==Proof==

Latest revision as of 19:56, 2 January 2012

Statement

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

Then, 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: and .

Proof

Given: is a prime such that

To prove:

Proof: We have:

Thus, divides . This gives that:

Combining this with the given information, we get that .