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.
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.
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.
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.
Download as PPTX, PDF, TXT or read online from Scribd
Download as pptx, pdf, or txt
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
