Final Exam

Discrete Mathematics

Problem 1: (15+10)

 Prove that the Harmonic series is θ¿

 Show that the cardinality of Rational Numbers is Countably Infinite.

Problem 2: (10+10)

 Describe the recursive implementation of Euclidean GCD(a,b) algorithm.

 Prove that the complexity of GCD(a,b) is θ ¿, where n is largest of a and b.

Problem 3 (10+10+10+10)
 Find the GCD of 92 and 36
 Express the GCD of part (1) in the linear combination of 92 and 36
 In mod 25 find the inverse of 16 (Hint: using extended GCD)
 Find 229900 mod 499, where 499 is a prime
(Hint: You may Use Fermat’s Little theorem, if you know any method better then
that… let us know  )

Problem 4
 Prove the prime numbers are infinite
 Let n be a positive integer. Show that every 2n x 2n chessboard with one square
removed can be tiled using right triominoes, where these pieces cover three
squares at a time, as shown in Figure
Problem 5