PadhoNaby JEE Master
  • Home
  • Learn
  • Plan & Focus
  • Community
  • Pricing
  • Play & Compete
  • Free Resources
Log inJoin Free
PadhoNaby JEE Master

Ask. Share. Learn. Grow Together. India's all-in-one community for JEE Main & JEE Advanced aspirants.

Explore

  • Learn
  • Plan & Focus
  • Community
  • Play & Compete
  • Free Resources

Resources

  • JEE Main PYQs
  • JEE Advanced PYQs
  • Formula Sheets
  • NCERT Mapping
  • Mock Analysis

Support

  • Help Center
  • Privacy Policy
  • Terms of Use
  • Contact Us

© 2026 PadhoNa. All rights reserved.

Unique PYQs / Maths

Sets and Relations

85 PYQs → 28 unique concepts, 57 similar PYQs. The first 3 are free.

JEE Main 2026 · JEE Main 23 Jan 2026 Shift-I

Count R from an inequality, then minimum pairs to make it reflexive/symmetric

Relations and Types of Relations (Reflexive, Symmetric, Transitive, Equivalence)Asked 5 times (2024, 2025, 2026) • Solving this covers 4 similar PYQs

Let A={−2,−1,0,1,2,3,4}. Let R be a relation on A defined by xRy if and only if 2x+y⩽2. Let l be the number of elements in R. Let m and n be the minimum number of elements required to be added in R to make it reflexive and symmetric relations respectively. Then l+m+n is equal to :
Theory · how these 5 PYQs are the same concept
List R row by row from the inequality to get l. For reflexivity add every missing (x,x); for symmetry add the reverse of every pair (x,y) whose (y,x) is absent. These counts are independent. Trap: adding reverse pairs for diagonal elements, or counting a pair whose reverse already satisfies the inequality.

How NTA asks it

Inequalities and sets rotate (2x+y≤2, 2x≤3y, 4x≤5y, 0≤x2+2y≤4, y=max{x,1}); the answer is l+m or l+m+n.
  • 2026 (Unique PYQ): Unique PYQ: l from 2x+y≤2, m for reflexive, n for symmetric; l+m+n=33.
  • 2026: Same method with 2x≤3y; asks l + symmetric additions.
  • 2025: Same with $y=\max\{x,1\}$; l+m+n=12.
  • 2025: Same counting with $0\le x^2+2y\le4$; l + reflexive additions.
  • 2024: Same method with 4x≤5y; m+n=25.
JEE Main 2025 · JEE Main 29 Jan 2025 Shift-I

Relations that reduce to equality or a partition: equivalence

Relations and Types of Relations (Reflexive, Symmetric, Transitive, Equivalence)Asked 5 times (2021, 2022, 2023, 2025) • Solving this covers 4 similar PYQs

Define a relation R on the interval [0,2π​) by xRy if and only if sec2x−tan2y=1. Then R is :
Theory · how these 5 PYQs are the same concept
If the condition simplifies to 'same value of some function' (b1​=b2​, tan2x=tan2y, A=B via symmetric difference empty) or 'same block of a partition' or similarity PAP−1=B, it is an equivalence relation. The class of an element is the level set of that function. Trap: missing that sec2x−tan2y=1 reduces to x=y on [0,π/2).

How NTA asks it

Asked as relations on power sets, partitions, matrices, intervals of reals, or R×R with a statement about what an equivalence class looks like.
  • 2025 (Unique PYQ): Unique PYQ: sec²x − tan²y = 1 ⇔ x=y on [0,π/2): equivalence.
  • 2025: Equality of second coordinates; its class is a horizontal line, not parallel to y=x.
  • 2023: Same reduction: both power-set conditions mean A=B; both equivalence.
  • 2022: Same: 'same block of a partition' is an equivalence relation.
  • 2021: Same conclusion for matrix similarity via $(QP)A(QP)^{-1}$.
JEE Main 2026 · JEE Main 22 Jan 2026 Shift-II

Counting subsets satisfying a condition (complement counting)

Sets, Venn Diagrams and Operations on SetsAsked 4 times (2022, 2025, 2026) • Solving this covers 3 similar PYQs

Let S be the set of the first 11 natural numbers. Then the number of elements in A={B⊆S:n(B)⩾2 and the product of all elements of B is even } is ______ .
Theory · how these 4 PYQs are the same concept
When a condition is 'at least one / contains / product even', count the opposite. Subsets avoiding a fixed k-element part of an n-set: 2n−k; so subsets meeting it number 2n−2n−k. Subsets containing a given element: 2n−1. Size restrictions remove the empty set and singletons separately. Trap: forgetting to remove the empty set or the singletons from both the total and the complement.

How NTA asks it

Rotated as subsets with even product, subsets meeting another set, union with a prime-sum family, or pairs (prime, product of distinct primes) counted via subsets containing that prime.
  • 2026 (Unique PYQ): Unique PYQ: subsets of size ≥2 of {1..11} with even product = all minus odd-only ones.
  • 2025: Divisibility pairs reduce to counting subsets containing a fixed prime, $2^9$ each; same subset counting.
  • 2022: Same complement idea: subsets of A meeting B = $2^7-2^4$.
  • 2022: Complement for 'either 1∉T or 2∈T', then adds the prime-sum subsets outside it; same counting logic.

Set operations on intervals from absolute-value inequalities

Asked 4 times (2020, 2021, 2022, 2026) • covers 3 similar PYQs

Minimum additions to make an equation-defined relation symmetric (or reflexive)

Asked 4 times (2023, 2024, 2026) • covers 3 similar PYQs

Congruence modulo n as an equivalence relation

Asked 4 times (2022, 2023, 2025, 2026) • covers 3 similar PYQs

Symmetric condition without reflexivity (x+y=7, swapped values, max in a set)

Asked 4 times (2023, 2025) • covers 3 similar PYQs

Bounds on the overlap: $\max(0,a+b-100)\le n(A\cap B)\le\min(a,b)$

Asked 4 times (2020, 2021, 2024) • covers 3 similar PYQs

Inequality/distance relations: reflexive and symmetric but not transitive

Asked 4 times (2021, 2022, 2024) • covers 3 similar PYQs

Number of subsets: $2^n$, of $A\times B$, and relations $2^{mn}$

Asked 4 times (2019, 2020, 2021, 2023) • covers 3 similar PYQs

Size of a relation on $A\times A$ defined by a linear equation (match sums)

Asked 3 times (2023, 2024, 2026) • covers 2 similar PYQs

Counting pairs of a relation from an inequality or difference condition

Asked 3 times (2022, 2023, 2026) • covers 2 similar PYQs

Counting relations with given properties (reflexive+symmetric, equivalence, partitions)

Asked 3 times (2022, 2025, 2026) • covers 2 similar PYQs

Sets defined by arithmetic conditions: list as an AP or by number theory

Asked 3 times (2021, 2023, 2025) • covers 2 similar PYQs

Counting reflexive, transitive, non-symmetric relations containing given pairs

Asked 3 times (2023, 2025) • covers 2 similar PYQs

Smallest equivalence (or symmetric+transitive) relation containing given pairs

Asked 3 times (2023, 2025) • covers 2 similar PYQs

Simplify the defining condition first (factor / divide / parity), then test

Asked 3 times (2021, 2023, 2024) • covers 2 similar PYQs

Relation size by independent choices (product rule)

Asked 3 times (2022, 2023) • covers 2 similar PYQs

Rational/irrational conditions in relations: counterexamples with surds

Asked 3 times (2020, 2023) • covers 2 similar PYQs

Inclusion–exclusion on multiples (divisibility counting and sums)

Asked 3 times (2019, 2020, 2022) • covers 2 similar PYQs

Domain and range of a relation (and of $R^{-1}$)

Asked 2 times (2020, 2025) • covers 1 similar PYQ

Solving the defining equations/regions of two sets, then counting the union

Asked 2 times (2025) • covers 1 similar PYQ

Three-set Venn word problem: 'exactly two' via inclusion–exclusion

Asked 2 times (2023) • covers 1 similar PYQ

Set identities and Venn-diagram interpretation

Asked 2 times (2019, 2021) • covers 1 similar PYQ

Equivalence class of a given element

Asked 2 times (2021) • covers 1 similar PYQ

Longest chain of pairs in a relation $a=2b+1$

Asked in 2025

Partitioning a set into equal labelled parts: $\frac{n!}{(k!)^m}$

Asked in 2024

Double counting incidences across a family of sets

Asked in 2020