Scribd
Upload
158 views

Tutorial Discrete Maths

This document is a tutorial for a discrete structures course. It contains 6 questions on number theory concepts: 1) Evaluating quantities using modulo arithmetic. 2) Finding prime factorizations of integers. 3) Determining if sets of integers are pairwise relatively prime. 4) Finding greatest common divisors (GCD) of pairs of integers. 5) Finding least common multiples (LCM) of pairs of integers. 6) Using the Euclidean algorithm to find the GCD of pairs of integers and expressing it as a linear combination.

Uploaded by

Nur Ayinn
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
158 views

Tutorial Discrete Maths

This document is a tutorial for a discrete structures course. It contains 6 questions on number theory concepts: 1) Evaluating quantities using modulo arithmetic. 2) Finding prime factorizations of integers. 3) Determining if sets of integers are pairwise relatively prime. 4) Finding greatest common divisors (GCD) of pairs of integers. 5) Finding least common multiples (LCM) of pairs of integers. 6) Using the Euclidean algorithm to find the GCD of pairs of integers and expressing it as a linear combination.

Uploaded by

Nur Ayinn
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
You are on page 1/ 7

Discrete Structures MTK3013

TURIAL 7 (60 MARKS)

1. Evaluate these quantities.


[5 marks]

a. 12 mod 3

b. 147 mod 19

c. -98 mod 11

d. -201 mod 23

e. -5 mod 10

Tutorial 7 (Number Theory) Semester 1 Session 2017/2018


Discrete Structures MTK3013

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


[10 marks]

a. 87

b. 124

c. 724

d. 1001

e. 1111

Tutorial 7 (Number Theory) Semester 1 Session 2017/2018


Discrete Structures MTK3013

3. Determine whether the integers in each set are pairwise relatively prime.
[5 marks]

a. 12, 15

b. 14, 15, 21

c. 11, 15, 31, 37

d. 7, 8, 21, 11

e. 13, 36, 98

Tutorial 7 (Number Theory) Semester 1 Session 2017/2018


Discrete Structures MTK3013

4. Determine the greatest common divisor (gcd) of these pairs of integers.


[10 marks]

a. 38  53 72, 211  35 58 17

b. 2331, 2311

c. 41  43  532, 41  436  53

Tutorial 7 (Number Theory) Semester 1 Session 2017/2018


Discrete Structures MTK3013

d. 33  57, 22  72

e. 1133, 0

5. Determine the least common multipliers (lcm) of these pairs of integers.


[10 marks]

a. lcm (12, 18)

Tutorial 7 (Number Theory) Semester 1 Session 2017/2018


Discrete Structures MTK3013

b. lcm (111, 201)

c. lcm (35  5  73, 211  31 52 17)

d. lcm (211, 1)

e. lcm (11, 25)

Tutorial 7 (Number Theory) Semester 1 Session 2017/2018


Discrete Structures MTK3013

6. By using Euclidean algorithm, find the gcd of the following pairs of integers. Then,
express the gcd as a linear combination of the pairs of integers.

a. gcd (116, 2040)


b. gcd (3279, 2073)
c. Find s and t for (a) and (b)

[20 marks]

Tutorial 7 (Number Theory) Semester 1 Session 2017/2018

You might also like