Scribd
Upload
32 views6 pages

Training 18 Congruence of Integers

The document discusses the concept of congruence of integers, defining congruence modulo m and outlining its basic properties. It also covers the units digit of powers of positive integers and the last two digits of certain positive integers, providing examples and solutions to various mathematical problems. Additionally, it includes testing questions related to the topics discussed.

Uploaded by

Chen Zenghui
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
32 views6 pages

Training 18 Congruence of Integers

The document discusses the concept of congruence of integers, defining congruence modulo m and outlining its basic properties. It also covers the units digit of powers of positive integers and the last two digits of certain positive integers, providing examples and solutions to various mathematical problems. Additionally, it includes testing questions related to the topics discussed.

Uploaded by

Chen Zenghui
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 6

Lecture 18

Congruence of Integers

Definition 1 When an integer n is divided by a non-zero integer m, there must


be an integral quotient q and a remainder r, where 0 ≤ |r| < m. This relation is
denoted by
n = mq + r,

and the process for getting this relation is called division with remainder.

Definition 2 Two integers a and b are said to be congruent modulo m, denoted


by a ≡ b (mod m), if a and b have the same remainder when they are divided
by a non-zero integer m. If the remainders are different, then a and b are said to
be not congruent modulo m, denoted by a 6≡ b (mod m).
By the definition of congruence, the following four equivalent relations are
obvious:

a ≡ b (mod m) ⇐⇒ a − b = km ⇐⇒ a − b ≡ 0 (mod m) ⇐⇒ m | (a − b).

Basic Properties of Congruence

(I) If a ≡ b (mod m) and b ≡ c (mod m), then a ≡ c (mod m).


(II) If a ≡ b (mod m) and c ≡ d (mod m), then

(a + c) ≡ (b + d) (mod m), (a − c) ≡ (b − d) (mod m).

(III) If a ≡ b (mod m) and c ≡ d (mod m), then a · c ≡ b · d (mod m).


(IV) If a ≡ b (mod m) then an ≡ bn (mod m) for all natural numbers n.
(V) If ac ≡ bc (mod m) and (c , m) = 1, then a ≡ b (mod m).

13
14 Lecture 18 Congruence of Integers

The Units Digit of Powers of Positive Integers an

Let P be the units digit of a positive integer a, and n be the positive integer power
of a. Then the units digit of an is determined by the units digits of P n , denoted by
U (P n ), and the sequence {U (P n ), n = 1, 2, 3, . . .} follows the following rules:
(I) The sequence takes constant values for P = 0, 1, 5, 6, i.e. U (P n ) does not
change as n changes.
(II) The sequence is periodic with a period 2 for P = 4 or 9.
(III) The sequence is periodic with a period 4 for P = 2, 3, 7, 8.

The Last Two digits of some positive integers

(I) The last two digits of 5n (n ≥ 2) is 25.


(II) The ordered pair of last two digits of 6n (n ≥ 2) changes with the period
“36, 96, 76, 56” as n changes.
(III) The ordered pair of last two digits of 7n (n ≥ 2) changes with the period
“07, 49, 43, 01” as n changes.
(IV) The ordered pair of last two digits of 76n is always 76.

Examples

Example 1. (CHINA/2004) When a three digit number is divided by 2, 3, 4, 5 and


7, the remainders are all 1. Find the minimum and maximum values of such three
digit numbers.

Solution Let x be a three digit with the remainder 1 when divided by 2, 3, 4,


5 and 7. Then x − 1 is divisible by each of 2, 3, 4, 5, 7, so

x − 1 = k · [2, 3, 4, 5, 7] = 420k.

Thus, the minimum value of x is 420 + 1 = 421, the maximum value of x is


2 × 420 + 1 = 841.

Example 2. It is known that 2726, 4472, 5054, 6412 have the same remainder
when they are divided by some two digit natural number m. Find the value of
m.

Solution For excluding the effect of the unknown remainder, the three differ-
ences by the four given numbers can be used to replace the original four numbers.
Then
Lecture Notes on Mathematical Olympiad 15

m | (4472 − 2726) ⇒ m | 1746. 1746 = 2 · 32 · 97;


m | (5054 − 4472) ⇒ m | 582. 582 = 2 · 3 · 97;
m | (6412 − 5054) ⇒ m | 1358. 1358 = 2 · 7 · 97.
Since 97 is the unique two digit common divisor of the differences, so m = 97.
Example 3. (CHINA/2000) Find the remainder of 32000 when it is divided by 13.
Solution 33 = 27 ≡ 1 (mod 13) provides the method for reducing the power
of 3, it follows that
32000 ≡ (33 )666 · 32 ≡ 32 ≡ 9 (mod 13).
Thus, the remainder is 9.
Note: For finding the remainder of a large power of a positive integer, it is
important to find the minimum power with remainder 1, or see if the remainders
are constant as the power changes.
Example 4. (SSSMO(J)/2001) Find the smallest positive integer k such that 269 +
k is divisible by 127.
Solution 27 ≡ 1 (mod 127) implies 27m ≡ (27 )m ≡ 1m ≡ 1 (mod 127),
hence
269 = [(27 )9 ](26 ) ≡ 26 ≡ 64 (mod 127),
therefore the minimum value of k is equal to 127 − 64 = 63.
Example 5. (SSSMO/2003) What is the remainder when 6273 + 8273 is divided
by 49?
Solution In general, for odd positive integer n,
an + bn = (a + b)(an−1 − an−2 b + an−3 b2 − · · · + bn−1 ),
so that
6273 + 8273 = (6 + 8)(6272 − 6271 · 8 + 6270 · 82 − · · · + 8272 ) = 14M,
where M = 6272 − 6271 · 8 + 6270 · 82 − · · · + 8272 . Furthermore,
M ≡ (−1)272 − (−1)271 + (−1)270 − · · · + 1 ≡ 273 ≡ 0 (mod 7),
| {z }
273 terms

therefore 7 | M , hence 49 | 14M , i.e. the remainder is 0.


2009
Example 6. Find the remainder of the number 20052007 when divided by 7.
16 Lecture 18 Congruence of Integers

2009 2009
Solution First of all 20052007 ≡ 32007 (mod 7). Since 33 ≡ −1 (mod
7) yields 36 ≡ (33 )2 ≡ 1 (mod 7),
20072009 ≡ 32009 ≡ 3 (mod 6),
it follows that 20072009 = 6k + 3 for some positive integer k. Therefore
2009
20052007 ≡ 36k+3 ≡ 33 ≡ 6 (mod 7).
Thus, the remainder is 6.
Example 7. (SSSMO/1997) Find the smallest positive integer n such that 1000 ≤
n ≤ 1100 and 1111n + 1222n + 1333n + 1444n is divisible by 10.

Solution Let N = 1111n + 1222n + 1333n + 1444n . Then


N ≡ 1n + 2n + 3n + 4n (mod 10).
For estimating the minimum value of n, we test n = 1000. Then
N ≡ 1 + (24 )250 + (34 )250 + (42 )500 ≡ 1 + 6 + 1 + 6 ≡ 4 (mod 10).
Hence for n = 1001,
N ≡1+6·2+1·3+6·4≡1+2+3+4≡0 (mod 10).
Thus nmin = 1001.
Example 8. Prove that for any odd natural number n, the number 12007 + 22007 +
· · · + n2007 is not divisible by n + 2.
Solution By taking modulo n + 2, and partition the terms as groups of two
each,
12007 + 22007 + · · · + n2007
$µ ¶2007 µ ¶2007 %
2007 2007 n+1 n+3
= 1 + b2 +n c + ··· + +
2 2
$µ ¶2007 µ ¶2007 %
n + 1 n + 1
≡ 1 + b22007 + (−2)2007 c + · · · + + −
2 2
≡ 1 (mod n + 2).

Thus, the conclusion is proven.


Example 9. (SSSMO(J)/2001) Write down the last four digits of the number
7128 .
Lecture Notes on Mathematical Olympiad 17

Solution Here the recursive method is effective. Start from 74 = 2401, then

74 = 2401 ≡ 2401 (mod 104 ),


78 = (74 )2 = (2400 + 1)2 = (2400)2 + 4800 + 1 ≡ 4801 (mod 104 ),
716 ≡ (4800 + 1)2 ≡ 9601 (mod 104 ),
732 ≡ (9600 + 1)2 ≡ 9201 (mod 104 ),
764 ≡ (9200 + 1)2 ≡ 8401 (mod 104 ),
7128 ≡ (8400 + 1)2 ≡ 6801 (mod 104 ).

Therefore the last four digits of 7128 is 6801.

Testing Questions (A)

1. (CHINA/2001) Find the number of positive integer n, such that the remainder
is 7 when 2007 is divided by n.

2. (SSSMO/1999) What is the remainder of 1234567894 when it is divided by


8?

3. Prove that 7 | (22225555 + 55552222 ).


27
4. Find the remainder of 4737 when it is divided by 11.

5. (CHINA/1990) What is the remainder when 91990 is divided by 11?

6. (CHINA/2004) n = 3 × 7 × 11 × 15 × 19 × · · · × 2003. Find the last three


digits of n.

7. (CHINA/2002) When a positive integer n is divided by 5, 7, 9, 11, the remain-


ders are 1, 2, 3, 4 respectively. Find the minimum value of n.

8. (IMO/1964) (a) Find all positive integers n for which 2n − 1 is divisible by


7.
(b) Prove that there is no positive integer n for which 2n + 1 is divisible by
7.

9. (SSSMO/00/Q11) What is the units digit of 31999 × 72000 × 172001 ?


(A) 1 (B) 3 (C) 5 (D) 7 (E) 9

10. Find the last two digits of 2999 .


18 Lecture 18 Congruence of Integers

Testing Questions (B)

14
1. Find the last two digits of 1414 .
2. Find the remainder of (25733 + 46)26 when it is divided by 50.
3. (SSSMO(J)/2003) What is the smallest positive integer n > 1 such that 3n
ends with 003?
4. (CHNMOL/1997) There is such a theorem: “If three prime numbers a, b, c >
3 satisfy the relation 2a + 5b = c, then a + b + c is divisible by the integer
n.” What is the maximum value of the possible values of n? Prove your
conclusion.
5. (MOSCOW/1982) Find all the positive integers n, such that n · 2n + 1 is
divisible by 3.

You might also like