Chapter 1 Relations and Functions

Practice questions

Assertion (A): If f : R → R, f(x) = 2x and g : R → R, g(x) = x + 5, then (gof)⁻¹(y) = (y − 5)/2.
Reason (R): For invertible f and g, (gof)⁻¹ = g⁻¹of⁻¹.

  1. Both A and R are true, and R is the correct explanation of A
  2. Both A and R are true, but R is not the correct explanation of A
  3. A is true but R is false
  4. A is false but R is true
Answer and explanation

Answer: C

A is true: (gof)(x) = 2x + 5, whose inverse is (y − 5)/2. R is false: the correct rule is (gof)⁻¹ = f⁻¹og⁻¹. (Using g⁻¹of⁻¹ would give y/2 − 5, which is wrong.)

f : [1, ∞) → [2, ∞) is f(x) = x² − 2x + 3. What is f⁻¹(y)?

  1. 1 + √(y − 2)
  2. 1 − √(y − 2)
  3. √(y − 3) + 2
  4. √(y + 2) − 1
Answer and explanation

Answer: A

f(x) = (x − 1)² + 2. Put y = (x − 1)² + 2, so (x − 1)² = y − 2 and x − 1 = ±√(y − 2). Since x ≥ 1, take the + sign: x = 1 + √(y − 2). Check y = 6: x = 1 + 2 = 3 and f(3) = 9 − 6 + 3 = 6.

f : R → R, f(x) = (4x − 1)/3. What is f⁻¹(5)?

  1. 14/3
  2. 19/3
  3. 1/2
  4. 4
Answer and explanation

Answer: D

Solve (4x − 1)/3 = 5: 4x − 1 = 15, so x = 4. Check f(4) = 15/3 = 5. Equivalently f⁻¹(y) = (3y + 1)/4 gives (15 + 1)/4 = 4.

f : A → B and g : B → C are functions such that gof is one-one. Which statement must be true?

  1. g is one-one
  2. f is one-one
  3. f is onto
  4. g is onto
Answer and explanation

Answer: B

If f(x₁) = f(x₂), then g(f(x₁)) = g(f(x₂)), and gof being one-one gives x₁ = x₂. So f must be one-one. g need not be: g may squash values that f never produces.

If f(x) = (3x + 2)/(5x − 3) for x ≠ 3/5, what is (fof)(x)?

  1. (9x + 4)/(25x − 9)
  2. 1/x
  3. x
  4. f(x)²
Answer and explanation

Answer: C

f(f(x)): numerator 3(3x + 2)/(5x − 3) + 2 = (9x + 6 + 10x − 6)/(5x − 3) = 19x/(5x − 3). Denominator 5(3x + 2)/(5x − 3) − 3 = (15x + 10 − 15x + 9)/(5x − 3) = 19/(5x − 3). So (fof)(x) = 19x/19 = x.

If f(x) = x² + 1 and g(x) = 1/x (x ≠ 0), what is (gof)(2) − (fog)(2)?

  1. −1.05
  2. 0.2
  3. −1.25
  4. 0
Answer and explanation

Answer: A

(gof)(2) = g(f(2)) = g(5) = 1/5 = 0.2. (fog)(2) = f(g(2)) = f(1/2) = 1/4 + 1 = 1.25. Difference: 0.2 − 1.25 = −1.05.

Consider f : R − {3} → R − {1}, f(x) = (x − 2)/(x − 3). For which value of y is the equation f(x) = y impossible inside R − {3}?

  1. y = 0
  2. y = 2
  3. y = −1
  4. y = 1
Answer and explanation

Answer: D

Solve y(x − 3) = x − 2 ⇒ x(y − 1) = 3y − 2 ⇒ x = (3y − 2)/(y − 1). This fails only when y = 1 (then 0 = 1). That is why the co-domain is R − {1}; with that co-domain f is onto. For example y = 0 gives x = 2, y = 2 gives x = 4.

A = {1, 2, 3} and B = {a, b}. How many functions from A to B are onto?

  1. 8
  2. 2
  3. 6
  4. 9
Answer and explanation

Answer: C

There are 2³ = 8 functions in all. Only the two constant functions (everything to a, or everything to b) fail to be onto, so 8 − 2 = 6 are onto.

Which function is onto but NOT one-one?

  1. f : N → N, f(1) = 1 and f(n) = n − 1 for n ≥ 2
  2. f : N → N, f(n) = 2n
  3. f : R → R, f(x) = 3x
  4. f : Z → Z, f(x) = x²
Answer and explanation

Answer: A

f(1) = f(2) = 1, so not one-one. Every natural number m is reached as f(m + 1) = m, so it is onto. 2n on N misses odd numbers; 3x on R is bijective; x² on Z is neither.

Assertion (A): The relation 'is parallel to' on the set of all lines in a plane, where every line is taken as parallel to itself, is an equivalence relation.
Reason (R): The relation 'is perpendicular to' on the set of lines in a plane is symmetric.

  1. Both A and R are true, and R is the correct explanation of A
  2. Both A and R are true, but R is not the correct explanation of A
  3. A is true but R is false
  4. A is false but R is true
Answer and explanation

Answer: B

A is true: with each line parallel to itself it is reflexive, and parallelism is symmetric and transitive. R is also true (if l ⊥ m then m ⊥ l), but a fact about perpendicular lines does not explain why parallelism is an equivalence relation.

How many equivalence relations on the set {a, b, c, d} contain the pair (a, b)?

  1. 2
  2. 4
  3. 5
  4. 15
Answer and explanation

Answer: C

Equivalence relations correspond to partitions, and (a, b) in the relation means a and b share a piece. Treat {a, b} as one block and partition the three objects {a, b}, c, d: all separate; {a, b} with c; {a, b} with d; c with d; all together. That gives 5. (15 counts all partitions of a four-element set, without the condition.)

In Z, R = {(a, b) : 4 divides a − b}. How many distinct equivalence classes does R have, and is 22 in [−2]?

  1. 4 classes; yes
  2. 4 classes; no
  3. 2 classes; yes
  4. Infinitely many classes; no
Answer and explanation

Answer: A

Classes are the remainders 0, 1, 2, 3 on division by 4, so there are 4. 22 − (−2) = 24 = 4 × 6, so 22 R −2 and 22 ∈ [−2].

In the set R of real numbers, S = {(a, b) : a ≤ b²}. Which is a valid counterexample showing S is not reflexive?

  1. a = 2, since 2 ≤ 4
  2. a = 0, since 0 ≤ 0
  3. a = −1, since −1 ≤ 1
  4. a = 1/2, since 1/2 > 1/4
Answer and explanation

Answer: D

Reflexive would need a ≤ a² for every real a. For a = 1/2, a² = 1/4 and 1/2 > 1/4, so (1/2, 1/2) ∉ S. The other choices all satisfy a ≤ a², so they do not disprove anything.

R is the relation in N given by R = {(a, b) : a + b = 10}. Which property does R have?

  1. Reflexive
  2. Transitive
  3. Symmetric
  4. None of the three
Answer and explanation

Answer: C

If a + b = 10 then b + a = 10, so R is symmetric. Not reflexive: (1, 1) ∉ R since 1 + 1 ≠ 10. Not transitive: (1, 9) and (9, 1) are in R but (1, 1) is not.

In the set {1, 2, 3, 4}, R = {(1, 1), (2, 2), (3, 3), (4, 4), (1, 3), (3, 1), (2, 4)}. Which statement is correct?

  1. R is an equivalence relation
  2. R is reflexive and transitive but not symmetric
  3. R is reflexive and symmetric but not transitive
  4. R is symmetric and transitive but not reflexive
Answer and explanation

Answer: B

All four (a, a) are present, so R is reflexive. (2, 4) ∈ R but (4, 2) ∉ R, so it is not symmetric. Chains: (1, 3),(3, 1) give (1, 1) ✓; (3, 1),(1, 3) give (3, 3) ✓; (2, 2),(2, 4) give (2, 4) ✓; (2, 4),(4, 4) give (2, 4) ✓; chains with (1, 1) or (3, 3) return pairs already present. So it is transitive.

Assertion (A): f : R → R, f(x) = x² is not invertible.
Reason (R): A function is invertible only if it is one-one and onto.

  1. Both A and R are true, and R is the correct explanation of A
  2. Both A and R are true, but R is not the correct explanation of A
  3. A is true but R is false
  4. A is false but R is true
Answer and explanation

Answer: A

R is the key theorem. f(2) = f(−2) = 4, so f is not one-one (and negative numbers are never reached), so by R it has no inverse. Both are true and R explains A.

If f and g are invertible functions from R to R with f(x) = x − 1 and g(x) = 2x, what is (gof)⁻¹(8)?

  1. 3
  2. 7
  3. 5
  4. 4.5
Answer and explanation

Answer: C

(gof)⁻¹ = f⁻¹og⁻¹. g⁻¹(8) = 8/2 = 4, then f⁻¹(4) = 4 + 1 = 5. Check: (gof)(5) = g(4) = 8.

f : R − {1} → R − {2} is given by f(x) = (2x + 3)/(x − 1). What is f⁻¹(y)?

  1. (y + 3)/(y − 2)
  2. (y − 3)/(y + 2)
  3. (2y + 3)/(y − 1)
  4. (y − 2)/(y + 3)
Answer and explanation

Answer: A

y(x − 1) = 2x + 3 ⇒ yx − y = 2x + 3 ⇒ x(y − 2) = y + 3 ⇒ x = (y + 3)/(y − 2), defined for y ≠ 2. Check with x = 2: f(2) = 7, and (7 + 3)/(7 − 2) = 2.

Which function is invertible as written?

  1. f : R → R, f(x) = x²
  2. f : R → R, f(x) = x³ + 1
  3. f : R → R, f(x) = |x|
  4. f : R → R, f(x) = 5
Answer and explanation

Answer: B

x³ + 1 is one-one (x₁³ = x₂³ ⇒ x₁ = x₂) and onto (x = ∛(y − 1)), so it is bijective and invertible. x² and |x| are not one-one on R; a constant function is neither one-one nor onto.

If f : R → R, f(x) = 4x + 5, what is f⁻¹(x)?

  1. (x + 5)/4
  2. 4x − 5
  3. 1/(4x + 5)
  4. (x − 5)/4
Answer and explanation

Answer: D

Put y = 4x + 5, so x = (y − 5)/4. Hence f⁻¹(x) = (x − 5)/4. Check: 4 × (x − 5)/4 + 5 = x.

Privacy · Terms · Refunds · Delivery