Simultaneous linear congruences

Questions requiring solving systems of two or more linear congruences using Chinese Remainder Theorem or similar methods.

4 questions · Standard +0.7

Sort by: Default | Easiest first | Hardest first
OCR Further Additional Pure 2019 June Q3
4 marks Standard +0.3
3
  1. Solve \(7 x \equiv 6 ( \bmod 19 )\).
  2. Show that the following simultaneous linear congruences have no solution. $$x \equiv 3 ( \bmod 4 ) , x \equiv 4 ( \bmod 6 )$$
OCR Further Additional Pure 2024 June Q3
6 marks Standard +0.8
3 Determine all integers \(x\) for which \(x \equiv 1 ( \bmod 7 )\) and \(x \equiv 22 ( \bmod 37 )\) and \(x \equiv 7 ( \bmod 67 )\).
Give your answer in the form \(\mathrm { x } = \mathrm { qn } + \mathrm { r }\) for integers \(n , q , r\) with \(q > 0\) and \(0 \leqslant \mathrm { r } < \mathrm { q }\).
OCR Further Additional Pure 2021 November Q4
6 marks Challenging +1.2
4 Solve the simultaneous linear congruences \(x \equiv 1 ( \bmod 3 ) , x \equiv 5 ( \bmod 11 ) , 2 x \equiv 5 ( \bmod 17 )\).
OCR Further Additional Pure 2018 March Q1
5 marks Standard +0.3
1 Determine the solution of the simultaneous linear congruences $$x \equiv 4 ( \bmod 7 ) , \quad x \equiv 25 ( \bmod 41 ) .$$