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

Mathematical Reasoning

103 PYQs → 31 unique concepts, 72 similar PYQs. The first 3 are free.

JEE Main 2021 · JEE Main 31 Aug 2021 Shift-II

Negation of an implication: $\sim(a\Rightarrow b)\equiv a\wedge\sim b$

Statements, Logical Connectives and Truth TablesAsked 7 times (2019, 2021, 2022, 2023) • Solving this covers 6 similar PYQs

Negation of the statement (p∨r)⇒(q∨r) is :
Theory · how these 7 PYQs are the same concept
An implication a⇒b is false only when a is true and b is false, so ∼(a⇒b)≡a∧∼b. Never write ∼a⇒∼b (that is the inverse, not the negation). After writing a∧∼b, simplify: for example (p∨r)∧∼q∧∼r collapses to p∧∼q∧∼r because ∼r kills the r branch.

How NTA asks it

Asked as the negation of p⇒∼q, ∼p⇒q, a nested implication, or in reverse ('which option equals p∧∼q?'). Larger ones have a compound antecedent or consequent that then needs simplifying.
  • 2021 (Unique PYQ): Unique PYQ: negation of $(p\vee r)\Rightarrow(q\vee r)$; write $a\wedge\sim b$ and cancel the r branch.
  • 2023: Negation of $(p\to q)\to(q\to p)$; outer rule first, then simplify to $q\wedge\sim p$.
  • 2022: Same rule on $(p\vee q)\Rightarrow((\sim r)\vee p)$; the $\sim p$ term forces q, giving $\sim p\wedge q\wedge r$.
  • 2022: Antecedent and consequent are $\sim(p\Rightarrow q)$ and $p\Rightarrow q$; negation gives $\sim(p\Rightarrow q)$.
  • 2021: Reverse form: pick which option equals $p\wedge\sim q$; it is $\sim(p\to q)$.
  • 2019: Two-letter case $\sim(p\Rightarrow\sim q)\equiv p\wedge q$; the same rule in its simplest form.
  • 2019: Negated antecedent: $\sim(\sim p\rightarrow q)\equiv\sim p\wedge\sim q$; same rule.
JEE Main 2020 · JEE Main 06 Sep 2020 Shift-I

Negation of an AND/OR expression: absorb or distribute first, then De Morgan

Statements, Logical Connectives and Truth TablesAsked 7 times (2019, 2020, 2021, 2023) • Solving this covers 6 similar PYQs

The negation of the Boolean expression p∨(∼p∧q) is equivalent to :
Theory · how these 7 PYQs are the same concept
Before negating, shrink the expression. Absorption gives p∨(∼p∧q)≡p∨q and p∧(∼p∨q)≡p∧q; distribution handles products of brackets. Then apply De Morgan: ∼(a∨b)≡∼a∧∼b and ∼(a∧b)≡∼a∨∼b. The trap is negating term by term without flipping every ∧ into ∨ (and vice versa), or forgetting that the simplified form is what the options list.

How NTA asks it

NTA swaps the inner pattern (p ee(\sim p\wedge q), \sim s ee(\sim r\wedge s), (p\wedge\sim q) ee\sim p, a product of two brackets) and asks 'negation is equivalent to'; the options are always the reduced form.
  • 2020 (Unique PYQ): Unique PYQ: negation of $p\vee(\sim p\wedge q)$; absorb to $p\vee q$ then negate to $\sim p\wedge\sim q$.
  • 2023: Negation of a product $(p\vee q)\wedge(q\vee\sim r)$; De Morgan then factor out $\sim q$.
  • 2023: Distribute $(p\wedge\sim q)\vee\sim p$ to $\sim p\vee\sim q$, then negate to $p\wedge q$; same toolkit.
  • 2023: Variant $q\vee(\sim q\wedge p)$ with roles of p and q swapped; same absorption, answer $\sim p\wedge\sim q$.
  • 2021: Negates $\sim p\wedge(p\vee q)$ first, then distributes to reach $p\vee\sim q$; same two laws in the other order.
  • 2019: Letters s and r instead of p and q: negation of $\sim s\vee(\sim r\wedge s)$ reduces to $s\wedge r$.
  • 2019: Identical expression from 2019; same absorption then De Morgan step.
JEE Main 2021 · JEE Main 25 Jul 2021 Shift-I

Simplify an implication-based expression to a single literal or implication

Statements, Logical Connectives and Truth TablesAsked 6 times (2020, 2021, 2023) • Solving this covers 5 similar PYQs

The Boolean expression (p⇒q)∧(q⇒∼p) is equivalent to:
Theory · how these 6 PYQs are the same concept
Convert every a⇒b to ∼a∨b, then factor: (∼p∨q)∧(∼p∨∼q)=∼p∨(q∧∼q)=∼p. Watch double negations (∼(p∧∼q)=∼p∨q) and duplicates (q∨q=q). The answer is usually ∼p, p⇒q or p⇔q.

How NTA asks it

Pairs of implications, implications with negated brackets, or a messy compound implication; options are short forms like ∼p, p⇒q, (∼p)∨q.
  • 2021 (Unique PYQ): Unique PYQ: $(p\Rightarrow q)\wedge(q\Rightarrow\sim p)$ factors to $\sim p$.
  • 2023: Negated conjunction with implication inside; distributes to $(\sim p)\vee q$.
  • 2023: Antecedent reduces to $\sim(P\wedge Q)$; whole statement becomes $P\Leftrightarrow Q$ in CNF.
  • 2021: $(p\wedge\sim q)\Rightarrow(q\vee\sim p)$ collapses to $p\Rightarrow q$; same conversion.
  • 2020: $p\to\sim(p\wedge\sim q)$ simplifies to $(\sim p)\vee q$.
  • 2020: Same expression from 2020, solved by case analysis on p; answer $\sim p$.

Identify a tautology and match it to an equivalent tautology among options

Asked 6 times (2020, 2021, 2022, 2023) • covers 5 similar PYQs

Inference-rule tautologies: modus ponens, modus tollens, disjunctive syllogism

Asked 6 times (2020, 2021) • covers 5 similar PYQs

Contrapositive of a simple if-then statement ($\sim q\Rightarrow\sim p$)

Asked 6 times (2019, 2020, 2021) • covers 5 similar PYQs

Judge two statements S1, S2: tautology vs contradiction (fallacy) in two letters

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

Truth values of p, q, r that make a three-letter implication false

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

Biconditional: $\sim(p\Leftrightarrow q)\equiv p\Leftrightarrow\sim q$ and case analysis

Asked 5 times (2020, 2022) • covers 4 similar PYQs

Choose ∧/∨ for the blanks so that the statement is a tautology

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

Which option is a tautology: reduce implications with $a o b\equiv\sim a ee b$

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

Negation where the inner statement is secretly a tautology or contradiction

Asked 3 times (2023) • covers 2 similar PYQs

Implication distribution laws: $(P o Q)\wedge(R o Q)\equiv(P ee R) o Q$

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

Simplify a pure AND/OR expression with absorption and distribution

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

Use the forced truth values to evaluate other statements

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

Choose a connective from {∧, ∨, ⇒, ⇔} to make a tautology

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

Negation of a verbal statement (and/or/if-then in words)

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

Choose r from {p, q, ∼p, ∼q} so that the statement is a tautology

Asked 2 times (2022, 2023) • covers 1 similar PYQ

Tautology check of three-letter compound statements

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

Translating an English sentence into symbols ('only if', 'and', 'not')

Asked 2 times (2022, 2023) • covers 1 similar PYQ

Redundant conjunct in the conclusion: $(p\wedge q) o(p\wedge r)\equiv(p\wedge q) o r$

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

Spot a tautology that contains $x ee\sim x$ directly

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

Truth value of compound statements built from real facts

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

Find an unknown connective from a given equivalence

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

Which option is NOT a tautology: find one falsifying row

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

Truth values of p and q that make a two-letter implication false

Asked 2 times (2020) • covers 1 similar PYQ

Contrapositive of $(P\wedge Q) o R$ becomes $\sim R o(\sim P ee\sim Q)$

Asked 2 times (2020) • covers 1 similar PYQ

Counting truth assignments for which a statement is true

Asked in 2023

Converse of an implication (and spotting its equivalent form)

Asked in 2023

Maximum number of clauses simultaneously true (satisfiability)

Asked in 2022

Negation of quantified statements (for all / there exists)

Asked in 2021