Scribd
Upload
449 views17 pages

Wilsons Theorem

Wilson's theorem states that for any prime number p, (p-1)! + 1 is divisible by p. It was first conjectured by John Wilson and proved by Joseph Lagrange. For a prime p, (p-1)! is congruent to -1 modulo p. Wilson's theorem can be used to show that a composite number is not prime by checking if (p-1)! is congruent to 0 modulo p. Examples are provided to demonstrate Wilson's theorem for various prime numbers.

Uploaded by

Max Paine
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
449 views17 pages

Wilsons Theorem

Wilson's theorem states that for any prime number p, (p-1)! + 1 is divisible by p. It was first conjectured by John Wilson and proved by Joseph Lagrange. For a prime p, (p-1)! is congruent to -1 modulo p. Wilson's theorem can be used to show that a composite number is not prime by checking if (p-1)! is congruent to 0 modulo p. Examples are provided to demonstrate Wilson's theorem for various prime numbers.

Uploaded by

Max Paine
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/ 17

GROUP NUMBER 4

Some Special Congruences :


Wilson’s Theorem
Wilson’s Theorem

Wilson’s Theorem, in number


theory, theorem that any prime p
divides (p – 1)! + 1, where n! is the
factorial notation for 1 x 2 x 3 x 4
x … x n.
Wilson’s Theorem

For example,

5 divides (5 – 1)! + 1 = 25.


Wilson’s Theorem

The conjecture was first published


by the English Mathematician
Edward Waring.
Wilson’s Theorem

He stated that one of his students,


John Wilson, had discovered that
(p - 1)! + 1 is divisible by p
whenever p is prime.
Wilson’s Theorem
Wilson made this conjecture based
on numerical evidence.

For example,
2 divides 1! + 1 = 2
3 divides 2! + 1 = 3
Wilson’s Theorem

Joseph Lagrange proved this result


in 1771. Nevertheless, the fact
that p divides (p – 1) + 1 is known
as Wilson’s theorem.
Wilson’s Theorem

If p is prime,
then (p – 1)! ≡ – 1 ( mod p).
Wilson’s Theorem
Example,
Let p = 7.

We have,
(7 – 1)! = 6! = 1 x 2 x 3 x 4 x 5 x 6
Arrange the factors,
2 x 4 ≡ 1 (mod 7) and 3 x 5 ≡ 1 (mod 7)
Hence,
6! ≡ 1 x (2 x 4) x (3 x 5) x 6 ≡ 1 x 6 ≡ -1 (mod 7).
Wilson’s Theorem
Example 2,
Let p = 3

We have, (p – 1)! ≡ -1 (mod p)


(3 – 1)! ≡ 2!
2 x 1 ≡ 2
2 ≡ -1 (mod 3)
Wilson’s Theorem

Let p be a prime greater than 2. For each integer


a with 1 ≤ a ≤ p – 1 there is an inverse ā, 1 ≤ ā ≤
p – 1, with aā ≡ 1 (mod p)

Note: The only positive integers less than p that


that are their own inverses are 1 and p – 1.
Wilson’s Theorem

(p – 1)! ≡ (2 x ) … (1) (p – 1) (mod p)


≡ (1) (1) … (1) (p – 1 ) (mod p)
≡ p – 1 (mod p)
(p – 1)! ≡ -1 (mod p)
Wilson’s Theorem

Let p = 5

(5 – 1)! ≡ (2 x ) … (1) (5 – 1) (mod 5)


≡ (1) (1) (1) (1) (1) (1) (5 – 1 ) (mod 5)
≡ 5 – 1 (mod 5)
(5 – 1)! ≡ -1 (mod 5)
Wilson’s Theorem

Wilson’s theorem can be used to


demonstrate that a composite is not a
prime.
Wilson’s Theorem

Example,
Let p = 6
(p – 1)! ≡ 0 (mod p)
(6 – 1)! ≡ 5!
≡ 120 ≡ 0 (mod 6)
Wilson’s Theorem

Let p = 7
(p – 1)! ≡ 0 (mod p)
(7 – 1)! ≡ 6!
≡ 720 is not a prime since 7 ł 720

You might also like