Linear Congruence Theorem - System of Linear Congruences

System of Linear Congruences

By repeatedly using the linear congruence theorem, one can also solve systems of linear congruences, as in the following example: find all numbers x such that

2x ≡ 2 (mod 6)
3x ≡ 2 (mod 7)
2x ≡ 4 (mod 8).

By solving the first congruence using the method explained above, we find x ≡ 1 (mod 3), which can also be written as x = 3k + 1. Substituting this into the second congruence and simplifying, we get

9k ≡ −1 (mod 7).

Solving this congruence yields k ≡ 3 (mod 7), or k = 7l + 3. It then follows that x = 3 (7l + 3) + 1 = 21l + 10. Substituting this into the third congruence and simplifying, we get

42l ≡ −16 (mod 8)

which has the solution l ≡ 0 (mod 4), or l = 4m. This yields x = 21(4m) + 10 = 84m + 10, or

x ≡ 10 (mod 84)

which describes all solutions to the system.

Read more about this topic:  Linear Congruence Theorem

Famous quotes containing the words system of and/or system:

    While the system of holding people in hostage is as old as the oldest war, a fresher note is introduced when a tyrannic state is at war with its own subjects and may hold any citizen in hostage with no law to restrain it.
    Vladimir Nabokov (1899–1977)

    The North American system only wants to consider the positive aspects of reality. Men and women are subjected from childhood to an inexorable process of adaptation; certain principles, contained in brief formulas are endlessly repeated by the press, the radio, the churches, and the schools, and by those kindly, sinister beings, the North American mothers and wives. A person imprisoned by these schemes is like a plant in a flowerpot too small for it: he cannot grow or mature.
    Octavio Paz (b. 1914)