WRENDELL C.

JUNTILLA
MST – Mathematics

PROBLEM SETS IN NUMBER THEORY

Problem Set #1
1. For which positive integers m are the following statement true:

a. 27 ≡5 (mod m)

Answer: m = 1, 2, 11, 22

b. 1000 ≡1(mod m)

Answer: 1, 3, 9, 27, 37, 111, 333, 999

c. 1331≡ 0(mod m)

Answer: m = 1, 11, 121, 1331

2. Show that if a is an even integer, then a 2 ≡0 (mod 4 ), and if a is odd integer, then a 2 ≡1( mod 4).

Solution:
Let a = 2x be an even integer.

a 2 ≡0 (mod 4 )

( 2 x )2 ≡0 (mod 4)

4 x2 ≡0 (mod 4 )
Since a 2=4 x 2 then we can say that a2 is a multiple of 4. Therefore a 2 ≡0 (mod 4 ).//

Let a = 2x – 1 be an odd integer.

a 2 ≡1( mod 4)

( 2 x−1 )2 ≡1( mod 4)

4 x2 −4 x +1 ≡1(mod 4)

4 ( x 2−x ) +1≡ 1(mod 4 )

4 p +1≡ 1(mod 4 ) For some p ϵ Z .

Since 4p is a multiple of 4 and adding 1 to it will result to a remainder of 1.

Therefore, a 2 ≡1( mod 4).

6. Show that if a, b, c, and m are integers such that c>0, m>0, and a ≡ b(mod m), then

ac ≡bc (mod mc).

Solution:

b = a + mq For some q ϵ Z .

c(b = a + mq)
bc = ac + mcq

Therefore, ac ≡bc (mod mc).//

7. Show that if a, b, and c are integers with c>0 such that a ≡ b(mod c) then (a.c) = (b,c).

Solution:

Let a, b, c be integers, c > 0, and a ≡ b(mod c)

Then there exists an integer k such that a ≡ b+kc .

Let d 1=(a , c) and d 2=(b , c )

Then there exists r, s, t and w such that:

a=r d 1, c=s d 1, b=t d 2 and c=w d 2.

It follows that r d 1=b+ ks d 1, so b=d 1 (r−ks) and so d 1∨b . But d 1∨c, so d 1∨( b , c ) =d 2.

Similarly, we have a=t d 2 +kw d 2, so a=d 2 (t+ kw), and so d 2∨a. But d 2∨c, so d 2∨( a , c ) =d 1.

Therefore, d 1=d 2. That is ( a , c )=(b , c) .

8. Show that if a j ≡ b j (mod m) for j = 1, 2, ….., n, where m is a positive integer and aj, bj, j = 1,2,.., n, then;
n n
a. ∑ a j ≡ ∑ b j
j=1 j=1

Solution:
We proceed by mathematical induction on n. It is clearly true for n = 1 because the sum will
be just aj and bj which is stated as an assumption. This completes the basis step.
n n
For the inductive test, we assume that ∑ a j =∑ b j (mod m)
j=1 j=1

And let a n+1 ≡ bn +1 (mod m) .

Now,
n +1

∑ a j =¿ ¿ by inductive
j=1

hypothesis. This completes the induction step and hence completes the proof.

18. Give a complete system of residues modulo 13 consisting entirely of odd integers.
Answer: 1, 3, 5, 7, 9, 11, 13, 15, 17, 19, 21, 23, 25

26. Find the least positive residue of:

b. 212 modulo 13
Solution:
24 mod 13 = 3
(24)3 mod 13 = 3
(3)3 mod 13 = 1
Therefore, the least positive residue of 212 modulo 13 is 1.
 d. 322 modulo 23
Solution:
311 mod 13 = 1
(311)2 mod 13 = 1
12 mod 13 = 1
Therefore, the least positive residue of 322 mod 13 is 1.

Problem Set #2
1. Find all the solutions of each of the following liner congruences.

b. 6 x ≡ 3(mod 9)

Solution:
Expressing into LDE.
6x – 9y = 3
2x – 3y = 1
Calculate the GCD.
gcd(2,-3) = 1 and 1|3.
Using the Euclidean Algorithm
-9 = -2(6) + 3
6 = 2(3) + 0
Applying the Extended Euclidean Algorithm.
All solutions: x = 2+3n

d. 15 x ≡ 9(mod 25)

Solution:
Expressing into LDE.
15x – 25y = 9
Calculate the GCD.
gcd(15,-25) = 5

5 ∤9 , therefore, there is no solution on the linear congruence 15 x ≡ 9(mod 25).

e. 128 x ≡ 833 ( mod 1001 )

Solution:
Expressing into LDE.
128x – 1001y = 833
Calculate the GCD.
gcd(128, -1001) = 1 and 1|833.
Using the Euclidean Algorithm.
-1001 = -8(128) + 23
128 = 5(23) + 13
 23 = 1(13) + 10
13 = 1(10) + 3
10 = 3(3) + 1
3 = 3(1) + 0
Applying the Extended Euclidean Algorithm.
1 = 1(10) + (-3)3
= -3(13) + 4(10)
= 4(23) + (-2)13
= -7(128) + 39(23)
= 39(-1001) + 305(128)
All solutions: x = 254 065 + 1001n.

2. Let a, b, and m be positive integers with a>0, m>0, and (a,m) = 1. The following method can be used to
solve for the linear congruence as ax ≡b (mod m) .

a. Show that if the integer x is a solution of ax ≡b (mod m) , then x is also a solution of the linear
congruence

m
a 1 x ≡−b [ ]
a
(mod m)

Where a1 is the least positive residue of m modulo a. Note that this congruence is of the
same type as the original congruence, with a positive integer smaller than a as the
coefficient of x.
Solution:
Because a1 is the least positive residue of m modulo a, we have m mod a = r. That is:

m
a 1=m− [ ]
a
a.

Then,

m
( [ ])
a 1 x ≡ m−
a
a x (mod m)

m
≡− [ ]
a
ax(mod m)

m
≡− [ ]
a
b (mod m) (Because x is a solution of a x ≡ b( mod m))

b. When the procedure if part (a) is iterated, one obtains a sequence of linear congruences with
coefficients of x equal to a0 = a > a1 > a2 > . . . Show that there is a positive integer n with a n = 1, so
that at the nth stage, one obtains a linear congruence x ≡ B (mod m) .

Solution:
We have a sequence of decreasing positive integers, which, by the well ordering property,
must have a least element, an. Then we can reduce m modulo an and get an an+1 which is smaller than
an. But an is the least positive element of the sequence, so a n+1 = 0, which is to say an|m. However,
m
because a 1=m−
a [ ]
a , we have that a common divisor of m and a 1 also divides a . Because ( a , m )=1

, then we have (a¿ ¿1 , m)=1¿ . By mathematical induction, (a n , m ¿=1, but we proved an|m,
therefore an=1.
 c. Use the method described in part (b) to solve the linear congruence 6 x ≡ 7(mod 23).

Solution:

23
We have a 1=23− [ ]
6
6=23−3 •6=5.

Then the new congruence is 5 x ≡−7 • 3≡ 2(mod 23).

23
Then a 2=23− [ ]
5
5=23−4 •5=3,

and the next congruence is 3 x ≡−2 • 4 ≡15( mod 23).

23
Then a 3=23− [ ]
3
3=23−7 •3=2,

and the next congruence is 2 x ≡−15 •7 ≡10 (mod 23).

23
Then a 4=23− [ ]
2
2=23−11• 2=1,

and the next congruence is x ≡−10• 11≡ 5(mod 23).

Thus, the answer is x ≡ 5(mod 23).

4. For which integer x with 0 ≤ c< 30 does the congruence 12 x ≡ c( mod 30) have solution? When there are
solutions, how many incongruent solutions are there?
Solution:

By Theorem 3.7, there is a solution of 12 x ≡ c ( mod 30 ) if and only if (12,30) = 6 divides c.

This holds for c ≡ 0, 6, 12, 18, and 24 (mod 30). In each of these cases there are (12, 30) = 6
incongruent solutions modulo 30.

5. Find the inverse of modulo 17 of:

a. 4
Answer: The inverse is 13.
d. 16
Answer: The inverse is still 16.

Problem Set #3
1. Find all the solutions of each of the following systems of congruences.

b. x ≡ 1(mod 2)
x ≡ 2(mod 3)
x ≡ 3(mod 5)

Solution:
Solve first the LCM (2, 3, 5) = M
M = 30
30 30 30
M 1= M 2= M 3=
2 3 5
= 15 = 10 =6
 15 y 1 ≡ 1(mod 2) y 1 ≡ 1¿

10 y 2 ≡ 1(mod 3) y 2 ≡ 1(mod 3)

6 y 3 ≡1(mod 5) y 3 ≡1(mod 5)
Hence;

x ≡ 1 ( 15 )( 1 ) +2 (10 )( 1 ) +3 ( 6 ) ( 1 ) (mod 30)

x ≡ 53(mod 30) or x ≡ 23(mod 30)
53 ≡1 ( mod 2 ) 23 ≡1 ( mod 2 )
53 ≡1 ( mod 3 ) 23 ≡1 ( mod 3 )
53 ≡1 ( mod 5 ) 23 ≡1 ( mod 5 )
d. x ≡ 2(mod 11)
x ≡ 3(mod 12)
x ≡ 4 (mod 13)
x ≡ 4 (mod 17)
x ≡ 5(mod 19)

Solution:

Solve first the LCM(11, 12, 13, 17, 19) = M

M = 554 256

554 256 554 256 554 256

M 1= M 2= M 3=
11 12 13

= 50 388 = 46 189 = 42 636

554 256 554 256

M 4= M 5=
17 19
= 32 604 = 29 172

50 388 y 1 ≡1( mod 11) y 1 ≡ 7(mod 11)

46 189 y 2 ≡1(mod 12) y 2 ≡ 1(mod 12)

42 636 y 3 ≡1(mod 13) y 3 ≡3(mod 13)

32 604 y 4 ≡1( mod17) y 4 ≡ 8(mod 17)

29 172 y 5 ≡1( mod19) y 5 ≡11( mod 19)

x ≡ 2 ( 50 388 ) ( 7 ) +3 ( 46 189 ) ( 1 ) +4 ( 42 636 ) (3 )+ 5 ( 32 604 )( 8 )

+6 ( 29 172 ) (11 ) (mod 554 268)
x ≡ 150 999 ( mod 554 268 )
Therefore,

150 999 ≡2(mod 11) 150 999 ≡5( mod 17)

150 999 ≡3( mod 12) 150 999 ≡6 (mod 19)
150 999 ≡ 4(mod 13)

4. Find a multiple of 11 that leaves a remainder of 1 when divided by each of the integers 2, 3, 5, and 7.
Solution:

x ≡ 1(mod 2) x ≡ 1(mod 7)
 x ≡ 1(mod 3) x ≡ 11(mod 0)
x ≡ 1(mod 5)
Solve the LCM(2, 3, 5, 7, 11) = M
M = 2 310
2310 2310 2310 2310 2310
M 1= M 2= M 3= M 4= M 5=
2 3 5 7 11
= 1 155 = 770 = 462 = 330 = 210

1 115 y 1 ≡1(mod 2) y 1 ≡ 1(mod 2)

770 y 2 ≡ 1(mod 3) 2 y 2 ≡1(mod 3)→ y 2 ≡ 2(mod 3)

462 y 3 ≡1(mod 5) 2 y 3 ≡ 1(mod 5)→ y 3 ≡ 3(mod 5)

330 y 4 ≡1(mod 7) y 4 ≡1( mod 7)

210 y 5 ≡ 1(mod 11) 2 y 5 ≡ 1(mod 11)→ y 5 ≡ 7(mod 11)

x ≡ 1 ( 1 155 ) (1 )+1 ( 770 ) ( 2 )+ 1 ( 462 )( 3 ) +1 ( 330 ) (1 )+ 0¿

x ≡ 2101( mod 2310)
Therefore, x = 2101.

9. Show that the system of congruence:

x ≡ a1 (mod m1 )

x ≡ a2 (mod m2 )
:

x ≡ ar (mod mr )
has a solution if and only if (m i,mj)|(ai – aj) for all pairs of integers (i,j) with 1 ≤i < j ≤ r . Show that if
a solution exists, then it is unique modulo [m 1, m2, …, mr]. (Hint: Use problem number 7 and
mathematical induction.
Solution:
Suppose we have the system of congruences

x ≡ a1 (mod m1 )

x ≡ a2 (mod m2 )
If x is a solution to the system of congruences, then x = a 1 + km1 for some integer k.
Inserting this expression into the second congruence, we get a 1+ k m1 ≡a 2(mod m 2) or
k m 1 ≡ ( a2 −a1 ) (mod m2 ), which has solution in k if and only if (m 1, m2)|(a2 - a1). Now assume
there is a solution k0. Then all incongruent solutions are given by k = k 0 + m2t/(m1, m2)
where t is an integer. Then:

x=a 1+ k m1

m2 t
(
¿ a1 + k 0 + m
( m1 , m2 ) 1 )
m1m
¿ a1 + k 0 m1 + 2
t
(m1 ,m 2 )

m1 m
Note that =|m1 , m2| so that if we set x1 = a1 + k0m1, we have
2

(m1 ,m2 )
 x=x 1 +|m1 , m2|t ≡ x 1 ¿ |m1 , m2|¿

and so the solution is unique modulo |m 1 , m2|. //

10. Using problem 9, solve the following systems of congruences:

a. x ≡ 5 ( mod 6 )

x ≡ 3 ( mod 10 )
x ≡ 8 ( mod 15 )
Answer: x = 23

d. x ≡ 2 ( mod 6 )

x ≡ 4 ( mod 8 )
x ≡ 2 ( mod14 )
x ≡ 14 ( mod 15 )
Answer: x = 44

15. A set of congruences to distinct moduli greater than one has the property that every integer satisfies at
least one of the congruences is called covering set of congruences.

a. Show that the set of congruences x ≡ 1(mod 4 ), x ≡ 1(mod 6), and x ≡ 11(mod 12) is a covering
set of congruences.
Solution:

We have x ≡ 0(mod 2) if x ≡ 0 , 2, 4 , 6 , 8∨10( mod 12),

x ≡ 0(mod 3) if x ≡ 0 , 3 ,6 ,∨9(mod 12),

x ≡ 1(mod 4 ) if x ≡ 1 ,5 ,∨9(mod 12),
x ≡ 1(mod 6) if x ≡ 1∨7(mod 12).

Because the only integers not covered by these four congruences are those x with
x ≡ 11(mod 12), adding this congruence modulo 12 to the other four congruences gives a
covering set of congruences.