OCR Further Additional Pure 2018 September — Question 1

Exam BoardOCR
ModuleFurther Additional Pure (Further Additional Pure)
Year2018
SessionSeptember
TopicNumber Theory
1
  1. Write the number \(100011 _ { n }\), where \(n \geqslant 2\), as a polynomial in \(n\).
  2. Show that \(n ^ { 2 } + n + 1\) is a factor of this expression.
  3. Hence show that \(100011 _ { n }\) is composite in any number base \(n \geqslant 2\).
This paper (5 questions)
View full paper
Q1 Q2 Q3 Q4 Q7