Theory of Computation

Problem Sheet 1
August 03, 2017

1. Find the range of the following functions. Assume that x e R.

(a) y = 3 + 4x 9; x e ( 94 , )
(b) y = x2 + 6x 1; x e (, )
(c) y = | x214 |; x e (, ) {2, 2}
1
3x 4 |; x e ( , ) { 3 }
(d) y = | 3x 4

2. For each of the following cases find, if possible, the domain, co-domain and rule of assign-
ment for g f and f g:

(a) f : N R, f (n) = n + 1; g : R R, g( x ) = 3 x.
(b) f : Z Z, f ( x ) = x; g : R R, g( x ) = sin x.
(c) f : R R, f ( x ) = 3x; g : R R, g( x ) = 3x .

3. Which of the following functions are oneone, onto, or bijective? Justify your answer.
(a) f : R R, f ( x ) = sin x.
(b) g : N N, g(n) = n + 1.
(c) h : N N0 , h(n) = n + 1.
(d) r : R {0}, r ( x ) = 0.
(e) y : N N, y(n) = n3
 

(f) p : R2 R, p( x, y) = x2 + y2 .

4. Suppose | A| = m and | B| = n. How many functions are there from A to B? Of these, how
many are:
(a) one-one
(b) onto
(c) bijective

5. Let A = { x | x e R and x 2} and B = { x | x e R and x 1}. Let f : A B be defined

by f ( x ) = x2 4x + 5. Prove that f is a bijective function. Also, list all possible ways to
modify A and B such that f is not a bijection.

6. Inverse of a function: Let f : A B and g : B A be functions; g is called the inverse

of f , denoted by f 1 , if g( f ( x )) = x for all x e A. Prove that:
(a) If f , g are functions and f g is onto, then f must be onto.
(b) If f : A B has an inverse function then the inverse is unique.
(c) The composition of two bijections is a bijection.
(d) The inverse of a bijection is a bijection.