Xam Idea Solutions Class 12 Maths Chapter 1 Relations And Functions Long Answer Questions I

Step-by-Step Solutions for Class 12 Mathematics Chapter 01 Relations And Functions

Review structured textbook solutions for Class 12 Mathematics Chapter 01 Relations And Functions prepared by . Built according to modern educational guidelines for the 2026 academic year, these downloadable answers support daily revision and mathematical accuracy.

Download Chapter 01 Relations And Functions Textbook Solutions PDF

View or download the dedicated Chapter 01 Relations And Functions solution resource below. Engaging with these textbook answers under focused study conditions ensures continuous academic progress and mastery of the 2026 curriculum for Mathematics.

Long Answer Questions I

Question 1. Consider the binary operation * on the set {1, 2, 3, 4, 5} defined by a * b = min. {a, b}. Write the operation table of the operation *.

Solution.

Required operation table of the operation * is given as

*

Teacher's Note: An operation table for min lists the smaller of each pair of elements in every cell.

Exam Note: Draw the full table with elements on both axes.

Question 2. Let T be the set of all triangles in a plane with R as relation in T given by R = {(T1, T2) : T1 ≅ T2}. Show that R is an equivalence relation.

Solution.

We have the relation, R = {(T1, T2) : T1 ≅ T2}

Reflexivity: As Each triangle is congruent to itself,

i.e., T1 ≅ T2 ∀ T1 ∈ T

Thus, R is reflexive.

Symmetry: Let T1, T2 ∈ T, such that

(T1, T2) ∈ R ⇒ T1 ≅ T2

T2 ≅ T1 ⇒ (T2, T1) ∈ R

i.e., R is symmetric.

Transitivity: Let T1, T2, T3 ∈ T, such that (T1, T2) ∈ R and (T2, T3) ∈ R

⇒ T1 ≅ T2 and T2 ≅ T3

⇒ T1 ≅ T3 ⇒ (T1, T3) ∈ R i.e., R is transitive.

Hence, R is an equivalence relation.

Teacher's Note: Equivalence needs reflexive, symmetric and transitive properties, all of which congruence of triangles has.

Exam Note: Prove all three properties, then conclude.

Question 3. Let Z be the set of all integers and R be relation on Z defined as R = {(a, b) : a, b ∈ Z and is divisible by 5}. Prove that R is an equivalence relation.

Solution.

Given R = {(a, b) : a, b ∈ Z and (a – b) is divisible by 5}

Reflexivity: ∀ a ∈ Z

a – a = 0 is divisible by 5

⇒ (a, a) ∈ R ∀ a ∈ Z

Hence, R is reflexive.

Symmetry: Let (a, b) ∈ R ⇒ a – b is divisible by 5

⇒ – (b – a) is divisible by 5

⇒ (b – a) is divisible by 5

⇒ (b, a) ∈ R

Hence, R is symmetric. Transitivity: Let (a, b), (b, c) ∈ R

⇒ (a – b) and (b – c) are divisible by 5

⇒ (a – b + b – c) is divisible by 5

⇒ a – c is divisible by 5

⇒ (a, c) ∈ R

Hence, R is transitive.

Thus, R is an equivalence relation.

𝟒𝒙

Teacher's Note: Divisibility of a minus b by 5 is checked through reflexivity, symmetry and transitivity.

Exam Note: Write each property with reason, then conclude.

Question 4. Let A = R × R and * be the binary operation on A defined by (a, b) * (c, d) = (a + c, b + d). Show that * is commutative and associative. Find the identity element for * on A, if any.

Solution.

For Commutativity

Let (a, b), (c, d) ∈ R × R

(a, b) * (c, d) = (a + c, b + d) and (c, d) * (a, b) = (c + a, d + b)

= (a + c, b + d) [∵ Commutative law holds for real number]

⇒ (a, b) * (c, d) = (c, d) * (a, b) Hence, * is commutative

For Associativity

Let (a, b), (c, d) and (e, f) ∈ R × R

((a, b) * (c, d)) * (e, f) = (a + c, b + d) * (e, f) = (a + c + e, b + d + f)

(a, b) * ((c, d) * (e, f)) = (a, b) * (c + e, d + f) = (a + c + e, b + d + f)

((a, b) * (c, d)) * (e, f)) = (a, b) * ((c . d) * (e, f ))

∴ * is associative

Let (e1, e2) be identity

⇒ (a, b) * (e1, e2) = (a, b) ⇒ (a + e1 , b + e2) = (a, b)

⇒ a + e1 = a and b + e2 = b ⇒ e1 = 0, e2 = 0

(0, 0) ∈ R × R is the identity element.

Teacher's Note: Componentwise addition inherits commutativity and associativity from real numbers; the identity comes from solving the identity condition.

Exam Note: Show both laws stepwise, then solve for identity.

Question 5. Given a non-empty set X. Let * : P(X) × P(X) → P(X) defined as A * B = (A – B) ∪ (B – A) ∀ A, B ∈ P(X). Show that the empty set Φ is the identity for the operation * and all the elements A of P(X) are invertible with A–1 = A.

Solution.

Here operation ‘*‘ is defined as

* : P(X) × P(X) → P(X) such that A * B = (A – B) ∪ (B – A) ∀ A, B ∈ P(X)

Existence of identity:

Let E ∈ P(X) be identity for ‘*‘ in set P(X)

⇒ A * E = A = E * A

⇒ (A – E) ∪ (E – A) = A = (E – A) ∪ (A – E) It is possible only when E = Φ, Because

(A – Φ) ∪ (Φ – A) = A ∪ Φ = A and (Φ – A) ∪ (A – Φ) = Φ ∪ A = A

Hence, Φ is identity element.

Existence of inverse:

Let A–1 be the inverse of A for ‘*‘ on set P(X).

∴ A * A–1 = Φ = A–1 * A ⇒ (A – A–1) ∪ (A–1 – A) = Φ

⇒ A – A–1 = Φ = A–1 – A = Φ ⇒ A ⊂ A–1 and A–1 ⊂ A

⇒ A = A–1

Hence, each element of P(X) is inverse of itself.

Teacher's Note: Symmetric difference has the empty set as identity, and each set is its own inverse.

Exam Note: Verify identity and inverse from the definition.

Question 6. Show that the relation R on the set A of points in a plane, given by R = {(P, Q) : Distance of the point P from the origin = Distance of point Q from origin} is an equivalence relation. Further, show that the set of all points related to a point P ≠ (0, 0) is the circle passing through P with origin as centre.

Solution.

If O be the origin, then

R = {(P, Q) : OP = OQ}

Reflexivity: ∀ point P ∈ A

OP = OP ⇒ (P, P) ∈ R

i.e., R is reflexive.

Symmetry: Let P, Q ∈ A, such that (P, Q) ∈ R

OP = OQ ⇒ OQ = OP ⇒ (Q, P) ∈ R

i.e., R is symmetric.

Transitivity: Let P, Q, S ∈ A, such that (P, Q) ∈ R and (Q, S) ∈ R

OP = OQ and OQ = OS OP = OS ⇒ (P, S) ∈ R

i.e., R is transitive.

Now we have R is reflexive, symmetric and transitive.

Therefore, R is an equivalence relation.

Let P, Q, R... be points in the set A, such that

(P, Q), (P, R)... ∈ R

⇒ OP = OQ; OP = OR; ... [where O is origin]

⇒ OP = OQ = OR = ...

i.e., All points P, Q, R ... ∈ A, which are related to P are equidistant from origin ‘O’.

Hence, set of all points of A related to P is the circle passing through P, having origin as centre.

Teacher's Note: Equal distance from the origin gives an equivalence relation, with related points forming a circle.

Exam Note: Prove three properties, then identify the circle.

Question 7. Show that the relation R in the set N × N defined by (a, b) R (c, d) if a² + d² = b² + c² ∀ a, b, c, d ∈ N, is an equivalence relation.

Solution.

Given, R is a relation in N × N defined by (a, b) R (c, d) ⇒ a² + d² = b² + c²

Reflexivity: ∵ a² + b² = b² + a² ∀ a, b ∈ N ⇒ (a, b) R (a, b) ⇒ R is reflexive

Symmetry: Let (a, b) R (c, d) ⇒ a² + d² = b² + c² ⇒ b² + c² = a² + d² ⇒ c² + b² = d² + a² ⇒ (c, d) R (a, b) ⇒ R is symmetric

Transitivity: Let (a, b) R (c, d) and (c, d) R (e, f) ⇒ a² + d² = b² + c² and c² + f² = d² + e² ⇒ a² + d² + c² + f² = b² + c² + d² + e² ⇒ a² + f² = b² + e² ⇒ (a, b) R (e, f) ⇒ R is transitive.

Hence, R is an equivalence relation.

Teacher's Note: Show R is reflexive, symmetric and transitive.

Exam Note: Check all three properties separately.

Question 8. Consider f : R₊ → [–9, ∞) given by f(x) = 5x² + 6x – 9. Prove that f is invertible with f⁻¹(y) = (√(54 + 5y) – 3)/5.

Solution.

To prove f is invertible, it is sufficient to prove f is one-one onto. Here, f(x) = 5x² + 6x – 9.

One-one: Let x₁, x₂ ∈ R₊, then f(x₁) = f(x₂) ⇒ 5x₁² + 6x₁ – 9 = 5x₂² + 6x₂ – 9 ⇒ 5(x₁² – x₂²) + 6(x₁ – x₂) = 0 ⇒ (x₁ – x₂)(5x₁ + 5x₂ + 6) = 0 ⇒ x₁ = x₂ [∵ 5x₁ + 5x₂ + 6 ≠ 0], i.e., f is one-one function.

Onto: Let f(x) = y ∴ y = 5x² + 6x – 9 ⇒ 5x² + 6x – (9 + y) = 0 ⇒ x = [–6 ± √(36 + 20(9 + y))]/10 = [–6 ± √(216 + 20y)]/10 = (√(54 + 5y) – 3)/5 [∵ x ∈ R₊]

Obviously, ∀ y ∈ [–9, ∞) the value of x ∈ R₊ ⇒ f is onto function. Hence, f is one-one onto function, i.e., invertible.

Also, f is invertible with f⁻¹(y) = (√(54 + 5y) – 3)/5

Teacher's Note: One-one and onto together make f invertible.

Exam Note: Prove one-one, then onto, then give f⁻¹.

Question 9. Let A = R – {3} and B = R – {1}. Consider the function f : A → B defined by f(x) = (x – 2)/(x – 3). Show that f is one-one and onto and hence find f⁻¹.

Solution.

One-one: Let x₁, x₂ ∈ A. Now f(x₁) = f(x₂) ⇒ (x₁ – 2)/(x₁ – 3) = (x₂ – 2)/(x₂ – 3) ⇒ (x₁ – 2)(x₂ – 3) = (x₁ – 3)(x₂ – 2) ⇒ x₁x₂ – 3x₁ – 2x₂ + 6 = x₁x₂ – 2x₁ – 3x₂ + 6 ⇒ –3x₁ – 2x₂ = –2x₁ – 3x₂ ⇒ x₁ = x₂. Hence, f is one-one function.

Onto: Let y = (x – 2)/(x – 3) ⇒ xy – 3y = x – 2 ⇒ xy – x = 3y – 2 ⇒ x(y – 1) = 3y – 2 ⇒ x = (3y – 2)/(y – 1) …(i)

From above it is obvious that ∀ y except 1, i.e., ∀ y ∈ B = R – {1} ∃ x ∈ A. Hence, f is onto function. Thus, f is one-one onto function.

If f⁻¹ is inverse function of f then f⁻¹(y) = (3y – 2)/(y – 1) [from (i)]

Teacher's Note: Solve y = f(x) for x to get f⁻¹.

Exam Note: Note y ≠ 1 in the codomain B.

Question 10. Let f : N → N be defined by f(n) = (n + 1)/2 if n is odd, and n/2 if n is even, for all n ∈ N. Find whether the function f is bijective.

Solution.

Given f : N → N defined such that f(n) = (n + 1)/2 if n is odd, n/2 if n is even.

Let x, y ∈ N and let they are odd then f(x) = f(y) ⇒ (x + 1)/2 = (y + 1)/2 ⇒ x = y.

If x, y ∈ N are both even then f(x) = f(y) ⇒ x/2 = y/2 ⇒ x = y.

If x, y ∈ N are such that x is odd and y is even then f(x) = (x + 1)/2 and f(y) = y/2.

Thus, x ≠ y for f(x) = f(y). Let x = 6 and y = 5. We get f(6) = 6/2 = 3, f(5) = (5 + 1)/2 = 3 ∴ f(x) = f(y) but x ≠ y. So, f(x) is not one-one.

Hence, f(x) is not bijective.

Teacher's Note: Different inputs 5 and 6 give the same output 3.

Exam Note: One counter-example shows f is not one-one.

Question 11. Consider the binary operations * : R × R → R and o : R × R → R defined as a * b = |a – b| and aob = a for all a, b ∈ R. Show that ‘*’ is commutative but not associative, ‘o’ is associative but not commutative.

Solution.

For operation ‘*’: *: R × R → R such that a * b = |a – b| ∀ a, b ∈ R

Commutativity: ∀ a, b ∈ R, a * b = |a – b| = |b – a| = b * a, i.e., ‘*’ is commutative.

Associativity: ∀ a, b, c ∈ R, (a * b) * c = ||a – b| – c| and a * (b * c) = |a – |b – c||. But ||a – b| – c| ≠ |a – |b – c|| ⇒ (a * b) * c ≠ a * (b * c) ⇒ * is not associative. Hence, ‘*’ is commutative but not associative.

For operation ‘o’: o : R × R → R such that aob = a

Commutativity: ∀ a, b ∈ R, aob = a and boa = b ∵ a ≠ b ⇒ aob ≠ boa ⇒ ‘o’ is not commutative.

Associativity: ∀ a, b, c ∈ R, (aob)oc = aoc = a and ao(boc) = aob = a ⇒ (aob)oc = ao(boc) ⇒ ‘o’ is associative.

Hence ‘o’ is not commutative but associative.

Teacher's Note: Test commutativity and associativity for each operation.

Exam Note: Give a numerical example for non-associativity.

Question 12. If f, g : R → R be two functions defined as f(x) = |x| + x and g(x) = |x| – x, ∀ x ∈ R. Then find fog and gof. Hence find fog(–3), fog(5) and gof(–2).

Solution.

Here, f(x) = |x| + x can be written as f(x) = 2x if x ≥ 0 and 0 if x < 0. And g(x) = |x| – x can be written as g(x) = 0 if x ≥ 0 and –2x if x < 0.

Therefore, gof is defined as: for x ≥ 0, gof(x) = g(f(x)) = g(2x) = 0; and for x < 0, gof(x) = g(f(x)) = g(0) = 0. Hence, gof(x) = 0 ∀ x ∈ R.

Again, fog is defined as: for x ≥ 0, fog(x) = f(g(x)) = f(0) = 0; and for x < 0, fog(x) = f(g(x)) = f(–2x) = 2(–2x) = –4x.

2nd part: fog(5) = 0 [∵ 5 ≥ 0]; fog(–3) = –4 × (–3) = 12 [∵ –3 < 0]; gof(–2) = 0

Teacher's Note: Write f and g piecewise, then compose them.

Exam Note: Check the sign of x before substituting.

Question 13. Show that the relation R on the set A = {x ∈ Z : 0 ≤ x ≤ 12}, given by R = {(a, b) : |a – b| is a multiple of 4} is an equivalence relation.

Solution.

We have the given relation R = {(a, b) : |a – b| is a multiple of 4}, where a, b ∈ A and A = {x ∈ Z : 0 ≤ x ≤ 12} = {0, 1, 2, …, 12}.

Reflexivity: For any a ∈ A we have |a – a| = 0, which is multiple of 4 ⇒ (a, a) ∈ R for all a ∈ A. So, R is reflexive.

Symmetry: Let (a, b) ∈ R ⇒ |a – b| is divisible by 4 ⇒ |a – b| = 4k [where k ∈ Z] ⇒ a – b = ± 4k ⇒ b – a = ∓ 4k ⇒ |b – a| = 4k ⇒ |b – a| is divisible by 4 ⇒ (b, a) ∈ R. So, R is symmetric.

Transitivity: Let a, b, c ∈ A such that (a, b) ∈ R and (b, c) ∈ R ⇒ |a – b| is multiple of 4 and |b – c| is multiple of 4 ⇒ |a – b| = 4m and |b – c| = 4n ⇒ a – b = ± 4m and b – c = ± 4n, m, n ∈ N ∴ (a – b) + (b – c) = ± 4(m + n) ⇒ a – c = ± 4(m + n) ⇒ |a – c| = 4(m + n) ⇒ |a – c| is a multiple of 4 ⇒ (a, c) ∈ R. Thus, (a, b) ∈ R and (b, c) ∈ R ⇒ (a, c) ∈ R. So, R is transitive.

Hence, R is an equivalence relation.

Teacher's Note: R is reflexive, symmetric and transitive, so it is an equivalence relation.

Exam Note: Prove each property with the multiple-of-4 condition.

Question 14. Let N denote the set of all natural numbers and R be the relation on N × N defined by (a, b) R (c, d) if ad(b + c) = bc(a + d). Show that R is an equivalence relation.

Solution.

Here R is a relation defined as R = {((a, b), (c, d)) : ad(b + c) = bc(a + d)}

Reflexivity: By commutative law under addition and multiplication b + a = a + b ∀ a, b ∈ N and ab = ba ∀ a, b ∈ N ∴ ab(b + a) = ba(a + b) ∀ a, b ∈ N ⇒ (a, b) R (a, b). Hence, R is reflexive.

Symmetry: Let (a, b) R (c, d) ⇒ ad(b + c) = bc(a + d) ⇒ bc(a + d) = ad(b + c) ⇒ cb(d + a) = da(c + b) [By commutative law under addition and multiplication] ⇒ (c, d) R (a, b). Hence, R is symmetric.

Transitivity: Let (a, b) R (c, d) and (c, d) R (e, f). Now, ad(b + c) = bc(a + d) and cf(d + e) = de(c + f). Dividing by abcd and cdef respectively: 1/c + 1/b = 1/d + 1/a and 1/e + 1/d = 1/f + 1/c. Adding both, we get 1/c + 1/b + 1/e + 1/d = 1/d + 1/a + 1/f + 1/c ⇒ 1/b + 1/e = 1/a + 1/f ⇒ (b + e)/(be) = (a + f)/(af) ⇒ af(b + e) = be(a + f) ⇒ (a, b) R (e, f) [c, d ≠ 0]. Hence, R is transitive.

In this way, R is reflexive, symmetric and transitive. Therefore, R is an equivalence relation.

Teacher's Note: Prove reflexive, symmetric and transitive using reciprocals.

Exam Note: Divide by abcd to simplify transitivity.

Question 15. Consider f : R₊ → [4, ∞) given by f(x) = x² + 4. Show that f is invertible with the inverse (f⁻¹) of f given by f⁻¹(y) = √(y – 4), where R₊ is the set of all non-negative real numbers.

Solution.

One-one: Let x₁, x₂ ∈ R (Domain). f(x₁) = f(x₂) ⇒ x₁² + 4 = x₂² + 4 ⇒ x₁² = x₂² ⇒ x₁ = x₂ [∵ x₁, x₂ are +ve real number]. Hence, f is one-one function.

Onto: Let y ∈ [4, ∞) such that y = f(x) ∀ x ∈ R₊ (set of non-negative reals) ⇒ y = x² + 4 ⇒ x = √(y – 4) [∵ x is + ve real number]. Obviously, ∀ y ∈ [4, ∞), x is real number ∈ R (domain), i.e., all elements of codomain have pre image in domain ⇒ f is onto.

Hence, f is invertible being one-one onto. Inverse function: If f⁻¹ is inverse of f, then fof⁻¹ = I (Identity function) ⇒ fof⁻¹(y) = y ∀ y ∈ [4, ∞) ⇒ f(f⁻¹(y)) = y ⇒ (f⁻¹(y))² + 4 = y [∵ f(x) = x² + 4] ⇒ f⁻¹(y) = √(y – 4)

Therefore, required inverse function is f⁻¹ : [4, ∞) → R₊ defined by f⁻¹(y) = √(y – 4) ∀ y ∈ [4, ∞)

Teacher's Note: One-one and onto make f invertible; the inverse is √(y – 4).

Exam Note: Show one-one, onto, then derive f⁻¹.

Question 16. Determine whether the relation R defined on the set R of all real numbers as R = {(a, b) : a, b ∈ R and a – b + √3 ∈ S, where S is the set of all irrational numbers}, is reflexive, symmetric and transitive.

Solution.

Here, relation R defined on the set R is given as R = {(a, b) : a, b ∈ R and a – b + √3 ∈ S}

Reflexive: Let a ∈ R (set of real numbers). Now, (a, a) ∈ R as a – a + √3 = √3 ∈ S, i.e., R is reflexive.

Symmetric: R is not symmetric. For example, take a = √3 and b = 0. Then a – b + √3 = 2√3 ∈ S, so (√3, 0) ∈ R. But b – a + √3 = 0 – √3 + √3 = 0 ∉ S, so (0, √3) ∉ R.

Transitive: R is not transitive. For example, take a = 0, b = √2, c = √3. Then a – b + √3 = √3 – √2 ∈ S, so (0, √2) ∈ R, and b – c + √3 = √2 ∈ S, so (√2, √3) ∈ R. But a – c + √3 = 0 ∉ S, so (0, √3) ∉ R.

Hence R is reflexive but neither symmetric nor transitive.

Teacher's Note: The relation is reflexive only; counter-examples break the other two properties.

Exam Note: Use counter-examples to disprove symmetry and transitivity.

Question 17. Show that the function f in A = R – {2/3} defined as f(x) = (4x + 3)/(6x – 4) is one-one and onto. Hence, find f⁻¹.

Solution.

One-one: Let x₁, x₂ ∈ A. Now, f(x₁) = f(x₂) ⇒ (4x₁ + 3)/(6x₁ – 4) = (4x₂ + 3)/(6x₂ – 4) ⇒ 24x₁x₂ + 18x₂ – 16x₁ – 12 = 24x₁x₂ + 18x₁ – 16x₂ – 12 ⇒ –34x₁ = –34x₂ ⇒ x₁ = x₂. Hence, f is one-one function.

Onto: Let y = (4x + 3)/(6x – 4) ⇒ 6xy – 4y = 4x + 3 ⇒ x(6y – 4) = 4y + 3 ⇒ x = (4y + 3)/(6y – 4) ⇒ ∀ y ∈ codomain ∃ x ∈ domain [∵ x ≠ 2/3] ⇒ f is onto function. Thus, f is one-one onto function.

Also, f⁻¹(x) = (4x + 3)/(6x – 4)

Teacher's Note: Solve y = f(x) for x; f turns out to be its own inverse.

Exam Note: Note the excluded value 2/3.

Question 18. Let T be the set of all triangles in a plane with R as relation in T given by R = {(T₁, T₂) : T₁ ≅ T₂}. Show that R is an equivalence relation.

Solution.

We have the relation, R = {(T₁, T₂) : T₁ ≅ T₂}

Reflexivity: As each triangle is congruent to itself, i.e., T₁ ≅ T₁ ∀ T₁ ∈ T. Thus, R is reflexive.

Symmetry: Let T₁, T₂ ∈ T, such that (T₁, T₂) ∈ R ⇒ T₁ ≅ T₂ ⇒ T₂ ≅ T₁ ⇒ (T₂, T₁) ∈ R, i.e., R is symmetric.

Transitivity: Let T₁, T₂, T₃ ∈ T, such that (T₁, T₂) ∈ R and (T₂, T₃) ∈ R ⇒ T₁ ≅ T₂ and T₂ ≅ T₃ ⇒ T₁ ≅ T₃ ⇒ (T₁, T₃) ∈ R, i.e., R is transitive.

Hence, R is an equivalence relation.

Teacher's Note: Congruence is reflexive, symmetric and transitive.

Exam Note: Prove all three properties.

Question 19. Let f : W → W, be defined as f(x) = x – 1, if x is odd and f(x) = x + 1, if x is even. Show that f is invertible. Find the inverse of f, where W is the set of all whole numbers.

Solution.

One-one: Case I: When x₁, x₂ are even numbers. Now, f(x₁) = f(x₂) ⇒ x₁ + 1 = x₂ + 1 ⇒ x₁ = x₂, i.e., f is one-one.

Case II: When x₁, x₂ are odd numbers. Now, f(x₁) = f(x₂) ⇒ x₁ – 1 = x₂ – 1 ⇒ x₁ = x₂, i.e., f is one-one.

Case III: When x₁ is odd and x₂ is even number. Then, x₁ ≠ x₂. Also, in this case f(x₁) is even and f(x₂) is odd and so f(x₁) ≠ f(x₂), i.e., x₁ ≠ x₂ ⇒ f(x₁) ≠ f(x₂), i.e., f is one-one.

Case IV: When x₁ is even and x₂ is odd number. Similar as Case III, we can prove f is one-one.

Onto: Given, f(x) = x – 1 if x is odd, x + 1 if x is even. For every even number ‘y’ of codomain ∃ odd number y + 1 in domain and for every odd number y of codomain there exists even number y – 1 in domain, i.e., f is onto function. Hence, f is one-one onto, i.e., invertible function.

Inverse: Let f(x) = y. If x is odd, y = x – 1 ⇒ x = y + 1 (y is even). If x is even, y = x + 1 ⇒ x = y – 1 (y is odd).

Therefore, the required inverse function is f⁻¹(x) = x + 1 if x is even, and x – 1 if x is odd. (So f⁻¹ = f.)

Teacher's Note: f swaps each odd number with the next lower even number, so it is its own inverse.

Exam Note: Treat odd and even cases separately.

Question 20. If the function f : R → R be defined by f(x) = 2x – 3 and g : R → R by g(x) = x³ + 5, then find the value of (fog)⁻¹(x).

Solution.

Here f : R → R and g : R → R are two functions such that f(x) = 2x – 3 and g(x) = x³ + 5.

∵ f and g both are bijective (one-one onto) functions ⇒ fog is also bijective function ⇒ fog is invertible function.

Now, fog(x) = f(g(x)) ⇒ fog(x) = f(x³ + 5) ⇒ fog(x) = 2(x³ + 5) – 3 ⇒ fog(x) = 2x³ + 10 – 3 ⇒ fog(x) = 2x³ + 7 …(i)

For inverse of fog(x): let fog(x) = y ⇒ x = (fog)⁻¹(y). (i) ⇒ y = 2x³ + 7 ⇒ 2x³ = y – 7 ⇒ x³ = (y – 7)/2 ⇒ x = ((y – 7)/2)^(1/3) ⇒ (fog)⁻¹(y) = ((y – 7)/2)^(1/3) ⇒ (fog)⁻¹(x) = ((x – 7)/2)^(1/3)

Teacher's Note: Compose to get fog(x) = 2x³ + 7, then invert.

Exam Note: Replace y by x at the end.

Question 21. Let f : N → R be a function defined as f(x) = 4x² + 12x + 15. Show that f : N → S is invertible, where S is the range of f. Hence, find inverse of f.

Solution.

Let y ∈ S, then y = 4x² + 12x + 15, for some x ∈ N ⇒ y = (2x + 3)² + 6 ⇒ x = (√(y – 6) – 3)/2, as y > 6.

Let g : S → N be defined by g(y) = (√(y – 6) – 3)/2.

∴ gof(x) = g(4x² + 12x + 15) = g((2x + 3)² + 6) = (√((2x + 3)²) – 3)/2 = x

and fog(y) = f((√(y – 6) – 3)/2) = [2·(√(y – 6) – 3)/2 + 3]² + 6 = (√(y – 6))² + 6 = y

Hence, fog(y) = I_S and gof(x) = I_N. f is invertible, f⁻¹ = g, i.e., f⁻¹(y) = (√(y – 6) – 3)/2.

Teacher's Note: Find g with gof = identity and fog = identity; then g is the inverse.

Exam Note: Complete the square to get (2x + 3)² + 6.

Question 22. Let Z be the set of all integers and R be relation on Z defined as R = {(a, b) : a, b ∈ Z and (a – b) is divisible by 5}. Prove that R is an equivalence relation.

Solution.

Given R = {(a, b) : a, b ∈ Z and (a – b) is divisible by 5}

Reflexivity: ∀ a ∈ Z, a – a = 0 is divisible by 5 ⇒ (a, a) ∈ R ∀ a ∈ Z. Hence, R is reflexive.

Symmetry: Let (a, b) ∈ R ⇒ a – b is divisible by 5 ⇒ –(b – a) is divisible by 5 ⇒ (b – a) is divisible by 5 ⇒ (b, a) ∈ R. Hence, R is symmetric.

Transitivity: Let (a, b), (b, c) ∈ R ⇒ (a – b) and (b – c) are divisible by 5 ⇒ (a – b + b – c) is divisible by 5 ⇒ a – c is divisible by 5 ⇒ (a, c) ∈ R. Hence, R is transitive.

Thus, R is an equivalence relation.

Teacher's Note: Differences divisible by 5 give an equivalence relation on Z.

Exam Note: Add (a – b) and (b – c) for transitivity.

Question 23. Let f : R – {–4/3} → R be a function defined as f(x) = 4x/(3x + 4). Show that, in f : R – {–4/3} → Range of f, f is one-one and onto. Hence find f⁻¹ : Range f → R – {–4/3}.

Solution.

Let x₁, x₂ ∈ R – {–4/3}. Now f(x₁) = f(x₂) ⇒ 4x₁/(3x₁ + 4) = 4x₂/(3x₂ + 4) ⇒ 12x₁x₂ + 16x₁ = 12x₁x₂ + 16x₂ ⇒ 16x₁ = 16x₂ ⇒ x₁ = x₂. Hence f is one-one function.

Since co-domain of f is range of f, so f : R – {–4/3} → Range of f is one-one onto function.

For inverse function: Let f(x) = y ⇒ 4x/(3x + 4) = y ⇒ 3xy + 4y = 4x ⇒ 4x – 3xy = 4y ⇒ x(4 – 3y) = 4y ⇒ x = 4y/(4 – 3y)

Therefore, f⁻¹ : Range of f → R – {–4/3} is f⁻¹(y) = 4y/(4 – 3y).

Teacher's Note: Solve y = 4x/(3x + 4) for x to get the inverse.

Exam Note: Range of f is R minus {4/3}.

Question 24. Let A = R × R and * be the binary operation on A defined by (a, b) * (c, d) = (a + c, b + d). Show that * is commutative and associative. Find the identity element for * on A, if any.

Solution.

Commutativity: Let (a, b), (c, d) ∈ R × R. (a, b) * (c, d) = (a + c, b + d) and (c, d) * (a, b) = (c + a, d + b) = (a + c, b + d) [∵ commutative law holds for real number] ⇒ (a, b) * (c, d) = (c, d) * (a, b). Hence, * is commutative.

Associativity: Let (a, b), (c, d), (e, f) ∈ R × R. ((a, b) * (c, d)) * (e, f) = (a + c, b + d) * (e, f) = (a + c + e, b + d + f). (a, b) * ((c, d) * (e, f)) = (a, b) * (c + e, d + f) = (a + c + e, b + d + f). ∴ ((a, b) * (c, d)) * (e, f) = (a, b) * ((c, d) * (e, f)), so * is associative.

Identity: Let (e₁, e₂) be identity ⇒ (a, b) * (e₁, e₂) = (a, b) ⇒ (a + e₁, b + e₂) = (a, b) ⇒ a + e₁ = a and b + e₂ = b ⇒ e₁ = 0, e₂ = 0. (0, 0) ∈ R × R is the identity element.

Teacher's Note: Addition of coordinates is commutative and associative; identity is (0, 0).

Exam Note: Solve (a, b) * (e₁, e₂) = (a, b).

Question 25. Let A = Q × Q, where Q is the set of all rational numbers, and * be a binary operation on A defined by (a, b) * (c, d) = (ac, b + ad) for (a, b), (c, d) ∈ A. Then find (i) The identity element of * in A. (ii) Invertible elements of A, and hence write the inverse of elements (5, 3) and (1/2, 4).

Solution.

(i) Let (x, y) be the identity element in A. Now, (a, b) * (x, y) = (a, b) = (x, y) * (a, b) ∀ (a, b) ∈ A ⇒ (ax, b + ay) = (a, b) = (xa, y + bx). Equating corresponding terms, we get ax = a, b + ay = b or a = xa, b = y + bx ⇒ x = 1 and y = 0. Hence, (1, 0) is the identity element in A.

(ii) Let (a, b) be an invertible element in A and let (c, d) be its inverse in A. Now, (a, b) * (c, d) = (1, 0) = (c, d) * (a, b) ⇒ (ac, b + ad) = (1, 0) ⇒ ac = 1, b + ad = 0 ⇒ c = 1/a and d = –b/a, where a ≠ 0.

Therefore, all (a, b) ∈ A is an invertible element of A if a ≠ 0, and inverse of (a, b) is (1/a, –b/a).

For inverse of (5, 3): inverse of (5, 3) = (1/5, –3/5).

For inverse of (1/2, 4): inverse of (1/2, 4) = (2, –8).

Teacher's Note: Identity is (1, 0); (a, b) is invertible when a ≠ 0.

Exam Note: Equate (a, b) * (c, d) to the identity.

Question 26. Let f : R → [0, π/2) defined by f(x) = tan⁻¹(x² + x + a), then find the value or set of values of ‘a’ for which f is onto.

Solution.

Given function is f : R → [0, π/2). Since f is onto ⇒ Range of f is [0, π/2)

⇒ 0 ≤ f(x) < π/2 ⇒ 0 ≤ tan⁻¹(x² + x + a) < π/2 ⇒ tan 0 ≤ x² + x + a < tan(π/2) ⇒ 0 ≤ x² + x + a < ∞

It is possible only when a = 1/4

As x² + x + 1/4 = x² + 2·x·(1/2) + (1/2)² = (x + 1/2)² and 0 ≤ (x + 1/2)² < ∞

Hence, the required value of a = 1/4.

Teacher's Note: The least value of x² + x + a must be 0, which gives a = 1/4.

Exam Note: Complete the square to find the minimum.

Question 27. Let A = {–1, 0, 1, 2}, B = {–4, –2, 0, 2} and f, g : A → B be functions defined by f(x) = x² – x, x ∈ A and g(x) = 2|x – 1/2| – 1, x ∈ A. Are f and g equal? Justify your answer.

Solution.

For two functions f : A → B and g : A → B to be equal, f(a) = g(a) ∀ a ∈ A and R_f = R_g.

Here, we have f(x) = x² – x and g(x) = 2|x – 1/2| – 1, x ∈ A = {–1, 0, 1, 2}

We see that f(–1) = (–1)² – (–1) = 2 and g(–1) = 2|–1 – 1/2| – 1 = 2 × 3/2 – 1 = 3 – 1 = 2. So, f(–1) = g(–1).

Again, we check that f(0) = 0 = g(0), f(1) = 0 = g(1) and f(2) = 2 = g(2).

Hence, f and g are equal functions.

Teacher's Note: Equal functions have the same value at every point of the domain.

Exam Note: Check f and g at all four elements.

Question 28. Let A = {x ∈ R : –1 ≤ x ≤ 1} = B. Show that f : A → B given by f(x) = x|x| is a bijection.

Solution.

We have f(x) = x|x| = x² if x ≥ 0 and –x² if x < 0.

For x ≥ 0, f(x) = x² represents a parabola opening upward and for x < 0, f(x) = –x² represents a parabola opening downward.

So, the graph of f(x) is as shown in figure.

XYOy = x²y = –x²

Since any line parallel to x-axis, will cut the graph at only one point, so f is one-one. Also, any line parallel to y-axis will cut the graph, so f is onto.

Thus, it is evident from the graph of f(x) that f is one-one and onto.

Teacher's Note: The graph is cut once by every horizontal line, so f is one-one and onto.

Exam Note: Sketch both parabola halves and apply the line tests.

Question 29. If f(x) = √x (x ≥ 0) and g(x) = x² – 1 are two real functions, then find fog and gof and check whether fog = gof.

Solution.

The given functions are f(x) = √x, x ≥ 0 and g(x) = x² – 1.

We have, domain of f = [0, ∞) and range of f = [0, ∞); domain of g = R and range of g = [–1, ∞).

Computation of gof: We observe that range of f = [0, ∞) ⊆ domain of g ∴ gof exists and gof : [0, ∞) → R. Also, gof(x) = g(f(x)) = g(√x) = (√x)² – 1 = x – 1. Thus, gof : [0, ∞) → R is defined as gof(x) = x – 1.

Computation of fog: We observe that range of g = [–1, ∞) ⊄ domain of f. ∴ Domain of fog = {x : x ∈ domain of g and g(x) ∈ domain of f} = {x : x ∈ R and x² – 1 ∈ [0, ∞)} = {x : x ∈ R and x² – 1 ≥ 0} = {x : x ∈ R and x ≤ –1 or x ≥ 1} = (–∞, –1] ∪ [1, ∞). Also, fog(x) = f(g(x)) = f(x² – 1) = √(x² – 1). Thus, fog : (–∞, –1] ∪ [1, ∞) → R is defined as fog(x) = √(x² – 1).

We find that fog and gof have distinct domains. Also, their formulae are not same. Hence, fog ≠ gof.

Teacher's Note: The two compositions have different domains and formulae.

Exam Note: Find both domains before comparing.

Question 30. Let X be a non-empty set and * be a binary operation on P(X) (the power set of set X) defined by A * B = A ∪ B for all A, B ∈ P(X). Prove that ‘*’ is both commutative and associative. Find the identity element with respect to ‘*’ on P(X). Also, show that Φ ∈ P(X) is the only invertible element of P(X).

Solution.

As we studied in earlier class that for sets A, B, C: A ∪ B = B ∪ A and (A ∪ B) ∪ C = A ∪ (B ∪ C). Therefore, for any A, B, C ∈ P(X), we have A ∪ B = B ∪ A and (A ∪ B) ∪ C = A ∪ (B ∪ C) ⇒ A * B = B * A and (A * B) * C = A * (B * C). Thus, ‘*’ is both commutative and associative on P(X).

Now, A ∪ Φ = A = Φ ∪ A for all A ∈ P(X) ⇒ A * Φ = A = Φ * A for all A ∈ P(X). So, Φ is the identity element for ‘*’ on P(X).

Let A ∈ P(X) be an invertible element. Then, there exists S ∈ P(X) such that A * S = Φ = S * A ⇒ A ∪ S = Φ = S ∪ A ⇒ S = Φ = A.

Hence, Φ is the only invertible element.

Teacher's Note: Union is commutative and associative; the empty set is the identity.

Exam Note: A ∪ S = Φ forces both sets to be empty.

Question 31. Let g(x) = 1 + x – [x] and f(x) = –1 if x < 0, 0 if x = 0, 1 if x > 0. Then for all x find fog(x).

Solution.

fog(x) = f(g(x)) = f(1 + x – [x]) = f(1 + {x}) = 1

Here, {x} = x – [x]. Obviously, 0 ≤ x – [x] < 1 ⇒ 0 ≤ {x} < 1 ⇒ 1 + {x} ≥ 1 ∴ fog(x) = f(1 + {x}) = 1

[Note: Symbol {x} denotes the fractional part of x. For example, {4.25} = 0.25, {4} = 0, {–3.45} = 0.55. In this way x = [x] + {x} ⇒ 0 ≤ {x} < 1]

Teacher's Note: 1 + {x} is always at least 1, which is positive, so f gives 1.

Exam Note: Use the fractional part {x} = x – [x].

Question 32. If the operation ‘*’ on Q – {1}, defined by a * b = a + b – ab for all a, b ∈ Q – {1}, then (i) Is ‘*’ commutative? (ii) Is ‘*’ associative? (iii) Find the identity element. (iv) Find the inverse of ‘a’ for each a ∈ Q – {1}.

Solution.

We have, a * b = a + b – ab ∀ a, b ∈ Q – {1}, then

(i) Commutative: Let a, b ∈ Q – {1}. Now, a * b = a + b – ab and b * a = b + a – ba = a + b – ab [∵ commutative law holds for + and ×]. Hence a * b = b * a, i.e., ‘*’ is commutative.

(ii) Associative: Let a, b, c ∈ Q – {1}. Now, (a * b) * c = (a + b – ab) * c = a + b – ab + c – ac – bc + abc and a * (b * c) = a * (b + c – bc) = a + b + c – bc – ab – ac + abc, i.e., (a * b) * c = a * (b * c). Hence, ‘*’ is associative.

(iii) Identity: Let e be the identity element. Then, ∀ a ∈ Q – {1}, we have a * e = a ⇒ a + e – ae = a ⇒ (1 – a)e = 0 ⇒ e = 0 ∈ Q – {1} [∵ a ≠ 1 ⇒ 1 – a ≠ 0]. Now, a * 0 = a + 0 – a × 0 = a and 0 * a = 0 + a – 0 × a = a. Thus, 0 is the identity element in Q – {1}.

(iv) Inverse: Let b be the inverse element of a, for each a ∈ Q – {1}. Then a * b = e = 0 ⇒ a * b = 0 ⇒ a + b – ab = 0 ⇒ ab – b = a ⇒ b(a – 1) = a ⇒ b = a/(a – 1) ∈ Q – {1}. Therefore, for each a the corresponding inverse element is a/(a – 1) ∈ Q – {1}.

Teacher's Note: The operation is commutative and associative with identity 0 and inverse a/(a – 1).

Exam Note: Solve a * b = 0 for the inverse.

Question 33. Show that the function f : R → R given by f(x) = x³ + x is a bijection.

Solution.

We have the function f : R → R given by f(x) = x³ + x.

Injectivity: Let x, y ∈ R such that f(x) = f(y) ⇒ x³ + x = y³ + y ⇒ x³ – y³ + x – y = 0 ⇒ (x – y)(x² + xy + y²) + (x – y) = 0 ⇒ (x – y)(x² + xy + y² + 1) = 0 [∵ x² + xy + y² ≥ 0 for all x, y ∈ R, so x² + xy + y² + 1 ≥ 1] ⇒ x – y = 0 ⇒ x = y. Thus, f(x) = f(y) ⇒ x = y for all x, y ∈ R. So, f is injective.

Surjectivity: Let y be an arbitrary element of R such that f(x) = y ⇒ x³ + x = y ⇒ x³ + x – y = 0. For every value of y, the equation x³ + x – y = 0 has a real root a [∵ an odd degree equation has at least one real root]. Therefore, a³ + a – y = 0 ⇒ a³ + a = y ⇒ f(a) = y. Thus, for every y ∈ R there exists a ∈ R such that f(a) = y. So, f is surjective.

Hence, f : R → R is a bijection.

Teacher's Note: Show f is injective and surjective to prove it is a bijection.

Exam Note: An odd-degree equation always has a real root.

Question 34. Let A = R – {3} and B = R – {2/3}. If f : A → B : f(x) = (2x – 4)/(3x – 9), then prove that f is a bijective function.

Solution.

One-one: Let x₁, x₂ be any two elements of A, then f(x₁) = f(x₂) ⇒ (2x₁ – 4)/(3x₁ – 9) = (2x₂ – 4)/(3x₂ – 9) ⇒ 6x₁x₂ – 18x₁ – 12x₂ + 36 = 6x₁x₂ – 18x₂ – 12x₁ + 36 ⇒ –18x₁ – 12x₂ = –12x₁ – 18x₂ ⇒ –6x₁ = –6x₂ ⇒ x₁ = x₂. Hence, f is one-one function …(i)

Onto: Let y = (2x – 4)/(3x – 9) ⇒ 3xy – 9y = 2x – 4 ⇒ x(3y – 2) = 9y – 4 ⇒ x = (9y – 4)/(3y – 2). From above it is obvious that ∀ y ≠ 2/3 i.e. ∀ y ∈ B, ∃ x ∈ A. Hence, f is onto function …(ii)

(i) and (ii) ⇒ f is one-one onto i.e. bijective function.

Teacher's Note: One-one and onto together make f bijective.

Exam Note: Prove one-one, then onto.

Question 35. Let X be a non-empty set. Let * : P(X) × P(X) → P(X) defined as A * B = (A – B) ∪ (B – A) ∀ A, B ∈ P(X). Show that the empty set Φ is the identity for the operation * and all the elements A of P(X) are invertible with A⁻¹ = A.

Solution.

Here operation ‘*’ is defined as * : P(X) × P(X) → P(X) such that A * B = (A – B) ∪ (B – A) ∀ A, B ∈ P(X).

Existence of identity: Let E ∈ P(X) be identity for ‘*’ in set P(X) ⇒ A * E = A = E * A ⇒ (A – E) ∪ (E – A) = A = (E – A) ∪ (A – E). It is possible only when E = Φ, because (A – Φ) ∪ (Φ – A) = A ∪ Φ = A and (Φ – A) ∪ (A – Φ) = Φ ∪ A = A. Hence, Φ is identity element.

Existence of inverse: Let A⁻¹ be the inverse of A for ‘*’ on set P(X). ∴ A * A⁻¹ = Φ = A⁻¹ * A ⇒ (A – A⁻¹) ∪ (A⁻¹ – A) = Φ ⇒ A – A⁻¹ = Φ = A⁻¹ – A ⇒ A ⊂ A⁻¹ and A⁻¹ ⊂ A ⇒ A = A⁻¹. Hence, each element of P(X) is inverse of itself.

Teacher's Note: The symmetric difference of A with itself is empty, so A is its own inverse.

Exam Note: Show the identity first, then the inverse.

Question 36. Show that the relation R on the set A of points in a plane, given by R = {(P, Q) : Distance of the point P from the origin = Distance of point Q from origin} is an equivalence relation. Further, show that the set of all points related to a point P ≠ (0, 0) is the circle passing through P with origin as centre.

Solution.

If O be the origin, then R = {(P, Q) : OP = OQ}

Reflexivity: ∀ point P ∈ A, OP = OP ⇒ (P, P) ∈ R, i.e., R is reflexive.

Symmetry: Let P, Q ∈ A, such that (P, Q) ∈ R ⇒ OP = OQ ⇒ OQ = OP ⇒ (Q, P) ∈ R, i.e., R is symmetric.

Transitivity: Let P, Q, S ∈ A, such that (P, Q) ∈ R and (Q, S) ∈ R ⇒ OP = OQ and OQ = OS ⇒ OP = OS ⇒ (P, S) ∈ R, i.e., R is transitive.

Now we have R is reflexive, symmetric and transitive. Therefore, R is an equivalence relation.

Let P, Q, R … be points in the set A, such that (P, Q), (P, R) … ∈ R ⇒ OP = OQ; OP = OR; … [where O is origin] ⇒ OP = OQ = OR = …, i.e., all points P, Q, R … ∈ A, which are related to P are equidistant from origin ‘O’. Hence, set of all points of A related to P is the circle passing through P, having origin as centre.

Teacher's Note: Equal distance from the origin is an equivalence relation; related points form a circle.

Exam Note: Prove the three properties, then describe the circle.

Step-by-Step Xam Idea Solutions for Class 12 Math

Complete Math Solutions for Xam Idea Solutions Class 12 Maths Chapter 1 Relations And Functions Long Answer Questions I

Review detailed solutions for Class 12 Mathematics. The Xam Idea Solutions Class 12 Maths Chapter 1 Relations And Functions Long Answer Questions I PDF provides comprehensive answers mapped to standard Xam Idea Solutions textbooks, ensuring targeted revision for weekly tests and terminal exams.

Concept-Driven Math Answers

Clear, methodical explanations accompany every challenging problem within the text. Engaging with these detailed mathematical breakdowns lays a solid foundation for advanced learning and improves execution speed for upcoming exams.

Explore More Study Resources for Class 12 Math

In addition to these Xam Idea Solutions chapters, students can explore a wider library of free online mock tests, printable sample papers, and short revision notes aligned with the 2026 academic session.

FAQs

What are these [current-page:node:field_author] Solutions for Class 12 Mathematics?

They are chapter-wise solved questions from the book for Class 12 Mathematics. Each answer is explained step by step so you can check your work and revise.

Are the [current-page:node:field_author] Class 12 Mathematics Solutions free to read?

Yes. All chapters can be read online for free on a phone, tablet or computer, and no sign-up is needed.

How should I use these [current-page:node:field_author] solutions for Class 12 Mathematics?

Try each question on your own first, then read the solution. Use it to check your steps, correct mistakes and learn how a full answer is written.

Will practising [current-page:node:field_author] Class 12 Mathematics questions help in exams?

Regular practice improves accuracy and speed and shows which topics need more revision. It works best alongside your textbook and class notes.

Are these solutions arranged chapter by chapter?

Yes. The chapter list on this page links to every chapter’s solved questions, so you can open the topic you are studying.

Which session are these Class 12 Mathematics Solutions for?

They are listed for the 2026-27 session. Check that the questions match the textbook edition you use.