Skip to main content
Back to MATHEMATICAL REASONING

Your Progress

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

Mathematical reasoning practice · Easy

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 61-90 of 171 questions

Preparing practice and saved progress…

61 Easy
61 of 171
Understanding +4 | -1
Consider the following statements:
A : Rishi is a judge.
B : Rishi is honest.
C : Rishi is not arrogant.
The negation of the statement “if Rishi is a judge and he is not arrogant, then he is honest” is
View answer and explanation
Correct option: B
(∼B)∧(A∧C)( \sim B) \wedge (A \wedge C)
Option B ((∼B)∧(A∧C)( \sim B) \wedge (A \wedge C)) is correct because it represents the negation of the given conditional statement.
62 Easy
62 of 171
Understanding +4 | -1
If p:p: Ashok works hard

qq : Ashok gets good grade

The verbal form for (∼p→q)(\sim p \rightarrow q) is
View answer and explanation
Correct option: B
If Ashok does not work hard then he gets good grade
Option B (If Ashok does not work hard then he gets good grade) is correct because it accurately translates the logical expression (∼p→q)(\sim p \rightarrow q) into a verbal statement.
63 Easy
63 of 171
Application +4 | -1
If p,q,rp, q, r are substatements with truth values. T,T,FT, T, F then the Statement r→(p∧∼q)∨(∼q∧∼r)r \rightarrow(p \wedge \sim q) \vee(\sim q \wedge \sim r) will be
View answer and explanation
Correct option: A
True
Option A (True) is correct because, with the given truth values, the implication r→(p∧∼q)∨(∼q∧∼r)r \rightarrow (p \wedge \sim q) \vee (\sim q \wedge \sim r) evaluates to F→FF \rightarrow F, which is true.
64 Easy
64 of 171
Understanding +4 | -1
If pp and qq are two statements. Then negation of compound statement (∼p∨q)(\sim p \vee q) is
View answer and explanation
Correct option: C
p∧∼q{p} \wedge \sim {q}
Option C is correct because the negation of (~p OR q) is (p AND ~q) according to De Morgan's law.
65 Easy
65 of 171
Understanding +4 | -1
The statement p⇔qp \Leftrightarrow q is equal to -
View answer and explanation
Correct option: C
(∼p∨q)∧(p∨∼q)(\sim p \vee q) \wedge(p \vee \sim q)
Option C is correct because p ⇔ q is logically equivalent to (¬p ∨ q) ∧ (p ∨ ¬q).
66 Easy
66 of 171
Understanding +4 | -1
The negative of the proposition : “If a number is divisible by 15, then it is divisible by 5 or 3”
View answer and explanation
Correct option: B
A number is divisible by 15 and it is not divisible by 5 and 3
Option B is correct because the negation of "If p then q" is "p and not q".
67 Easy
67 of 171
Understanding +4 | -1
Converse of the statement:

If a number nn is even, then n2n^2 is even, is
View answer and explanation
Correct option: A
If a number n2n^2 is even, then nn is even
Option A (If a number n2n^2 is even, then nn is even) is the correct converse of the given statement.
68 Easy
68 of 171
Analyzing +4 | -1
The proposition p→∼(p∧∼q)p \to \sim \left( {p \wedge \sim q} \right) is
View answer and explanation
Correct option: D
Neither a tautology nor a contradiction
The proposition is neither a tautology nor a contradiction because it simplifies to ∼p∨q\sim p \vee q, which depends on the truth values of both p and q.
69 Easy
69 of 171
Understanding +4 | -1
∼(∼p)↔p\sim \left( { \sim p} \right) \leftrightarrow p is
View answer and explanation
Correct option: A
A tautology
Option A is correct because the double negation of p is equivalent to p, making the biconditional a tautology.
70 Easy
70 of 171
Understanding +4 | -1
If pp and qq are two simple propositions, then p↔ ∼qp \leftrightarrow \, \sim q is true when
View answer and explanation
Correct option: C
pp is false and qq is true
Option C (pp is false and qq is true) is correct because the biconditional is true when both sides have opposite truth values, and since qq is negated, pp must be false and qq must be true.
71 Easy
71 of 171
Understanding +4 | -1
Let pp and qq be the statements:

pp : Rakshit gets 100%100 \% marks in mathematics

q:q: Rakshit is a good dancer.

The verbal form of ∼p→q\sim p \rightarrow q is
View answer and explanation
Correct option: A
If Rakshit does not get 100%100 \% marks in mathematics, then Rakshit is a good dancer
Option A is correct because it accurately represents the conditional statement ∼p→q\sim p \rightarrow q in verbal form.
72 Easy
72 of 171
Analyzing +4 | -1
For integers mm and nn, both greater than 1 , consider the following three statements : < br>
P:mP: m divides nn

Q:mQ: m divides n2n^2

R:mR: m is prime,

then
View answer and explanation
Correct option: A
Q∧R→PQ \wedge R \rightarrow P
Option A (Q∧R→PQ \wedge R \rightarrow P) is correct because if mm divides n2n^2 and mm is prime, then mm must divide nn.
73 Easy
73 of 171
Analyzing +4 | -1
Let the operations ∗,⊙∈{∧,∨}*, \odot \in\{\wedge, \vee\}. If (p∗q)⊙(p⊙∼q)(p * q) \odot(p \odot \sim q) is a tautology, then the ordered pair (∗,⊙)(*, \odot) is
View answer and explanation
Correct option: B
(∨,∨)(\vee, \vee)
Option B ((\vee, \vee)) is correct because it results in a tautology when substituted into the given expression.
74 Easy
74 of 171
Understanding +4 | -1
Negation of p→qp \rightarrow q is
View answer and explanation
Correct option: A
p∧(∼q)p \wedge(\sim q)
Option A (p∧(∼q)p \wedge (\sim q)) is correct because it represents the negation of the conditional statement p→qp \rightarrow q.
75 Easy
75 of 171
Remembering +4 | -1
Let pp and qq be two propositions. Then the inverse of the implication p→qp \to q is
View answer and explanation
Correct option: B
∼p→∼q\sim p \to \sim q
Option B (∼p→∼q\sim p \to \sim q) is correct because the inverse of the implication p→qp \to q is defined as ∼p→∼q\sim p \to \sim q.
76 Easy
76 of 171
Understanding +4 | -1
Negation of the statement :
5\sqrt 5 is an integer or 5 is an irrational is
View answer and explanation
Correct option: D
5\sqrt 5 is not an integer and 5 is not irrational
Option D (5\sqrt 5 is not an integer and 5 is not irrational) is correct because it represents the negation of the given statement using De Morgan's Law.
77 Easy
77 of 171
Understanding +4 | -1
The dual of the statement [p∨(∼q)]∧(∼p)\left[ {p \vee \left( { \sim q} \right)} \right] \wedge \left( { \sim p} \right) is
View answer and explanation
Correct option: B
(p∧∼q)∨∼p\left( {p \wedge \sim q} \right) \vee \sim p
Option B is correct because the dual of a statement is obtained by replacing ∧\wedge with ∨\vee and ∨\vee with ∧\wedge.
78 Easy
78 of 171
Understanding +4 | -1
The contrapositive statement of 'If x2=25x^2=25, then ( x=5x=5 or x=−5)\left.x=-5\right) ' is ...... .
View answer and explanation
Correct option: C
If x≠5x \neq 5 and x≠−5x \neq-5, then x2≠25x^2 \neq 25
Option D is correct because it correctly identifies both the contrapositive and converse statements of the given conditional statement.
79 Easy
79 of 171
Analyzing +4 | -1
The statement ∼[p∨(∼(p∧q))]\sim[p \vee(\sim(p \wedge q))] is equivalent to
View answer and explanation
Correct option: D
∼(p∨q)\sim(p \vee q)
Option D (∼(p∨q)\sim(p \vee q)) is correct because by applying De Morgan's laws and simplification rules, the given statement is logically equivalent to ∼p∧∼q\sim p \wedge \sim q, which is the same as ∼(p∨q)\sim(p \vee q).
80 Easy
80 of 171
Analyzing +4 | -1
Which one of the following Boolean expressions is a tautology?
View answer and explanation
Correct option: A
(p∨q)∨(p∨∼q)\left( {p \vee q} \right) \vee \left( {p \vee \sim q} \right)
Option A ((p∨q)∨(p∨∼q)\left( {p \vee q} \right) \vee \left( {p \vee \sim q} \right)) is correct because it simplifies to p∨(q∨∼q)p \vee (q \vee \sim q), which is always true (a tautology).
81 Easy
81 of 171
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-{p} \vee-{q}
Option C (A.P., G.P. and H.P.) is correct because if all numbers are equal and non-zero, they satisfy the conditions for being in arithmetic, geometric, and harmonic progressions.
82 Easy
82 of 171
Application +4 | -1
   −[p⇒(∼p∨q)]=….\,\,\,-[p \Rightarrow(\sim p \vee q)]=\ldots ..
View answer and explanation
Correct option: D
p∧∼qp \wedge \sim q
Option D (p∧∼qp \wedge \sim q) is correct because by applying logical equivalences and De Morgan's law, the given expression simplifies to this form.
83 Easy
83 of 171
Understanding +4 | -1
The inverse of the proposition (p∧∼q)→r\left( {p \wedge \sim q} \right) \to r is
View answer and explanation
Correct option: B
∼p∨q→∼r\sim p \vee q \to \sim r
Option B (∼p∨q→∼r\sim p \vee q \to \sim r) is correct because it represents the inverse of the given proposition, which involves negating the antecedent and consequent.
84 Easy
84 of 171
Understanding +4 | -1
Which of the following is a statement?
View answer and explanation
Correct option: C
6 is a natural number
Option C (6 is a natural number) is the correct answer because it is a declarative sentence that is either true or false, making it a statement.
85 Easy
85 of 171
Analyzing +4 | -1
The negation of the Boolean expression ((∼q)∧p)⇒((∼p)∨q)(( \sim q) \wedge p) \Rightarrow (( \sim p) \vee q) is logically equivalent to:
View answer and explanation
Correct option: C
∼(p⇒q)\sim (p \Rightarrow q)
Option C (∼(p⇒q)\sim (p \Rightarrow q)) is correct because the negation of the given Boolean expression is logically equivalent to the negation of p⇒qp \Rightarrow q.
86 Easy
86 of 171
Understanding +4 | -1
Consider the following statements.

I. "Every rectangle is a square" is a statement.

II. "Close the door" is not a statement.

Choose the correct option.
View answer and explanation
Correct option: C
Both are true
Option C (Both are true) is correct because the first statement is false, making it a statement, and the second statement is a command, thus not a statement.
87 Easy
87 of 171
Understanding +4 | -1
If p:p: Ram is smart
q:q: Ram is intelligent
Then, the symbolic form Ram is smart and intelligent, is
View answer and explanation
Correct option: A
(p∧q)\left( {p \wedge q} \right)
Option A is correct because "and" is represented by the logical operator ∧\wedge.
88 Easy
88 of 171
Understanding +4 | -1
Dual of (x′∨y′)′=x∧y{\left( {x' \vee y'} \right)^\prime } = x \wedge y is
View answer and explanation
Correct option: B
(x′∧y′)′=x∨y{\left( {x' \wedge y'} \right)^\prime } = x \vee y
Option B is correct because the dual of a statement is obtained by replacing ∧\wedge with ∨\vee, ∨\vee with ∧\wedge, 0 with 1, and 1 with 0.
89 Easy
89 of 171
Understanding +4 | -1
If p⇒(q∨r)p \Rightarrow (q \vee r) is false, then the truth values of p, q, r are respectively
View answer and explanation
Correct option: B
T, F, F
Option B (T, F, F) is correct because for the implication p⇒(q∨r)p \Rightarrow (q \vee r) to be false, p must be true and (q∨r)(q \vee r) must be false, which means both q and r must be false.
90 Easy
90 of 171
Understanding +4 | -1
For any two statements pp and qq, the negation of the expression p∨(∼p∧q)p \vee ( \sim p \wedge q) is
View answer and explanation
Correct option: A
∼p∧∼q\sim p \wedge \sim q
Option A (∼p∧∼q\sim p \wedge \sim q) is correct because it represents the negation of the given expression after simplification using the distributive and De Morgan's laws.
Revision notes and key takeaways

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

Showing 61-90 of 171 questions

Your practice

0 / 171 answered · 171 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.