Department of Mathematical Sciences

Final Term Exam of Logic and Discrete Structures

Date:- (Tuesday) January 15 2013
Name:-

Solve ALL Seven Questions.
Q1- [5 marks]
a) Prove that if n is an integer then n
4
n
2
is divisible by 4. (You are required to
provide direct proof by method of exhaustion.)
b) Prove that if x and y are two integers whose product is even, then at least one of
the two must be even. (You are required to use the contrapositive method.)
Q2- [6 marks]

a) Establish the validity of the following
arguments:
b) Show that the following argument is is
invalid by providing a counterexample:
i. p q
p s
q

s
_________

(p q)
ii. (p q) r
s

r
s p
_______

q
p (q r)

r
________

p q




Q3-[6 marks]
a) Prove that for all n > 0, 8
n
3
n
is divisible by 5.
b) Solve the recurrence relation A
n
+ A
n1
12A
n2
= 3
n
for n > 1, A
0
=0, A
1
= 1.
Q4-[6 marks]
a) Consider the congruence 48x 36 (mod 324). Find all solutions in the range
0 x < 324.
b) Solve the following system of linear congruences:
x 5 (mod 6)
x 6 (mod 7)
x 7 (mod 11)
Q5-[6 marks]
Starting with p = 7 and q = 13, find the values of e and d of RSA algorithm. Using
this information encrypt the integer 6.
Q6-[6 marks]
a) Let A = {1, 2, 3, 4} and R = {(1, 1), (1, 2), (1, 4), (2, 1), (2, 2), (3, 3), (4, 1),
(4, 4)}be a binary relation on A. Then
i. Decide whether the given relation R is reflexive, symmetric, and / or
transitive. Justify with reasons.
ii. Draw the directed graph of R.
iii. Write matrix representation of the given relation R on set A.

b) Draw the Hasse (POSET) diagram for the set A = {1, 2, 3, 5, 10, 15, 30} with
the relation R defined by R = {(a, b) | a is a divisor of b}. Is (A, R) a totally
ordered set? Justify with reasons.
Q7-[5 marks]
Find the values of (m) for m = 43, 221, 700, 2187, and 4096. Please note that the
symbol represents the Eulers Phi Function.