Scribd
Upload
5 views

Tutorials Week 7

RMIT

Uploaded by

Voldemort
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
5 views

Tutorials Week 7

RMIT

Uploaded by

Voldemort
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

MATH2448: Discrete Mathematics

1
Lecturer: Dr Nguyen Hieu Thao
Email: [email protected]

Tutorial Exercises: Number Theory


(2024C, Week 7)1

1. Find the prime factorization of 11!.

2. Find the greatest common divisor of 32 · 11 and 23 · 5 · 7.

3. Let a, b and c be integers. Prove that if a | b and b | c, then a | c.

4. How many bits are needed to represent each integer?

(a) 128 (b) 21000 (c) 3481 (d) 6.87 · 1048

5. Express the binary number 11111111 in decimal.

6. Express the decimal number 1024 in binary.

7. Add the two binary numbers 110110 + 101101.

8. Express each hexadecimal number in decimal and in binary.

(a) 3A (b) A03

9. Add the two hexadecimal numbers 4A + B4.

10. Express the octal number 7643 in decimal.

11. Consider the base 6 number system using the six symbols A, B, C, D, E and F , which
represent the values 0, 1, 2, 3, 4 and 5, respectively.

(a) Convert the base 6 number BAF to a decimal number.

(b) Convert the decimal number 137 to a base 6 number.

1 Most of the content of this document is taken from the book [1].
2

12. Let S be the set of all nonempty strings on the alphabet {0, 1}, each of which represents a
binary number. Consider the function f : S → S given by

w 7→ f (w) = w01, for every string w ∈ S,

where w01 is the concatenation of the two strings w and 01.

(a) Compute the string value f (0101010). What is the decimal value of the binary number
represented by f (0101010)?
(b) Is f an injective and/or a surjective? Justify your answers.

13. Write the recursive version of the Euclidean algorithm.

14. Reformulate the Euclidean algorithm as a recurrence relation.

15. Consider the key defined as characters

_ABCDEF GHIJKLM N OP QRST U V W XY Z

replaced correspondingly by

EIJF U AXV HW P _GSRKOBT QY DM LZN C.

(a) Encrypt the message ‘COOL’.


(b) Decrypt the message ‘UTWR’.

16. Assume that for an RSA public-key crptosystem, we choose primes p = 17, q = 23 and
e = 31. Refer to the notation system in Notes Week 7.

(a) Compute n.
(b) Compute φ(n).
(c) Compute d.
(d) Encrypt 101 using the public key (e, n).
(e) Decrypt 250 using the private key (d, n).

17. Prove the correctness of RSA public-key cryptosystem - the theorem in Notes Week 7.

References
1. Johnsonbaugh, R.: Discrete Mathematics - Eighth Edition. Pearson Education, New York
(2018).

You might also like