JEE (Main + Adv) · Mathematics

Sets, Relations and Functions

29 practice questions with full step-by-step solutions, quick revision notes — free, no sign-up.

Reviewed by (19 years teaching)Written with AI helpReport a mistake

This chapter has

8
easy
14
medium
7
hard

Sets, Relations and Functions — quick revision notes

This chapter covers sets and their operations (Venn diagrams, power sets, inclusion–exclusion), relations (reflexive, symmetric, transitive, equivalence) and functions (domain, range, one-one and onto, composition, inverse, periodicity, greatest integer function). JEE Main asks counting of relations and functions, domain and range of real functions, classification of given relations, and composition or functional-equation problems.
  • A set with n elements has 2ⁿ subsets and 2ⁿ − 1 proper subsets; P(P(A)) has 22ⁿ elements (16 when n = 2).
  • Three sets: n(A ∪ B ∪ C) = n(A) + n(B) + n(C) − n(A ∩ B) − n(B ∩ C) − n(C ∩ A) + n(A ∩ B ∩ C).
  • If n(A) = m and n(B) = n: relations from A to B = 2mn; functions from A to B = nᵐ; one-one functions = ⁿPₘ (m ≤ n); bijections (m = n) = n!.
  • On a set with n elements: all relations 2n², reflexive 2n² − n, symmetric 2n(n + 1)/2, reflexive and symmetric 2n(n − 1)/2.
  • Equivalence relation = reflexive + symmetric + transitive; its equivalence classes split the set into disjoint parts (congruence mod 5 on Z gives 5 classes).
  • Domain rules: √g needs g ≥ 0, log g needs g > 0, 1/g needs g ≠ 0. Example: √(log₁₀((5x − x²)/4)) has domain [1, 4].
  • (f∘g)(x) = f(g(x)); in general f∘g ≠ g∘f. Only a bijection has an inverse; find f⁻¹ by solving y = f(x) for x.
  • Greatest integer function: [x] = n ⇔ n ≤ x < n + 1, so equations in [x] give intervals, e.g. [x] = 2 means 2 ≤ x < 3.
  • Periods: sin x and cos x → 2π; tan x, |sin x|, |cos x| → π; |sin x| + |cos x| → π/2.
  • Functional equations involving f(1/x) or f(−x): substitute to get a second equation and solve the two simultaneously.

Common mistakes to avoid

  • Mixing up the number of relations (2mn) with the number of functions (nᵐ), or functions from A to B (nᵐ) with B to A (mⁿ).
  • Forgetting to add back n(A ∩ B ∩ C) in three-set inclusion–exclusion.
  • Checking only that a log's argument is positive when the log itself sits under a square root (the log must also be ≥ 0).
  • Treating [x] = k as the single point x = k instead of the interval [k, k + 1).
  • Declaring a relation symmetric or transitive after checking only a few pairs — one counterexample is enough to fail.
Exam tip: In counting questions, write the formula in terms of n(A) and n(B) before substituting — most wrong options in JEE Main are the values of the neighbouring formulas.

Sets, Relations and Functions — solved practice questions

7 JEE Mathematics questions with step-by-step solutions. Attempt each, then reveal the answer.

These worked examples are not in the timed test, so you can study them first.

  1. Q1easyReport

    If a set A has 4 elements, then the number of proper subsets of A (subsets other than A itself) is:

    • A15
    • B14
    • C16
    • D8
    Show answer & solution

    Correct answer: (A) 15

    A set with n elements has 2n subsets in total. Proper subsets exclude A itself, giving 24 − 1 = 16 − 1 = 15.
  2. Q2easyReport

    For two finite sets A and B, n(A) = 20, n(B) = 15 and n(A ∪ B) = 30. Then n(A ∩ B) equals:

    • A5
    • B10
    • C0
    • D35
    Show answer & solution

    Correct answer: (A) 5

    By inclusion–exclusion, n(A ∪ B) = n(A) + n(B) − n(A ∩ B), so n(A ∩ B) = 20 + 15 − 30 = 5.
  3. Q3easyReport

    The domain of the real function f(x) = √(4 − x2) is:

    • A(−∞, 2]
    • B(−2, 2)
    • C[0, 2]
    • D[−2, 2]
    Show answer & solution

    Correct answer: (D) [−2, 2]

    The expression under the root must be non-negative: 4 − x2 ≥ 0, i.e. x2 ≤ 4, giving −2 ≤ x ≤ 2, i.e. [−2, 2].
  4. Q4mediumReport

    The number of functions from a set A with 3 elements to a set B with 4 elements is:

    • A24
    • B64
    • C81
    • D12
    Show answer & solution

    Correct answer: (B) 64

    Each of the 3 elements of A can map to any of the 4 elements of B independently, giving 43 = 64 functions.
  5. Q5mediumReport

    The number of onto (surjective) functions from a set with 4 elements onto a set with 2 elements is:

    • A12
    • B8
    • C14
    • D16
    Show answer & solution

    Correct answer: (C) 14

    Total functions to a 2-element set = 24 = 16. Subtract the 2 that miss an element (all elements to one target): 16 − 2 = 14.
  6. Q6mediumReport

    The relation R on the set of integers Z defined by a R b if and only if (a − b) is divisible by 5 is:

    • ASymmetric and transitive only
    • BAn equivalence relation
    • CReflexive and symmetric only
    • DReflexive and transitive only
    Show answer & solution

    Correct answer: (B) An equivalence relation

    a − a = 0 is divisible by 5 (reflexive); if 5 | (a − b) then 5 | (b − a) (symmetric); if 5 | (a − b) and 5 | (b − c) then 5 | (a − c) (transitive). Hence R is an equivalence relation.
  7. Q7hardReport

    The number of equivalence relations that can be defined on a set with exactly 3 elements is:

    • A5
    • B3
    • C6
    • D8
    Show answer & solution

    Correct answer: (A) 5

    Equivalence relations correspond one-to-one with partitions of the set. The number of partitions of a 3-element set is the Bell number B(3) = 5.

Ready to test yourself? Take the 22-question Sets, Relations and Functions test →