Scribd
Upload
6 views4 pages

Congruence 1 Assignment Lec6 - Sol Dual

The document contains a series of mathematical problems and their solutions, including calculations involving remainders, factorials, and modular arithmetic. Each problem is presented with a clear solution process, demonstrating various mathematical principles. The solutions cover topics such as divisibility, congruences, and the properties of powers and factorials.

Uploaded by

miyu27092007
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
6 views4 pages

Congruence 1 Assignment Lec6 - Sol Dual

The document contains a series of mathematical problems and their solutions, including calculations involving remainders, factorials, and modular arithmetic. Each problem is presented with a clear solution process, demonstrating various mathematical principles. The solutions cover topics such as divisibility, congruences, and the properties of powers and factorials.

Uploaded by

miyu27092007
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/ 4

1. Jerry has 44 boxes of soda in his truck.

truck. The cans of soda in each box are packed oddly so that there
are 113 cans of soda in each box. Jerry plans to pack the sodas into cases of 12 cans to sell. After
making as many complete cases as possible, how many sodas will Jerry have leftover?

2. If n! denotes the product of the integers 1 through n, what is the remainder when (1!+ 2! + 3! + 4! +
5! + 6!+...) is divided by 9.
3. Find the remainder of (25733 + 46)26 when it is divided by 50
4. Find the remainder when

is divided by 1000.

5. Find the last two digits (in order) of


6. Write down the last four digits of the number 7128
7. Let R be the set of all possible remainders when a number of the form 2n, n a nonnegative integer, is
divided by 1000. Let S be the sum of the elements in R. Find the remainder when S is divided by
1000.
8. For how many integral value of x ≤ 100 is 3x – x2 divisible by 5?
9. Find the remainder when the difference between 60002 and 601 is divided by 6.
10. What is the remainder when 91990 is divided by 11?

Solutions:

1. Jerry has 44 boxes of soda in his truck. The cans of soda in each box are packed oddly so that there
are 113 cans of soda in each box. Jerry plans to pack the sodas into cases of 12 cans to sell. After
making as many complete cases as possible, how many sodas will Jerry have leftover?
Sol.
First we not that
44 ≡ 8 (mod 12)
113 ≡ 5 (mod 12)
Thus,
44 . 113 ≡ 8 .5 ≡ 40 ≡ 4 (mod 12)
Meaning there are 4 sodas leftover.
2. If n! denotes the product of the integers 1 through n, what is the remainder when (1!+ 2! + 3! + 4! +
5! + 6!+...) is divided by 9.
Sol.
First of all, we know that k! ≡ 0 (mod 9) for all k ≥ 6.
Thus, we only need to find (1! + 2! + 3! + 4! + 5!) (mod 9).
1! ≡ 1 ( mod 9)
2! ≡ 2 ( mod 9)
3! ≡ 6( mod 9)
4! ≡ 24 ≡ 6 (mod 9)
5! ≡ 5. 6 ≡ 30 ≡ 3 ( mod 9)
Thus, (1! + 2! + 3! + 4! + 5!) ≡ 1 + 2 + 6 + 6 + 3 ≡ 18 ≡ 0 (mod 9)
so the remainder is 0.

3. Find the remainder of (25733 + 46)26 when it is divided by 50.


Sol.
257 ≡ 7 mod (50)
(257)33 = 733 ≡ (72)1671 ≡ (– 1)16 71 ≡ 7 mod (50)
(257)33 + 46 ≡ 7 + 46 ≡ 3 mod (50)
(25733 + 46)26 ≡ 326 mod (50)
35 ≡ – 7 mod (50) ⇒ 310 = – 1 mod (50)
326 = (310)2 × 36 ≡ 1 × 29 mod (50)

4. Find the remainder when

is divided by 1000.
Sol.
Note that
999 ≡ 999 …..≡

≡ – 1 (mod 1000).
That is a total of 999 – 3 + 1 = 997 integers, so all those integers multiplied out are congruent to
–1 (mod 1000). Thus the entire expression is congruent to (– 1) (9)(99) = – 891 ≡ 109 (mod 1000).
5. Find the last two digits (in order) of
Sol.
Note that 74 = 1 (mod 100).
Now 32005 = (– 1)2005 = – 1 = 3 (mod 4).
Hence 32005 = 4k + 3 for some positive integer k.
Thus

6. Write down the last four digits of the number 7128.


Sol. 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 = (4801 + 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

7. Let R be the set of all possible remainders when a number of the form 2n, n a nonnegative integer, is
divided by 1000. Let S be the sum of the elements in R. Find the remainder when S is divided by
1000.
Sol.
Note that x ≡ y (mod 1000) ⇔ x ≡ y (mdo 125) and x ≡ y ( mod 8). So we must find two integer i
and j such that 2i ≡ 2j (mod 125) and 2i ≡ 2j (mod 8) and i ≠ j. Note that i and j will be greater than 2
since remainder of 1, 2, 4 will not be possible after 2 ( the numbers following will always be
congruent to 0 modulo 8). Note that 2100 ≡ 1 (mod 125) (see Euler’s theorem) and 20, 21, 22,...,299
are all distinct modulo 125 (proof below). Thus i 103 and j = 3 are the first two integer such that
2i ≡ 2j (mod 1000). Note that x ≡ y (mod 1000) ⇔ x ≡ y (mdo 125) and x ≡ y ( mod 8). So we must
find two integer i and j such that 2i ≡ 2j (mod 125) and 2i ≡ 2j (mod 8) and i ≠ j. Note that i and j will
be greater than 2 since remainder of 1, 2, 4 will not be possible after 2 ( the numbers following will
always be congruent to 0 modulo 8). Note that 2100 ≡ 1 (mod 125) (see Euler’s theorem) and 20, 21,
22,...,299 are all distinct modulo 125 (proof below). Thus i 103 and j = 3 are the first two integer
such that 2i ≡ 2j (mod 1000).

8. For how many integral value of x ≤ 100 is 3x – x2 divisible by 5?


Sol. Here I will give a complete solution using congruences: For any non negative integer x, we can
prove that
34m ≡ 1 (mod 10),
34m + 1 ≡ 3 (mod 10),
34m + 2 ≡ 9 (mod 10),
34m + 3 ≡ 7 (mod 10).
Also for any (positive) integer x, we have
x2 ≡ 0, 1, 4, 5, 6, 9 (mod 10)
For x ≡ 0, ± 1, ± 2, ± 3, ± 4, 5 (mod 10) respectively.
If n = |3x – x2| is divisible by 5, Its last digit should be 0 or 5. Therefore we have following few cases:
• x is of the form 4m and 10n ± 1. This is impossible.
• x is of the form 4m and 10n ± 4. So x ≡ ± 4(mod 20)
• x is of the form 4m + 2 and 10n ± 2. Here, x ≡ ± 2 (mod 20).
• x is of the form 4m + 2 and 10n ± 3. This is again impossible.
Altogether we have 20 possible integer solution less than 100, namely
{2, 4, 16, 18, 22, 24, 36, 38, 42, 44, 56, 58, 62, 64, 76, 78, 82, 84, 96, 98}

9. Find the remainder when the difference between 60002 and 601 is divided by 6.
Sol.
Note that and . So,

Thus,

so 1 is the remainder when the difference is divided by .


10. What is the remainder when 91990 is divided by 11?
Sol. 9  – 2 mod (11)
95  –32  1 mod (11)
91990  1 mod (11)

You might also like