Theory of Computation

By: Assistant Professor Lok Nath Regmi

Assignment -1
Set, Relation, Function and Proof Techniques

1. Let R = {(a, c), (c, e), (e, e), (e, b), (d, b), (d, d)}. Draw directed graphs representing each
of the following.
a. R
b. R-1
c. RUR-1
d.
R∩R-1
2. Draw directed graphs representing relations of the following types.
a. Reflexive, transitive, and antisymmetric.
b. Reflexive, transitive, and neither symmetric nor antisymmetric.
2
𝑛 +𝑛
3. Show that for any 𝑛≥0 ; 1 + 2 + 3 + …………. + 𝑛 = 2
using mathematical
induction.
4. State and Prove the Pigeonhole Principle.
5. State and Prove the Diagonalization Principle.
6. Show that the set 2N is uncountable.
7. Show by induction that:
𝑛(𝑛+1)(𝑛+2)(𝑛+3 )
1. 2. 3 + 2. 3. 4…………. + 𝑛(𝑛 + 1)(𝑛 + 2) = 4
𝑓𝑜𝑟 𝑛≥0 .
4 2
8. Show by induction that n - 4n is divisible by 3 for all n >= O.
9. Is the transitive closure of the symmetric closure of a binary relation necessarily
reflexive? Prove it or give a counter example.
10. Prove the following statement by using mathematical induction: 1x1! + 2x2! + 3x3! +
............+nxn! = (n+1)!-1 where (n>=1).
11. Explain what an equivalence relation is. Show by induction that for
2 2 2 2 𝑛(𝑛+1)(2𝑛+1)
1 + 2 + 3 ….. + 𝑛 = 6
𝑓𝑜𝑟 𝑛≥0
1 1 1 1 𝑛
12. Prove that 2
+ 6
+ 12
+ ………… 𝑛(𝑛+1) = 𝑛+1 𝑓𝑜𝑟 𝑛≥0 using mathematical
induction.
13. Define countably infinite and uncountable sets with example. Use the principle of
𝑛
mathematical induction to prove 5 − 1 is divisible by 4 for all integer n>=0.
14. Justify that "The complement of diagonal set is different from each row sets." with the
help of diagonalization principle, show that if 3n+2 is odd then n is odd by using proof by
contradiction technique.
15. Write are the differences between reflexive relation and reflexive closure? Use
mathematical induction to show that 2n < n! for any positive integer n > 4.