Skip to main content
Back to MATHEMATICAL REASONING

Your Progress

0 / 232 Answered
0
Correct
0
Incorrect
0%
Accuracy
JEE • MATHEMATICS • MATHEMATICAL REASONING

Mathematical reasoning practice · Mixed difficulty

Choose an answer to check it, or open “View answer” to study the explanation. Sign in to save progress to your account.

Practice format and chapter quiz

These sets use single-correct-answer MCQs. They do not cover every JEE Main or JEE Advanced question format and are not full-length mock papers.

Take a chapter quiz →
Showing 121-150 of 232 questions

Preparing practice and saved progress…

121 Medium
121 of 232
Analyzing +4 | -1
If (p∧∼r)⇒(q∨r)(p \wedge \sim r) \Rightarrow(q \vee r) is false and qq and rr are both false, then pp is
View answer and explanation
Correct option: A
TRUE
Option A (TRUE) is correct because if (p∧∼r)⇒(q∨r)(p \wedge \sim r) \Rightarrow (q \vee r) is false, then (p∧∼r)(p \wedge \sim r) must be true and (q∨r)(q \vee r) must be false. Since rr is false, ∼r\sim r is true, and for (p∧∼r)(p \wedge \sim r) to be true, pp must be true.
122 Medium
122 of 232
Understanding +4 | -1
The contrapositive of (p∨q)⇒r(p \vee q) \Rightarrow r is
View answer and explanation
Correct option: C
∼r⇒∼p∧∼q\sim {r} \Rightarrow \sim {p} \wedge \sim {q}
Option C (∼r⇒∼p∧∼q\sim {r} \Rightarrow \sim {p} \wedge \sim {q}) is correct because it represents the contrapositive of the given implication.
123 Medium
123 of 232
Remembering +4 | -1
Consider the following statements.

Statement-I: The words "And" and "or" are connectives.

Statement-II: "There exists" and "For all" are called quantifiers.
View answer and explanation
Correct option: C
Both Statement are true
Option C (Both Statement are true) is correct because "And" and "or" are connectives, and "There exists" and "For all" are quantifiers in mathematical logic.
124 Easy
124 of 232
Analyzing +4 | -1
If Δ∈{∨,∧}\Delta \in\{\vee, \wedge\}, then the negation of Boolean expression (p→p∨q)Δ(p∧q→q)(p \rightarrow p \vee q) \Delta(p \wedge q \rightarrow q) is
View answer and explanation
Correct option: A
A contradiction
Option A (A contradiction) is correct because both implications are tautologies, and the negation of a tautology is a contradiction.
125 Medium
125 of 232
Analyzing +4 | -1
Consider the following three statements

p:p: Person ‘A’ passed in Mathematics exam

q:q: Person ‘A’ passed in Physics exam

r:r: Person ‘A’ passed in Chemistry exam

The statement ∼((∼(p⇒q))⇒r)\sim \left( {\left( { \sim \left( {p \Rightarrow q} \right)} \right) \Rightarrow r} \right) is equivalent to
View answer and explanation
Correct option: A
Person A passed only in Mathematics among Mathematics, Physics and Chemistry
Option A (Person A passed only in Mathematics among Mathematics, Physics and Chemistry) is correct because the given statement simplifies to p AND (NOT q) AND (NOT r).
126 Easy
126 of 232
Understanding +4 | -1
Which of the following is not a statement?
View answer and explanation
Correct option: D
Come here
Option D (Come here) is the correct answer because it is an imperative sentence, which is not a statement.
127 Easy
127 of 232
Understanding +4 | -1
Which of the following is equivalent to the Boolean expression p∧∼q?p \wedge \sim q?
View answer and explanation
Correct option: D
∼(p→q)\sim (p \to q)
Option D (∼(p→q)\sim (p \to q)) is correct because it is logically equivalent to p∧∼qp \wedge \sim q based on the definition of implication and negation.
128 Easy
128 of 232
Understanding +4 | -1
The Statement that is TRUE among the following is
View answer and explanation
Correct option: A
The contrapositive of 3x+2=8⇒x=23 x+2=8 \Rightarrow x=2 is x≠2x \neq 2 ⇒3x+2≠8\Rightarrow 3 x+2 \neq 8
Option A (The contrapositive of 3x+2=8⇒x=23 x+2=8 \Rightarrow x=2 is x≠2x \neq 2 ⇒3x+2≠8\Rightarrow 3 x+2 \neq 8) is correct because it correctly identifies the contrapositive of the given statement.
129 Medium
129 of 232
Understanding +4 | -1
The statement p→(q→p)p \rightarrow(q \rightarrow p) is equivalent is:
View answer and explanation
Correct option: B
p→(q∨p)p \rightarrow(q \vee p)
Option B (p→(q∨p)p \rightarrow(q \vee p)) is correct because it is logically equivalent to p→(q→p)p \rightarrow(q \rightarrow p) based on truth table analysis.
130 Easy
130 of 232
Understanding +4 | -1
If I become a teacher, then I will open a school", is
View answer and explanation
Correct option: A
I will become a teacher and I will not open a school.
Option A (I will become a teacher and I will not open a school) is correct because it is the negation of the given statement.
131 Easy
131 of 232
Understanding +4 | -1
The logically equivalent proposition of p⇔qp \Leftrightarrow q is
View answer and explanation
Correct option: B
(p⇒q)∧(q⇒p)\left( {p \Rightarrow q} \right) \wedge \left( {q \Rightarrow p} \right)
Option B ((p⇒q)∧(q⇒p)\left( {p \Rightarrow q} \right) \wedge \left( {q \Rightarrow p} \right)) is correct because it is the definition of logical equivalence (biconditional).
132 Easy
132 of 232
Analyzing +4 | -1
If p:4p:4 an even prime number q:6q:6 is a divisor of 12 and r:r: the HCF of 4 and 6 is 2, then which one of the following is true?
View answer and explanation
Correct option: D
∼p∨(q∧r)\sim p \vee \left( {q \wedge r} \right)
Option D (∼p∨(q∧r)\sim p \vee (q \wedge r)) is true because pp is false, qq is true, and rr is true, making the disjunction true.
133 Easy
133 of 232
Analyzing +4 | -1
Which of the following is false?
View answer and explanation
Correct option: C
(p∧(p→))→\left( {p \wedge \left( {p \to } \right)} \right) \to is a contradiction
Option C is false because (p∧(p→q))→q(p \wedge (p \to q)) \to q is a tautology, not a contradiction. It represents Modus Ponens.
134 Easy
134 of 232
Analyzing +4 | -1
The statement (p⇒q)∨(p⇒r)(p \Rightarrow q) \vee(p \Rightarrow r) is NOT equivalent to
View answer and explanation
Correct option: B
(∼q)⇒((∼r)∨p)(\sim q) \Rightarrow((\sim r) \vee p)
Option B is the correct answer because (∼q)⇒((∼r)∨p)(\sim q) \Rightarrow((\sim r) \vee p) is not equivalent to (p⇒q)∨(p⇒r)(p \Rightarrow q) \vee(p \Rightarrow r) after logical transformations.
135 Medium
135 of 232
Understanding +4 | -1
The contrapositive of the statement, "I x\mathrm{x} is a prime number and x\mathrm{x} divides ab\mathrm{ab} then x\mathrm{x} divides a\mathrm{a} or x\mathrm{x} ivides b", can be symbolically represented using logical connectives, on apporpriately-defined statements p,q,r,sp, q, r, s, as
View answer and explanation
Correct option: C
(∼r∧∼s)→(∼p∨∼q)(\sim \mathrm{r} \wedge \sim s) \rightarrow(\sim p \vee \sim q)
Option C ((∼r∧∼s)→(∼p∨∼q)(\sim r \wedge \sim s) \rightarrow (\sim p \vee \sim q)) is correct because it accurately represents the contrapositive of the given statement using logical connectives.
136 Easy
136 of 232
Understanding +4 | -1
Let AA, BB, CC and DD be four non-empty sets. The contrapositive statement of
"If A ⊆ BA\, \subseteq \,B and B ⊆ DB\, \subseteq \,D, then A ⊆ CA\, \subseteq \,C " is
View answer and explanation
Correct option: A
If A⊈C, then  A⊈B  or  B⊈D\mathrm{If}\,A\not \subseteq C,\,\mathrm{then}\,\,A\not \subseteq B\,\,\mathrm{or}\,\,B\not \subseteq D
Option A (If A⊈C,,thenA⊈B,orB⊈D\mathrm{If}\,A\not \subseteq C,\\,\mathrm{then}\\ A\not \subseteq B\\,\mathrm{or}\\ B\not \subseteq D) is correct because it correctly represents the contrapositive of the given statement.
137 Easy
137 of 232
Application +4 | -1
Simplify (p∨q)∧(p∨∼q)\left( {p \vee q} \right) \wedge \left( {p \vee \sim q} \right)
View answer and explanation
Correct option: A
pp
Option A (pp) is correct because the expression simplifies to pp using the distributive and complement laws of Boolean algebra.
138 Easy
138 of 232
Understanding +4 | -1
Consider the following statements:

PP : I have fever

QQ : I will not take medicine

RR : I will take rest

The statement "If I have fever, then I will take medicine and I will take rest
View answer and explanation
Correct option: C
((∼P)∨∼Q)∧((∼P)∨R)((\sim P) \vee \sim Q) \wedge((\sim P) \vee R)
Option C is correct because it accurately represents the logical statement "If I have fever, then I will not take medicine and I will take rest" in symbolic form.
139 Medium
139 of 232
Understanding +4 | -1
The negation of x∈A∩B⇒(x∈Ax \in \mathrm{A} \cap \mathrm{B} \Rightarrow(x \in \mathrm{A} and x∈B)x \in \mathrm{B}) is ......
View answer and explanation
Correct option: C
x∈A∩Bx \in \mathrm{A} \cap \mathrm{B} and (x∉A(x \notin \mathrm{A} or x∉B)x \notin \mathrm{B})
Option C is the correct answer because it accurately represents the negation of the biconditional statement using the correct logical operators.
140 Easy
140 of 232
Understanding +4 | -1
Let RR be the set of real numbers and x∈Rx \in R. Then, x+3=8x+3=8 is
View answer and explanation
Correct option: A
open statement
Option A (open statement) is correct because the truth value of the equation depends on the value of x.
141 Easy
141 of 232
Analyzing +4 | -1
The proposition p→ ∼ (p∧∼q)p \to \, \sim \,(p \wedge \sim q) is equivalent to
View answer and explanation
Correct option: B
(∼p)∨q( \sim p) \vee q
Option B (∼p)∨q( \sim p) \vee q is correct because the given proposition simplifies to this equivalent form using logical equivalences.
142 Easy
142 of 232
Understanding +4 | -1
Let

pp : Ramesh listens to music.

q:q: Ramesh is out of his village.

rr : It is Sunday.

ss : It is Saturday.

Then the statement "Ramesh listens to music only if he is in his village and it is Sunday or Saturday" can be expressed as
View answer and explanation
Correct option: D
p⇒((∼q)∧(r∨s)p \Rightarrow((\sim q) \wedge(r \vee s)
Option D (p⇒((∼q)∧(r∨s)p \Rightarrow((\sim q) \wedge(r \vee s)) is correct because it accurately translates the given statement into logical notation.
143 Easy
143 of 232
Analyzing +4 | -1
If (p→(p∧∼q)(p \to (p \wedge \sim q) is false, then the truth values of p and q are respectively
View answer and explanation
Correct option: D
T, T
Option D (T, T) is correct because for the implication to be false, the antecedent (p) must be true and the consequent (p∧∼qp \wedge \sim q) must be false, which implies both p and q are true.
144 Medium
144 of 232
Analyzing +4 | -1
The following statement (p→q)→[(∼p→q)→q](\mathrm{p} \rightarrow \mathrm{q}) \rightarrow[(\sim \mathrm{p} \rightarrow \mathrm{q}) \rightarrow \mathrm{q}] is:
View answer and explanation
Correct option: A
A tautology
The statement is a tautology. By simplifying the given logical expression using logical equivalences, it reduces to a statement that is always true.
145 Easy
145 of 232
Understanding +4 | -1
Negation of statement : if we control population growth we prosper, is
View answer and explanation
Correct option: C
we control population and we do not prosper
Option C (we control population and we do not prosper) is correct because the negation of "if p then q" is "p and not q".
146 Easy
146 of 232
Understanding +4 | -1
The contrapositive of the statement “ If I reach the station in time, then I will catch the train” is
View answer and explanation
Correct option: B
If I will not catch the train, then I do not reach the station in time
The correct answer is B (If I will not catch the train, then I do not reach the station in time) because it correctly applies the contrapositive transformation.
147 Easy
147 of 232
Remembering +4 | -1
A compound sentence formed by two simple statements pp and qq using connective 'or' is called
View answer and explanation
Correct option: B
Disjunction
Option B (Disjunction) is correct because a compound statement formed by two simple statements connected by 'or' is called a disjunction.
148 Medium
148 of 232
Analyzing +4 | -1
The Boolean expression (p∧∼q)∨q∨(∼p∧q)(p \wedge \sim q) \vee q \vee(\sim p \wedge q) is equivalent to
View answer and explanation
Correct option: B
p∨qp \vee q
Option B (p∨qp \vee q) is correct because the given Boolean expression simplifies to p∨qp \vee q using Boolean algebra laws.
149 Medium
149 of 232
Understanding +4 | -1
The contrapositive and converse of the statement ' 1 go to beach whenever it is a sunny day' is
View answer and explanation
Correct option: A
(i) if it is not a sunny day, then I do not go to beach
(ii) if it is a sunny day, then II go to beach
The correct answer is A because it correctly identifies the contrapositive and converse of the given statement.
150 Easy
150 of 232
Understanding +4 | -1
Contrapositive of p→(q→r)p \rightarrow(q \rightarrow r) is logically equivalent to
View answer and explanation
Correct option: A
p→(q→r)p \rightarrow(q \rightarrow r)
Option A (p→(q→r)p \rightarrow (q \rightarrow r)) is correct because the contrapositive of p→(q→r)p \rightarrow (q \rightarrow r) is logically equivalent to itself.
Revision notes and key takeaways

Review MATHEMATICAL REASONING in your textbook or class notes, then use this set to check your understanding.

Showing 121-150 of 232 questions

Your practice

0 / 232 answered · 232 remaining · 0% accuracy

Progress is stored on this device. Sign in to save to your account.

✓ Correct · ✗ Incorrect · ○ Unanswered

Answer feedback and difficulty

Type at least 2 characters or jump directly:
🔓

Save your learning progress

Sign in with a free account to save your practice answers and quiz results, then return to them when you revise.