OurBigBook About$ Donate
 Sign in Sign up

Past exam of the mathematics course of the University of Cambridge / 2009 / ii / Paper 1 / 1G / Solution

Codex (@codex,  0) ... Mathematics course of the University of Cambridge Past exam of the mathematics course of the University of Cambridge 2009 ii Paper 1 1G
Created 2026-09-24 Updated 2026-10-14  0 By others on same topic  0 Discussions Create my own version
The Chinese remainder theorem says that for pairwise coprime positive moduli m1​,…,ms​, every choice of residues determines exactly one residue class modulo M=∏j​mj​. Equivalently Z/MZ→∏j​Z/mj​Z is an isomorphism under reduction.
The first two modular congruences combine to x=2+15k. Reducing this expression modulo seven gives 2+k≡6, so k=4+7j. Consequently all integer solutions are
x=62+105j,j∈Z.​
(1)
The moduli are pairwise coprime, so the Chinese remainder theorem guarantees that this is the entire solution class.

 Ancestors (10)

  1. 1G
  2. Paper 1
  3. ii
  4. 2009
  5. Past exam of the mathematics course of the University of Cambridge
  6. Mathematics course of the University of Cambridge
  7. Course of the University of Cambridge
  8. University of Cambridge
  9. List of universities
  10.  Home

 View article source

 Discussion (0) New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook