MAT-3004 Number Theory

Problem set 6
Universidad San Francisco de Quito
Pablo Padilla (00211548)
Wednesday, July 8

Section 5.1
Exercise 1. If a ≡ b (mod m), prove for any integer c and nonnegative integer n
that
(a) a ± c ≡ b ± c (mod m),
Proof

a ≡ b (mod m) ⇒ a − b = km
⇒ a − b + c − c = km
⇒ a + c − (b + c ) = km
⇒ a + c ≡ b + c (mod m)

Also

a ≡ b (mod m) ⇒ a − b = km
⇒ a − b + c − c = km
⇒ a − c − (b − c ) = km
⇒ a − c ≡ b − c (mod m)


(b) ac ≡ bc (mod m),
Proof

a ≡ b (mod m) ⇒ a − b = km
⇒ c (a − b) = ckm
⇒ ac − bc = ckm
⇒ ac ≡ bc (mod m) 

1
 (c) a n ≡ b n (mod m).
Proof
We’ll use induction. Let P (n) be the variable proposition that P is true for
n ∈ N.
Our assumption makes it clear that P (1) is true

a ≡ b (mod m) .

If P (k ) is true for some k ∈ N, i.e.

a k ≡ b k (mod m) ,

Then, P (k + 1)

a k +1 = a k · a ≡ b k · a ≡ b k · b ≡ b k +1 (mod m)

Is true. Hence, by induction it follows that it’s true for all n ∈ N. 

Exercise 5. If a ≡ b (mod m) and a ≡ b (mod n) then show that a ≡ b (mod lcm(m,n)).
Proof
We know that

m|(a − b)
n|(a − b)
Îk 𝛼i Îk 𝛽i
If we write m = i =1 p i and n = i =1 p i , notice how, for each 𝛼 and 𝛽

p 𝛼 |(a − b)
p 𝛽 |(a − b)

Then p max {𝛼,𝛽 } |(a − b), also |a − b | = ki=1 pi𝜔i , where 𝜔 = max {𝛼, 𝛽 }. Then
Î
lcm(m,n)|(a − b). Hence a ≡ b (mod lcm(m,n)).

Exercise 11. Find a complete residue system modulo 11 composed of multiples of
7.
Solution

{0, 7, 14, 21, 28, 35, 42, 49, 56, 63, 70}

Exercise 12. Show that {2, 4, 6, . . . , 2m} is a complete residue system modulo m if
and only if m is odd.

2
Proof
First let’s rule out the possibility for m to be even.
Notice that {1, 2, . . . ,m} is a complete residue system modulo m.
If m happens to be even, then there exists 1 ≤ l < m such that 2l = m. Multiplying
the residue system by 2 will lead us to {2, 4, 6, . . . , 2m}. As l was in the first resi-
due system, 2l = m is on the second one. Which means that as 2m ≡ m (mod m),
{2, 4, 6, . . . , 2m} is not a complete residue system for m even.
Now, knowing that m is odd iff gcd(m, 2) = 1, take 1 ≤ , /,
≤ m, ≠ from the / ,
complete residue system modulo m: {1, 2, . . . ,m}, such that / ,
. (mod m) and
/ ,
notice that 2 , 2 are in {2, 4, 6, . . . , 2m}.
/ ,
Let us assume, in look for a contradiction, that 2 ≡ 2 (mod m). Then, as gcd(m, 2) =
1, this implies / ,
≡ (mod m), which contradicts the fact that , are in the / ,
/
complete residue system {1, 2, . . . ,m}. Therefore, 2 . 2 (mod m) for every ,
/ ,
2 ≤ 2 , 2 ≤ 2m, and {2, 4, 6, . . . , 2m} is a complete residue system1 iff m is odd.
Q.E.D. 
Exercise 32. If n = c k b k + · · · + c 1b + c 0 , where 0 < c k < b, 0 ≤ c i < b, for
i = 1, 2, . . . , k − 1, and b > 1 is a positive integer, show that b − 1 divides n if and
only if b − 1 divides c 0 + · · · + c k .
Proof
Provided that b > 1 is a positive integer

b ≡ 1 (mod (b − 1)) .

Using the fact that a ≡ b (mod m), c ≡ d (mod m) imply ac ≡ bd (mod m). If
b − 1|n, then n ≡ 0 (mod (b − 1)) and

n = c k b k + · · · + c 1b + c 0 ≡ c k · 1k + . . . + c 1 · 1 + c 0
≡ ck + · · · + c 0
≡ 0 (mod (b − 1))

Hence, (b − 1)|c 0 + · · · + c k . The congruence is valid in both directions. 

Section 5.2
Exercise 1. Prove that if 7 divides 100a + b, then 7 divides 2a + b. Is the converse
true?
Proof
1 The converse just uses the fact that it’s a complete residue system if gcd(2,m) = 1, and that
implies that m is odd.

3
 100a + b ≡ 9a + b ≡ 2a + b ≡ 0 (mod 7). 

It works on both ways, so the converse is also true.

Exercise 3. Without performing the indicated operations determine the digit x in
each of the following calculations.
(a) (65 248) · (124 589) = 8 1x9 183 07x.
Solution
8 · 9 gives us the last digit modulo 10. So

8 · 9 ≡ −2(−1) ≡ 2(mod 10).

Hence x = 2.
(b) (x12) · (1 9x3 12x) = 1 000 000 000.
Solution
The product is 0 (mod 10). So, the last digit must be 0 (mod 10). Hence x
is either 0 or 5. With x = 0 the number of digits in the multiplication is not
sufficient. So x = 5.
(c) 6 x56 681 = (3(843 + x)) 2 .
Solution
The left hand side is a product of 9. Hence the number is divisible by 9. Using
the criteria to evaluate if a number is divisible by 9.

6 + x + 5 + 6 + 6 + 8 + 1 = x + 32 (1)

The only number between 0 and 9 that makes this sum a multiple of 9 is x = 4.
Exercise 6. Use the divisibility rule outlined in Example 5.6 to check if
691 504 249 989 is divisible by 7.
Solution

4
 2(6 915 042 499) + 89 = 13 830 085 087
2(138 300 850) + 87 = 276 601 787
2(2 766 017) + 87 = 5 532 121
2(55 321) + 21 = 110 663
2(1 106) + 63 = 2 275
2(22) + 75 = 119
2 + 19 = 21

Yes!!!!!!!!
Exercise 7. Use the divisibility rule outlined in Example 5.7 to check if
67 911 603 138 353 is divisible by 13.
Solution

6 791 160 313 835 + 4(3) = 6 791 160 313 847

679 116 031 384 + 4(7) = 679 116 031 412
67 911 603 141 + 4(2) = 67 911 603 149
6 791 160 314 + 4(9) = 6 791 160 350
679 116 035 + 4(0) = 679 116 035
67 911 603 + 4(5) = 67 911 623
6 791 162 + 4(3) = 6 791 174
679 117 + 4(4) = 679 133
67 913 + 4(3) = 67 925
6 792 + 4(5) = 6 812
681 + 4(2) = 689
68 + 4(9) = 104
10 + 4(4) = 26

Yes, it is.
Exercise 9. We can check the divisibility by 7 of a positive integer having more than
two digits by deleting the units digit of the number and subtracting twice the units
digit from what remains. The result is divisible by 7 if and only if the original number
is divisible by 7. We can check the divisibility by 13 of a positive integer having more
than three digits by deleting the units digit of the number and subtracting 9 times the

5
units digit from what remains. The result is divisible by 13 if and only if the original
number is divisible by 13. Devise a similar rule for divisibility by 17.
Solution
Let N be a multiple of 17 of the form

N = 10k ak + . . . + 10a 1 + a0 = 17k

where each ai are its digits. We’ll use a little trick called “17 · 3 = 51” and proceed
to do the following.
 
k −1
10 10 ak + . . . + a1 + a0 = 17k
 
10 10k −1 ak + . . . + a1 + a 0 − 51a 0 + 51a0 = 17k
 
10 10k −1 ak + . . . + a1 − 5a0 + 51a0 = 17k
 
10 10k −1 ak + . . . + a1 − 5a 0 = 17(k − 3a0 ) ≡ 0 (mod 17)

So, here’s the rule:

“Any number n, whose absolute difference between five times its units digit and the number
formed by the rest of its digits is a multiple of 17, is a multiple of 17 itself”.
Section 5.3
Exercise 2. Find the reduced residue system modulo 18.
Solution

{1, 5, 7, 11, 13, 17}.

Exercise 3. Show that 𝜙(25 930) = 𝜙(25 935) = 𝜙(25 940) = 𝜙(25 942).
Proof

𝜙(25 930) = 𝜙(2 · 5 · 2593) = 10 368

𝜙(25 935) = 𝜙(3 · 5 · 7 · 13 · 19) = 10 368
𝜙(25 940) = 𝜙(22 · 5 · 1297) = 10 368
𝜙(25 942) = 𝜙(2 · 7 · 17 · 109) = 10 368


 
Exercise 9. Show that 𝜙 n 2 = n𝜙(n), for n ≥ 1.
Proof

6
I will have no mercy and use the strong notation. Let n = ki=1 pi𝛼i (powers of primes
Î

and 𝛼i can be zero). Then n 2 = ki=1 pi2𝛼i and by corollary 5.12,

Î

k   k  

2
 Ö
2 pi − 1 Ö pi − 1
𝜙 n =n =n ·n = n𝜙(n).
pi pi
i =1 i =1


√
Exercise 16. Show that 𝜙(n) ≤ n − n if n is composite.
Proof
 
1
When n = p𝛼 and 𝛼 > 2, 𝜙(n) = 𝜙(p 𝛼 ) = p𝛼 1− p = p 𝛼 − p 𝛼−1 ,

𝜙(n) = n − n 1−1/𝛼 = n − n (𝛼−1)/𝛼 < n − n 1/2 .

For 𝛼 = 2

𝜙(n) = n − n 1−1/2 = n − n (2−1)/2 = n − n 1/2 .

 
1
In general, observe that 1 − < 1 for every prime number p. Then, let p be the
p
smallest prime factor of the composite number n
√
   
1 1
𝜙(n) ≤ n 1 − ≤ n 1 − √ ≤ n − n.
p n

Ín
Exercise 17. Show that for any positive integer n that k =1 𝜙(k )·Èn/k É = n (n+1)/2.
[Dirichlet 1849]
Proof
Recall that
Õ
𝜙(m) = k .
m|k

So,
n Õ n
Õ Õ n (n + 1)
𝜙(m) = k= .
2
k =1 m|k k =1

Where each 𝜙(m) will appear in the sum exactly Èn/mÉ times. Therefore
n  
Õ n n (n + 1)
𝜙(m) = .
m 2
m=1

7
Section 5.4
Exercise 1. Solve the following linear congruences:
(a) 16x ≡ 27 (mod 29).
Solution
As gcd(16, 29) = 1, and 29(5) − 16(9) = 1. Multiply both sides by −9

−9(16)x ≡ −9(27) (mod 29)

x ≡ −9(−2) (mod 29)
x ≡ 18 (mod 29).

(b) 20x ≡ 16 (mod 64).

Solution
gcd(20, 64) = 4. 4|16 and 5(−3) = 1 − 16.

20x ≡ 16 (mod 64)

5x ≡ 4 (mod 16)
(−3)5 ≡ −12 (mod 16)
x ≡ 4 (mod 16)
x ≡ 4 + 16t (mod 16), t = 0, 1, 2, 3
x ≡ 4, 20, 36, 52 (mod 64).

(c) 131x ≡ 21 (mod 77).

Solution
As gcd(131, 77) = 1, and 131(10) = 1 + 77(17). Multiply both sides by 10

10(131)x ≡ 10(21) (mod 77)

x ≡ 210 (mod 77)
x ≡ 56 (mod 77).

(d) 22x ≡ 5 (mod 12).

Solution
As gcd(22, 12) = 2, but 2 - 5. It has no solutions.
(e) 17x ≡ 6 (mod 29).

8
 Solution
gcd(17, 29) = 1, 17(12) = 1 + 29(7),

12(17)x ≡ 12(6) (mod 29)

x ≡ 72 (mod 29)
x ≡ 14 (mod 29).

Exercise 3. Find all solutions to 2x + 3y = 4.

Solution
As gcd(2, 3) = 1. Without loss of generality, consider 2x ≡ 4 mód 3, the solution
is x ≡ 2 mód 3, which implies that x = 2 + 3k , and 2(2 + 3k ) + 3y = 4 implies that
y = −2k . The solutions (x, y) are

(2 + 3k , −2k ).

Exercise 14. Find an integer having the remainders 5, 4, 3, 2 when divided by 6, 5,

4, and 3 respectively. [Brahmagupta, Bhaskara, and Fibonacci]
Solution
We have the following system

x ≡5 (mod 6)
x ≡4 (mod 5)
x ≡3 (mod 4)
x ≡2 (mod 3)

Let m = lcm(6, 5, 4, 3) = 60. Also

m1 = 6, m2 = 5, m3 = 4, m4 = 3,
a1 = 5, a2 = 4, a3 = 3, a4 = 2,
c1 = 1, c2 = 5, c3 = 4, c4 = 3,
M1 = 60, M2 = 12, M3 = 15, M4 = 20.

Solving the congruences

60b 1 ≡ 1 (mod 1), 12b 2 ≡ 1 (mod 5), 15b 3 ≡ 1 (mod 4), 20b 4 ≡ 1 (mod 3),
b 1 ≡ 1 (mod 1), b 2 ≡ −2 (mod 5), b 3 ≡ −1 (mod 4), b 4 ≡ −1 (mod 3),
b 2 ≡ 3 (mod 5), b 3 ≡ 3 (mod 4), b 4 ≡ 2 (mod 3).

9
Hence x ≡ 60(5) + 12(3)(4) + 15(3)(3) + 20(2)(2) ≡ 59 (mod 60). The number is
59.
Exercise 17. A band of 17 pirates upon dividing their gold coins found that three
coins remain after the coins have been apportioned evenly. In an ensuing brawl, one
of the pirates was killed. The wealth was again redistributed equally, and this time
ten coins remained. Again an argument broke out and another pirate was killed.
This time the fortune was distributed evenly among the survivors. What was the
least number of gold coins the pirates had to distribute?
Solution
We have the system x ≡ 3 (mod 17), x ≡ 10 (mod 16) and x ≡ 0 (mod 15). Which
gives us m = 4080, as each modulo is coprime in pairs. Solving the systems for each
b i we get x ≡ 44 730 ≡ 3 930 (mod 4080). Hence the least number of gold was
3 930. Arrrrr!
Exercise 20. Find a solution to 5x + 8y + 7z = 50. [Paoli 1794]
Solution
I obtained the following

z =t
y = t + 5s
x = 10 − 8s − 3t

And plugging t = 0 and s = 1 we get x = 2, y = 5 and z = 0, which solve the

equation.

10
Figura 1: Please accept this humble cat in memorial of my last two brain cells
that peacefully died while adding numbers.

11