SS1: MATHEMATICS - 1ST TERM
Number Base System I | Week 16 Topics|2 Quizzes
Binary Number System
Converting from other Bases to Base 10
Converting Numbers in Base Ten to other Bases
Addition in Other Bases
Subtraction in Other Bases
Addition & Subtraction in Other Bases
- Binary Number System
Number Base System II | Week 23 Topics
Number Base System III | Week 32 Topics|1 Quiz
Modular Arithmetic I | Week 42 Topics
Modular Arithmetic II | Week 52 Topics
Modular Arithmetic III | Week 63 Topics|1 Quiz
Indices I | Week 73 Topics
Indices II | Week 81 Topic|1 Quiz
Logarithms I | Week 93 Topics
Logarithms II | Week 104 Topics|1 Quiz
Do you like this content?
Two integers are said to be modular equivalent if they have the same remainder in modular arithmetic.
Show that the following pairs of numbers are equivalent in the moduli given:
(i) 67 and 94 (mod9)
(ii) 108 and 97 (mod11)
67 = 7 x 9 + 4
94 = 10 x 9 + 4
Note that the remainder is 4 in each case
Thus \( \scriptsize 94 \equiv 67 ( mod 9) \)
The integers 67 and 94 are congruent because they have the same modular equivalent
(ii)\( \scriptsize 108 \equiv 9 \: \times \: 11 \: + \: 9 \) \(\scriptsize 97 \equiv 8 \: \times \: 11 \: + \: 9 \)
Thus \( \scriptsize 97 \equiv 108 ( mod 11) \)
In general, two integers x and y are said to be congruent modulo z, i.e.
\( \scriptsize x \equiv y ( mod z) \)
i.e. If the difference of x – y is an integer multiple of z, where the number z is referred to as the modulus of the congruence.