JEE Advanced · Mathematics

Sets, Relations and Functions PYQs

21 previous-year questions from Sets, Relations and Functions in JEE Advanced, 2011–2026, latest first.

Q1JEE Advanced · 17 May 2026 · Paper-1Numerical answer
Let S = {1, 2, 3, …, 10}. Consider the set X = {R : R is an equivalence relation on the set S such that R has exactly 42 elements}. Then the number of elements in X is __________.
Show answer & solution

Answer: 2520

An equivalence relation splits S into disjoint classes; a class with n elements contributes n2 ordered pairs. We need class sizes adding to 10 whose squares add to 42. Only two partitions work: (i) 6 + 2 + 1 + 1 = 10 with 62 + 22 + 12 + 12 = 36 + 4 + 1 + 1 = 42 (ii) 5 + 4 + 1 = 10 with 52 + 42 + 12 = 25 + 16 + 1 = 42 For (6, 2, 1, 1): ways =10!6!2!1!1!×12!=1260= \frac{10!}{6!2!1!1!} \times \frac{1}{2!} = 1260 (the two singleton classes are identical in size) For (5, 4, 1): ways =10!5!4!1!=1260= \frac{10!}{5!4!1!} = 1260 Total = 1260 + 1260 = 2520
Q2JEE Advanced · 17 May 2026 · Paper-2Numerical answer
Let ℕ denote the set of all positive integers. Consider the sets A = {1, 2, 3, 4, 5} and B = {1, 2, 3, 4, 5, 6, 7}. Let S be the set of all functions f : A →→\rightarrow B such that f(2) ≠≠\neq 2 and f(4) ≠≠\neq 4. Consider the set T = {f ∈∈\in S : there exists a function g : B →→\rightarrow ℕ such that g(f(x)) = 2x for all x ∈∈\in A}. Then the number of elements in the set T is ___________.
Show answer & solution

Answer: 1860

As g(f(x)) = 2x ∀ x ∈∈\in A (distinct values), f(x) must be one-one. Total one-one functions = 7C5 ××\times 5! = 2520 Required = Total − (f(2) = 2) − (f(4) = 4) + (f(2) = 2 and f(4) = 4) = 2520 − (6C4 ××\times 4! + 6C4 ××\times 4!) + 5C3 ××\times 3! = 2520 − (360 + 360) + 60 = 1860
Q3JEE Advanced · 18 May 2025 · Paper-1One or more correct
Let ℕ denote the set of all natural numbers, and ℤ denote the set of all integers. Consider the functions f : ℕ →→\rightarrow ℤ and g : ℤ →→\rightarrow ℕ defined by f(n) = (n + 1)/2 if n is odd; f(n) = (4 − n)/2 if n is even, and g(n) = 3 + 2n if n ≥≥\geq 0; g(n) = −2n if n < 0. Define (g ∘ f)(n) = g(f(n)) for all n ∈∈\in ℕ, and (f ∘ g)(n) = f(g(n)) for all n ∈∈\in ℤ. Then which of the following statements is (are) TRUE?
  1. (A)g ∘ f is NOT one-one and g ∘ f is NOT onto
  2. (B)f ∘ g is NOT one-one but f ∘ g is onto
  3. (C)g is one-one and g is onto
  4. (D)f is NOT one-one but f is onto
Show answer & solution

Answer: A, D

f: (1, 1), (2, 1), (3, 2), (4, 0), (5, 3), (6, −1), … ⇒⇒\Rightarrow f is many-one and onto ℤ ⇒⇒\Rightarrow (D) correct. g: (−3, 6), (−2, 4), (−1, 2), (0, 3), (1, 5), (2, 7), … ⇒⇒\Rightarrow g is one-one but not onto (1 is never taken) ⇒⇒\Rightarrow (C) wrong. f(g(n)) = n + 2 for every n ∈∈\in ℤ ⇒⇒\Rightarrow f ∘ g is one-one and into ⇒⇒\Rightarrow (B) wrong. g(f(1)) = g(f(2)) = 5 ⇒⇒\Rightarrow g ∘ f is many-one; it is also into ⇒⇒\Rightarrow (A) correct.

18 more Sets, Relations and Functions questions

Practise them free

Practise all 21 Sets, Relations and Functions PYQs

Untimed with solutions, or as a timed test. Your mistakes are saved so you can retry them.

Start free