Scribd
Upload
111 views2 pages

Sms1103: Tutorial 5

This document contains 25 questions about modular arithmetic and congruences. The questions cover topics such as finding the least positive residue of integers modulo various numbers, determining if pairs of integers are congruent modulo a given number, proving statements about divisibility and congruences, and solving linear congruences.

Uploaded by

Muhammad Fairuz
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
111 views2 pages

Sms1103: Tutorial 5

This document contains 25 questions about modular arithmetic and congruences. The questions cover topics such as finding the least positive residue of integers modulo various numbers, determining if pairs of integers are congruent modulo a given number, proving statements about divisibility and congruences, and solving linear congruences.

Uploaded by

Muhammad Fairuz
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/ 2

SMS1103: TUTORIAL 5

Congruences

Question 1. [♦] Show that each of the following congruences holds.

(a) 13 ≡ 1 (mod 2) (b) −2 ≡ 1 (mod 3) (c) 22 ≡ 7 (mod 5)


(d) 22 ≡ 7 (mod 5) (e) −3 ≡ 30 (mod 11) (f) 91 ≡ 0 (mod 13)
[Write relationship above using m|a − b or a = b + km]

Question 2. [♦] Determine whether each of the following pairs of integers is congruent modulo 7.

(a) 1, 15 (b) −1, 8 (c) 0, 42 (d) −9, 5 (e) 2, 99 (f) −1, 699

Question 3. [♦] For which positive integers m is each of the following statement true?

(a) 27 ≡ 5 (mod m) (b) 1000 ≡ 1 (mod m) (c) 1331 ≡ 0 (mod m)

Question 4. [♦] Find the least positive residue modulo 13 of each of the following integers.

(a) 24 (b) 25 (c) 26 (d) 52 (e) 100 (f) −1000

Question 5. [♦] Find the least positive residue modulo 5 of each of the following:

(a) 24 (b) 25 + 6 (c) 26 + 7 + 8 + 2 (d) 27 (e) 67 + 4

Question 6. List

(a) three different sets of complete system of residue modulo 4, except {0, 1, 2, 3}.
(b) four different sets of complete system of residue modulo 5, all contains 1.
(c) a complete system of residues modulo 13 consisting entirely of odd integers.
(d) a complete system of residues modulo 7 consisting least absolute value.

Question 7. What time does a clock read: a) 29 hours after it reads 11 o’clock, b) 100 hours after it reads 2
o’clock and c) 50 hours before it reads 6 o’clock.

Question 8. Construct a table for i) addition, ii) subtraction and ii) multiplication, modulo 6.

Question 9. Find the least positive residues modulo 5 of each of the following integers.

(a) 25 (b) 28 (c) 210 (d) 250 (e) 21000

Question 10. Write the integer below as the sum of power of 2, e.g. 7 = 22 + 21 + 20 .

(a) 6 (b) 17 (c) 200 (d) 134 (e) 4567

Question 11. Find the least positive residues modulo 47 of each of the following integers.

(a) 232 (b) 247 (c) 2200 (d) 1782 × 2234 (e) 31162 (f) 12311798

Question 12. What is the least positive residue of 33100 (mod 32)?

1
Question 13. What’s the remainder when 52009 is divided by 11?

Question 14. Prove following assertions:


(a) 244 − 1 is divisible by 89.
(b) 21|4n+1 + 52n−1 using mathematical induction.
(c) 3|a(2a2 + 7) for arbitrary integer a.
(d) 28 divides 36n − 1 for any positive n.
(e) If a is an odd integer, then a2 ≡ 1 (mod 4).
(f) if n is a positive integer, then 4n ≡ 1 + 3n (mod 9). (mathematical induction)

Question 15. Prove the following facts: (a) If a ≡ b (mod n) and m|n, then a ≡ b (mod m). (b) If a ≡
b (mod n) and c > 0, then ac ≡ bc (mod cn).

Question 16. Give an example to show that a2 ≡ b2 (mod m) need not imply a ≡ b (mod m). What can you
conclude if a2 ≡ b2 (mod p), where a and b are integers and p is prime?

Question 17. Show that if n is an odd positive integers, then


1 + 2 + 3 · · · + (n − 1) ≡ 0 (mod n)
Is this statement true if n is even?

Question 18. Prove that every number is congruent to its two-digit ending modulo 100. Decompose 1110 − 1
using xn − 1 = (x − 1)(xn−1 + · · · + x + 1), and show that it is divisible by 100. What are the last two digits of
112000 ? (Hint: Write every number as N = an 10n + an−1 10n−1 + · · · + a1 · 10 + a0 , where ai are the digits.)

Question 19. You started a long mathematics exam at 2 : 00 p.m.. You were told that you could work as long
as you liked. You worked 487 hours straight. When did you finish? You must indicate morning or afternoon.

Question 20. Prove that if p is a prime greater than 3, then p2 ≡ 1 (mod 6). Using the result above, prove
that if p ≥ 5 is a prime number, then p2 + 2 is a composite.

Question 21. [*] Show that if n ≡ 3 (mod 4), then n cannot be the sum of the squares of two integers.
[Hint: Consider x2 + y 2 = n and all cases of x ≡? (mod 4) ...]

Question 22. [*] Prove that any integer of the form 8n + 1, where n ≥ 1, is composite. [Hint: 2n + 1|23n + 1,
factorizing polynomial.]

Question 23. Find the least positive residues of each of the following.

(a) 310 (mod 11) (b) 516 (mod 17) (c) 212 (mod 13)

[**] Note that for all prime modulo and (a, m) = 1, could you propose a theorem/conjecture from the above
congruences?

Question 24. Write 2x ≡ 3 (mod 5) in terms of equation.

Question 25. Given 5x ≡ 1 (mod 7), what is x? [Hint: Linear Diophantine Equation or Try and error]

Prepared by PCH, Updated November 3, 2015

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy