OCR Further Additional Pure 2018 December — Question 3

Exam BoardOCR
ModuleFurther Additional Pure (Further Additional Pure)
Year2018
SessionDecember
TopicNumber Theory
3
  1. Show that \(10 ^ { 2 } \equiv 6 ( \bmod 47 )\).
  2. Determine the integer \(r\), with \(0 < r < 47\), such that \(6 r \equiv 1 ( \bmod 47 )\).
  3. Determine the least positive integer \(n\) for which \(10 ^ { n } \equiv 1\) or \(- 1 ( \bmod 47 )\).
This paper (7 questions)
View full paper
Q1 Q2 Q3 Q4 Q5 Q6 Q7