Wilson's Theorem

Questions involving Wilson's Theorem to test primality or find factorial values modulo primes.

1 questions · Hard +2.3

Sort by: Default | Easiest first | Hardest first
OCR Further Additional Pure 2019 June Q8
11 marks Hard +2.3
8 In this question you must show detailed reasoning.
  1. Prove that \(2 ( p - 2 ) ^ { p - 2 } \equiv - 1 ( \bmod p )\), where \(p\) is an odd prime.
  2. Find two odd prime factors of the number \(N = 2 \times 34 ^ { 34 } - 2 ^ { 15 }\). \section*{END OF QUESTION PAPER} \section*{OCR
    Oxford Cambridge and RSA}