Scribd
Upload
280 views

Pseudo Primes

Pseudoprimes are numbers that are not actually prime but satisfy some properties of prime numbers. They are classified based on which prime property they satisfy. The document then provides two propositions and examples for generating pseudoprimes for specific bases a by finding composite numbers n that satisfy an-1 ≡ 1 (mod n). It shows there are infinitely many pseudoprimes by constructing numbers n that are products of terms related to ap-1 and ap+1.

Uploaded by

yesha
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
280 views

Pseudo Primes

Pseudoprimes are numbers that are not actually prime but satisfy some properties of prime numbers. They are classified based on which prime property they satisfy. The document then provides two propositions and examples for generating pseudoprimes for specific bases a by finding composite numbers n that satisfy an-1 ≡ 1 (mod n). It shows there are infinitely many pseudoprimes by constructing numbers n that are products of terms related to ap-1 and ap+1.

Uploaded by

yesha
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 10

PSEUDOPRIMES

PSUEDOPRIMES

 isa probable prime (an integer that shares a


property common to all prime numbers) that is
not actually prime.

 are classified to which property of primes they


satisfy.
This theorem gives a possible way to detect primes, or more
exactly, non-primes: If for a certain a coprime to n, a n-1 is not
congruent to 1 mod n, then, by the theorem, n is not prime.

For a fixed a > 1, we write F(a) for the set of positive integers n
satisfying a n-1 ≡ 1 mod n. By Fermat’s theorem, F(a) includes all
primes that are not divisors of a. Also, if n ∈ F(a), then gcd (a,
n)=1, since, clearly, gcd(an-1, n) = 1. (This F(a) is not a standard
notation, but it will serve well for our purposes here.)

By an a-pseudoprime, or pseudoprime to the base a, we shall


mean any composite
number n belonging to F(a). The set of a-pseudoprimes will be
denoted by PS(a).
Finding some pseudoprimes

For larger values of a, there will always be trivial


examples of a-pseudoprimes. Indeed, any divisor n of a - 1
is in F (a), since a ≡ 1 mod n. So any composite divisor of a
- 1 is a-pseudoprime. (In yet another variation of the
definition, some writers require that n > a, thereby excluding
these cases).However, by considering divisors of am-1
instead of a-1, we obtain an instant method for generating
non-trivial pseudoprimes:
PROPOSITION 1. Suppose, for some m, that n divides am - 1
and n ≡ 1 mod m.
Then n ∈ F (a).

Proof. Then am ≡ 1 mod n, and n - 1 is a multiple of m. Hence


an-1 ≡ 1 mod n.

So we factorise am - 1 (for a chosen m) and look for any


composite divisors that are
congruent to 1 mod m. In particular, if p and q are prime factors
of am - 1, both congruent
to 1 mod m, then pq is such a divisor. Also, if p2 appears in the
factorisation, where p ≡ 1
mod m, then p2 is a divisor of the type wanted.
Note that when m is even (say m = 2k), the first step in the
factorisation is a2k - 1 = (ak + 1)(ak - 1). For now, we give two
examples with a = 2 and two with a = 3.

Example 1. We have 210 - 1 = (25 + 1)(25 - 1) = 33 × 31 = 3 ×


11 × 31. Both 11 and 31 are congruent to 1 mod 10, so 11 × 31 =
341 is 2-pseudoprime.
Example 2. We have 211 - 1 = 2047 = 23 × 89. Both 23 and 89
are congruent to 1 mod 11, so 23 × 89 is 2 pseudoprime.
Example 3. We have 35 - 1 = 242 = 2 × 112. Hence 112 = 121 is
3-pseudoprime.
Example 4. We have 36-1 = 26×28 = 23×7×13. Hence 7×13 = 91
is 3-pseudoprime.
PROPOSITION 2. Let a ≥ 2, and let p be any odd prime that
does not divide a2 - 1.
Let
n1 =ap –1 n2 =ap + 1
a–1 a+1
.
Then n = n1n2 is a-pseudoprime. So also are n1 and n2 if they
are composite. Hence there are infinitely many a-pseudoprimes.

Proof. By the geometric series, n1 = 1 + a + · · · + ap-1. This


shows that n1 is an integer, and also that it is odd (obvious if a is
even, and a sum of p odd numbers if a is odd).Similarly for n2.
So n is composite and odd. Also, n divides a2p - 1, so Proposition
1 will apply if we can show that n1 and n2 are congruent to 1 mod
2p. Now (a-1)(n1-1) = ap-a. By Fermat’s theorem, this is a
multiple of p. Since p does not divide a - 1, it must divide n1 - 1
(recall: if p is prime and divides xy, then it divides either x or y).
Since n1 - 1 is also even, it is a multiple of 2p, so n1 ≡ 1
mod 2p, as required. Similarly for n2.

Example 1 is n for a = 2, p = 5, and


Example 4 is n for a = 3, p = 3.
Example 2 is n1 for a = 2, p = 11 (similarly for any
composite “Mersenne number” 2p - 1).
Example 3 is n1 for a = 3, p = 5.

Prepared by: Bonganay


Gupio
Albarico

You might also like