Department of Mathematics

Dr. Mohammad Yasin

Winter 2023
Mathematics
for Computer Science Students (Math 105)
Assignment (3)
Name: ID: Tut. No.:T-

Instructions
1. Answer all questions on a PRINTOUT of this document.
2. Show all the details of your work for full credit.
3. Deadline: To be submitted on Monday, December 25, 2023. Assignment is to be
submitted to your TA in room S.212. No excuse policy for late submission.
4. Do not Copy any part of the solution from your colleague/internet. Cheating cases will be
graded zero!
Solve the following questions:
Problem 1: What are the quotient and remainder when
a) 19 is divided by 7? b) 0 is divided by 19?

c) −111 is divided by 11? d) 3 is divided by 5?

e) 789 is divided by 23? f) −1 is divided by 3?

g) 1001 is divided by 13? h) 4 is divided by 1?

 Problem 2:
I. What time does a 12-hour clock read
a) 80 hours after it reads 11:00? b) 40 hours before it reads 12:00?

II. What time does a 24-hour clock read

a) 100 hours after it reads 2:00? b) 45 hours before it reads 12:00?

III. Suppose that 𝑎 and 𝑏 are integers, 𝑎 ≡ 4 (𝐦𝐨𝐝 13), and 𝑏 ≡ 9 (𝐦𝐨𝐝 13). Find the
integer 𝑐 with 0 ≤ 𝑐 ≤ 12 such that
a) 𝑐 ≡ 9𝑎 (𝐦𝐨𝐝 13) b) 𝑐 ≡ 𝑎 + 𝑏 (𝐦𝐨𝐝 13)

c) 𝑐 ≡ 11𝑏 (𝐦𝐨𝐝 13) d) 𝑐 ≡ 2𝑎 + 3𝑏 (𝐦𝐨𝐝 13)

e) 𝑐 ≡ 𝑎2 + 𝑏 2 (𝐦𝐨𝐝 13) f) 𝑐 ≡ 𝑎3 − 𝑏 3 (𝐦𝐨𝐝 13)

IV. Evaluate these quantities.
a) −17 𝐦𝐨𝐝 2 b) 144 𝐦𝐨𝐝 7

c) −101 𝐦𝐨𝐝 13 d) 199 𝐦𝐨𝐝 19

e) 13 𝐦𝐨𝐝 3 f) −97 𝐦𝐨𝐝 11

V. Find the integer a such that

a) 𝑎 ≡ 43 (𝐦𝐨𝐝 23) 𝑎𝑛𝑑 − 22 ≤ 𝑎 ≤ 0 b) 𝑎 ≡ −11 (𝐦𝐨𝐝 21) 𝑎𝑛𝑑 90 ≤ 𝑎 ≤ 110.

VI. Decide whether each of these integers is congruent to 3 modulo 7.

a) 37 b) 66 c) −17 d) −67

Problem 4:
I. Find each of these values
a) (177 𝐦𝐨𝐝 31 + 270 𝐦𝐨𝐝 31) 𝐦𝐨𝐝 31 b) (192 𝐦𝐨𝐝 41) 𝐦𝐨𝐝 9
c) (323 𝐦𝐨𝐝 13)2 𝐦𝐨𝐝 11 d) (73 𝐦𝐨𝐝 23)2 𝐦𝐨𝐝 31

e) (212 𝐦𝐨𝐝 15)3 𝐦𝐨𝐝 22 f) (457 𝐦𝐨𝐝 23 · 182 𝐦𝐨𝐝 23) 𝐦𝐨𝐝 23

Problem 5
I. Find counterexamples to each of these statements about congruences.
a) If 𝑎𝑐 ≡ 𝑏𝑐 (𝐦𝐨𝐝 𝑚), where a, b, c, and m are b) If 𝑎 ≡ 𝑏(𝐦𝐨𝐝 𝑚) and 𝑐 ≡ 𝑑(𝐦𝐨𝐝 𝑚), where
integers with 𝑚 ≥ 2, then 𝑎 ≡ 𝑏 (𝐦𝐨𝐝 𝑚). a, b, c, d, and m are integers with c and d positive
and 𝑚 ≥ 2, then 𝑎𝑐 ≡ 𝑏𝑑 (𝑚𝑜𝑑 𝑚).

II. Determine whether each of these integers is prime.

a) 19 b) 101 c) 113

d) 27 e) 107 f) 93
III. Find the prime factorization of each of these integers.
a) 39 b) 81 c) 101

d) 143 e) 289 f) 899

IV. Determine whether the integers in each of these sets are pairwise relatively prime.
a) 11, 15, 19 b) 14, 15, 21 c) 12, 17, 31, 37

V. Which positive integers less than 30 are relatively prime to 30?

VI. The value of the Euler 𝜑-function at the positive integer 𝑛 is defined to be the number of
positive integers less than or equal to 𝑛 that are relatively prime to 𝑛. Find these values
of the Euler 𝜑-function.
a) 𝜑(4) b) 𝜑(10) c) φ(13)
Problem 6
I. What are the greatest common divisors of these pairs of integers? What is the least
common multiple of each pair?
a) 2 ∙ 33 ∙ 55 , 25 ∙ 33 ∙ 52
2 b) 2 ∙ 3 ∙ 5 ∙ 7 ∙ 11 ∙ 13, c) 2331 , 2317
211 ∙ 39 ∙ 11 ∙ 1714

II. Find 𝑔𝑐𝑑(1000, 625) and 𝑙𝑐𝑚(1000, 625) and verify that
𝑔𝑐𝑑(1000, 625) · 𝑙𝑐𝑚(1000, 625) = 1000 · 625.

III. If the product of two integers is 27 38 52 711 and their greatest common divisor is 23 34 5,
what is their least common multiple?

IV. Use the Euclidean algorithm to find

a) 𝑔𝑐𝑑(1, 5). b) 𝑔𝑐𝑑(100, 101).
c) 𝑔𝑐𝑑(1529, 14039). d) 𝑔𝑐𝑑(11111, 111111).

V. Find an inverse of 𝒂 modulo 𝒎 for each of these pairs of relatively prime integers
a) 𝑎 = 4, 𝑚 = 9 b) 𝑎 = 19, 𝑚 = 141

c) 𝑎 = 55, 𝑚 = 89 d) 𝑎 = 89, 𝑚 = 232

 Problem 7
I. Solve the congruence 4𝑥 ≡ 5 (𝐦𝐨𝐝 9)

II. Find all solutions, if any, to each of the following systems of congruences
a) 𝑥 ≡ 5 (𝐦𝐨𝐝 6), b) 𝑥 ≡ 7 (𝐦𝐨𝐝 9),
𝑥 ≡ 3 (𝐦𝐨𝐝 10), 𝑥 ≡ 4 (𝐦𝐨𝐝 12),
and 𝑥 ≡ 8 (𝐦𝐨𝐝 15)
and 𝑥 ≡ 16 (𝐦𝐨𝐝 21).