Scribd
Upload
157 views

TMF1814 Tutorial 4

This document provides a tutorial on discrete mathematics concepts including: 1) Divisibility and modular arithmetic problems involving integers, remainders, and clock times. 2) Prime factorization and properties of prime numbers. 3) Using the Euclidean algorithm to find greatest common divisors (GDCs). 4) Propositional logic expressions and truth tables, including logical connectives and conditional statements. 5) Converse, contrapositive and inverse of conditional statements.

Uploaded by

Woo Zhenghan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
157 views

TMF1814 Tutorial 4

This document provides a tutorial on discrete mathematics concepts including: 1) Divisibility and modular arithmetic problems involving integers, remainders, and clock times. 2) Prime factorization and properties of prime numbers. 3) Using the Euclidean algorithm to find greatest common divisors (GDCs). 4) Propositional logic expressions and truth tables, including logical connectives and conditional statements. 5) Converse, contrapositive and inverse of conditional statements.

Uploaded by

Woo Zhenghan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

TMF1814 DISCRETE MATHEMATICS TUTORIAL 4 S1 2016/2017

TMF1814 DISCRETE MATHEMATICS


TUTORIAL 4

3.1 Divisibility and Modular Arithmetic

1. Show that if a,b,c and d are integers, where a ≠ 0,such that a|c and b|d, then ab|cd.

2. What are the quotient and remainder when


a. 44 is divided by 8?
b. 777 is divided by 21?
c. -123 is divided by 19?
d. -1 is divided by 23?

3. What time does a 12-hour clock read


a. 80 hours after it reads 11:00?
b. 40 hours before it reads 12:00?
c. 100 hours after it reads 6:00?

4. Suppose that a and b are integers, a ≡ 4 (mod 13), and b ≡ 9 (mod 13). Find the
integer c with 0 ≤ c ≥ 12 such that
a. c ≡ 9a (mod 13)
b. c ≡ 11b (mod 13)
c. c ≡ a + b (mod 13)
d. c ≡ 2a + 3b (mod 13)
e. c ≡ a2 + b2 (mod 13)
f. c ≡ a3 − b3 (mod 13)

4.2 Prime and Greatest Common Divisors

5. Find the prime factorization of each of these integers.


a. 88
b. 126
c. 729
d. 1001
e. 1111
f. 909,090

1
TMF1814 DISCRETE MATHEMATICS TUTORIAL 4 S1 2016/2017

6. Determine whether each of these integers is prime, verifying some of Mersenne’s


claims.
a. 27 − 1
b. 29 − 1
c. 211 − 1
d. 213 − 1

7. Find gcd(1000, 625) and lcm(1000, 625) and verify that gcd(1000, 625) · lcm(1000, 625)
= 1000 · 625.

8. Use the Euclidean algorithm to find


a. gcd(12, 18).
b. gcd(111, 201).
c. gcd(1001, 1331).
d. gcd(12345, 54321).

4.1 Propositional Logic

9. Let p, q, and r be the propositions


p: you have the flu
q: you miss the final examination
r: you pass the score

Express each of these propositions as an English sentence


a) p  q
b) q  r
c) q  r
d) p  q  r
e)  p  r   q  r 
f)  p  q  q  r 

10. Determine whether these biconditionals are true or false.

a) 2 + 2 = 4 if and only if 1 + 1 = 2.
b) 1 + 1 = 2 if and only if 2 + 3 = 4.
c) 1 + 1 = 3 if and only if monkeys can fly.
d) If monkeys can fly, if 2 > 1.

2
TMF1814 DISCRETE MATHEMATICS TUTORIAL 4 S1 2016/2017

11. Construct a truth table for each of these compound propositions.


a. p  p
b. p  q

c. p  q

d.  p  q  r
e.  p  q  r
f.  p  q  r
g.  p  q  r

12. State the converse, contrapositive, and inverse of each of these conditional statements.
a. If it snows tonight, then I will stay at home.
b. I go to the beach whenever it is a sunny summer day.
c. When I stay up late, it is necessary that I sleep until noon.

13. Construct a truth table for each of these compound propositions.


a. p ⊕ (p ∨ q)
b. (p ∧ q) → (p ∨ q)
c. (q →¬p) ↔ (p ↔ q)
d. (p ↔ q) ⊕ (p ↔¬q)

You might also like