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

Try a question, then open “View answer” to check it. Sign in to submit answers and save progress.

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 171 questions
121 Easy
121 of 171
Analyzing +4 | -1
If p⇒(∼p∨q)p \Rightarrow \left( { \sim p \vee q} \right) is false, the truth value of pp and qq are respectively
View answer and explanation
Correct option: D
T,F
Option D (T,F) is correct because for p⇒(∼p∨q)p \Rightarrow (\sim p \vee q) to be false, pp must be true and (∼p∨q)(\sim p \vee q) must be false, implying qq is false.
122 Easy
122 of 171
Understanding +4 | -1
The contra positive of (∼p∧q)→(q∧∼r)(\sim p \wedge q) \rightarrow(q \wedge \sim r) is
View answer and explanation
Correct option: C
∼r∨(p∨∼q)\sim r \vee(p \vee \sim q)
Option C (∼r∨(p∨∼q)\sim r \vee(p \vee \sim q)) is correct because the contrapositive of p→qp \rightarrow q is ∼q→∼p\sim q \rightarrow \sim p.
123 Easy
123 of 171
Understanding +4 | -1
Let p,q,rp, q, r be the following:

pp : Rohit is healthy

qq : Rohit is wealthy

rr : Rohit is wise.

The statement p∨q→∼rp \vee q \rightarrow \sim r means
View answer and explanation
Correct option: A
If Rohit is healthy or wealthy then Rohit is not wise
Option A (If Rohit is healthy or wealthy then Rohit is not wise) is correct because p∨qp \vee q represents "Rohit is healthy or wealthy" and ∼r\sim r represents "Rohit is not wise", so p∨q→∼rp \vee q \rightarrow \sim r means "If Rohit is healthy or wealthy, then Rohit is not wise".
124 Easy
124 of 171
Analyzing +4 | -1
If the compound statement p→(∼p∨q)p \rightarrow(\sim p \vee q) is false, then the truth values of pp and qq are respectively
View answer and explanation
Correct option: B
T, F
Option B (T, F) is correct because p→(∼p∨q)p \rightarrow (\sim p \vee q) is false only when p is true and (∼p∨q)(\sim p \vee q) is false, which occurs when q is false.
125 Easy
125 of 171
Understanding +4 | -1
Consider the statement “The match will be played only if the weather is good and ground is not wet”.
Select the correct negation from the following
View answer and explanation
Correct option: C
The match will be played and weather is not good or ground is wet.
Option C (The match will be played and weather is not good or ground is wet) is correct because it represents the negation of the given conditional statement.
126 Easy
126 of 171
Analyzing +4 | -1
Which one of the following statements is not a tautology?
View answer and explanation
Correct option: D
(p∨q)→(p∨(∼q))(p \vee q) \to (p \vee ( \sim q))
Option D ((p∨q)→(p∨(∼q))(p \vee q) \to (p \vee ( \sim q))) is correct because its truth table does not always result in 'True', meaning it's not a tautology.
127 Easy
127 of 171
Understanding +4 | -1
The negation of the Boolean expression p∨(∼p∧q)p \vee ( \sim p \wedge q) is equivalent to
View answer and explanation
Correct option: B
∼p∧∼q\sim p \wedge \sim q
Option B (∼p∧∼q\sim p \wedge \sim q) is correct because it represents the negation of the given expression using De Morgan's laws and simplification.
128 Easy
128 of 171
Understanding +4 | -1
If pp is any statement, then which of the following is a contradiction?
View answer and explanation
Correct option: B
p∧∼pp \wedge \sim p
Option B (p∧∼pp \wedge \sim p) is a contradiction because it is always false, regardless of the truth value of pp.
129 Easy
129 of 171
Understanding +4 | -1
The conditional statement of 'You will get a sweet dish after the dinner' is
View answer and explanation
Correct option: A
if you take the dinner, then you will get a sweet dish
Option A (if you take the dinner, then you will get a sweet dish) is the correct conditional statement of the given statement.
130 Easy
130 of 171
Analyzing +4 | -1
Let r∈{p, q, ∼p, ∼q}r \in \{ p,\,q,\, \sim p,\, \sim q\} be such that the logical statement r∨(∼p)  ⇒(p∧q)∨rr \vee \left( { \sim p} \right)\,\, \Rightarrow \left( {p \wedge q} \right) \vee r is a tautology. Then rr is equal to:
View answer and explanation
Correct option: C
∼p\sim p
Option C (∼p\sim p) is correct because it makes the logical statement a tautology, meaning it is always true regardless of the truth values of p and q.
131 Easy
131 of 171
Understanding +4 | -1
The logically equivalent preposition of p⇔qp \Leftrightarrow q is
View answer and explanation
Correct option: A
(p⇒q)∧(q⇒p)(p \Rightarrow q) \wedge(q \Rightarrow p)
Option A ((p⇒q)∧(q⇒p)(p \Rightarrow q) \wedge(q \Rightarrow p)) is correct because it accurately represents the logical equivalence of the biconditional statement p⇔qp \Leftrightarrow q.
132 Easy
132 of 171
Understanding +4 | -1
The contrapositive of the inverse of (p→∼q)(p \rightarrow \sim q) is
View answer and explanation
Correct option: C
q→∼pq \rightarrow \sim p
Option C (q→∼pq \rightarrow \sim p) is correct because the contrapositive of the inverse of a conditional statement (p→∼q)(p \rightarrow \sim q) is obtained by negating and reversing the inverse, resulting in q→∼pq \rightarrow \sim p.
133 Easy
133 of 171
Analyzing +4 | -1
The statement (p→(q→p))→(p→(p∨q))(p \to (q \to p)) \to (p \to (p \vee q)) is
View answer and explanation
Correct option: D
a tautology
Option D is correct because the truth table of the given statement results in all true values, indicating it is a tautology.
134 Easy
134 of 171
Analyzing +4 | -1
The negation of the statement ((A∧(B∨C))((A \wedge(B \vee C)) ⇒(A∨B))⇒A\Rightarrow(A \vee B)) \Rightarrow A is
View answer and explanation
Correct option: D
equivalent to ∼A\sim A
Option D (equivalent to ∼A\sim A) is correct because the negation of the given statement simplifies to ∼A\sim A using logical equivalences.
135 Easy
135 of 171
Analyzing +4 | -1
Negation of (p⇒q)⇒(q⇒p)(p \Rightarrow q) \Rightarrow(q \Rightarrow p) is
View answer and explanation
Correct option: B
q∧(∼p)q \wedge(\sim p)
Option B (q∧(∼p)q \wedge(\sim p)) is correct because it represents the negation of the given implication after simplification using logical equivalences.
136 Easy
136 of 171
Understanding +4 | -1
Which of the following is the conditional statement p→qp \rightarrow q ?
View answer and explanation
Correct option: B
pp is sufficient for qq
Option B (pp is sufficient for qq) is correct because p→qp \rightarrow q means that the truth of pp guarantees the truth of qq, hence pp is sufficient for qq.
137 Easy
137 of 171
Understanding +4 | -1
Consider the following statements.

Statement-I: The negation of the statement "The number 2 is greater than 7" is "The number 2 is not greater than 7".

Statement-II: The negation of the statement "Every natural number is an integer" is "every natural number is not an integer".

Choose the correct option.
View answer and explanation
Correct option: C
Both Statement are true
Option C (Both Statement are true) is correct because both statements accurately describe the negation of the given statements.
138 Easy
138 of 171
Understanding +4 | -1
∼((∼p)∧q)\sim((\sim {p}) \wedge {q}) is equal to
View answer and explanation
Correct option: A
p∨(∼q)p \vee(\sim q)
Option A (p∨(∼q)p \vee(\sim q)) is correct because it accurately represents the logical equivalence after applying De Morgan's law and double negation.
139 Easy
139 of 171
Analyzing +4 | -1
If p→(q∨r)p \to \left( {q \vee r} \right) is false, then the truth values of p,q,rp,q,r are respectively
View answer and explanation
Correct option: D
T,F,FT,F,F
Option D (T,F,FT,F,F) is correct because for p→(q∨r)p \to (q \vee r) to be false, pp must be true, and both qq and rr must be false.
140 Easy
140 of 171
Analyzing +4 | -1
If the truth value of the statement (P∧(∼R))→(P \wedge(\sim R)) \rightarrow ((∼R)∧Q)((\sim R) \wedge Q) is FF, then the truth value of which of the following is FF ?
View answer and explanation
Correct option: D
∼(R∨Q)→∼P\sim(R \vee Q) \rightarrow \sim P
Option D (∼(R∨Q)→∼P\sim(R \vee Q) \rightarrow \sim P) is correct because when the given statement is false, P is true, R is false, and Q is false, making this option also false.
141 Easy
141 of 171
Analyzing +4 | -1
The proposition (p→∼p)∧(∼p→p)\left( {p \to \sim p} \right) \wedge \left( { \sim p \to p} \right) is a
View answer and explanation
Correct option: B
Contradiction
Option B (Contradiction) is correct because the given proposition simplifies to p∧∼pp \wedge \sim p, which is always false.
142 Easy
142 of 171
Application +4 | -1
If p,q,rp, q, r are three statements and truth value of p∧q→rp \wedge q \rightarrow r is FF, then truth values of p,q,rp, q, r are respectively
View answer and explanation
Correct option: B
T,T,FT, T, F
Option B (T,T,FT, T, F) is correct because for p∧q→rp \wedge q \rightarrow r to be false, p∧qp \wedge q must be true and rr must be false.
143 Easy
143 of 171
Application +4 | -1
The negation of the statement (p∨q)∧(q∨(∼r))(p \vee q) \wedge(q \vee(\sim r)) is
View answer and explanation
Correct option: B
((∼p)∨r))∧(∼q)((\sim p) \vee r)) \wedge(\sim q)
Option B (((∼p)∨r))∧(∼q)(((\sim p) \vee r)) \wedge(\sim q) is correct because it is the correct negation of the given logical statement using De Morgan's laws and simplification.
144 Easy
144 of 171
Understanding +4 | -1
Let p,qp, q and rr be the statements:

pp : city XX is in U.P.

q:q: city XX is in India

r:p→qr: p \rightarrow q

Contrapositive of rr is
View answer and explanation
Correct option: A
if city XX is not in India then XX is not in U.P.
Option A (if city XX is not in India then XX is not in U.P.) is correct because it represents the contrapositive of the given conditional statement.
145 Easy
145 of 171
Analyzing +4 | -1
If p,qp, q and rr are three propositions, then which of the following combination of truth values of p,qp, q and rr makes the logical expression {(p∨q)∧((∼p)∨r)}→((∼q)∨r)\{(p \vee q) \wedge((\sim p) \vee r)\} \rightarrow((\sim q) \vee r) false ?
View answer and explanation
Correct option: A
p=F,q=T,r=Fp=F, q=T, r=F
Option A (p=F,q=T,r=Fp=F, q=T, r=F) is the correct answer because it makes the given logical expression false.
146 Easy
146 of 171
Understanding +4 | -1
The negation of the statement "he is rich and happy" is given by
View answer and explanation
Correct option: B
he is not rich or not happy
The correct answer is B because the negation of "p and q" is "not p or not q".
147 Easy
147 of 171
Understanding +4 | -1
Consider the proposition : “If we control population growth, we prosper”. Negative of this proposition is
View answer and explanation
Correct option: C
We control population but we do not prosper
The correct answer is C because the negation of "If p then q" is "p and not q".
148 Easy
148 of 171
Analyzing +4 | -1
Let pp and qq be any two logical statements and r:p→(∼p∨q)\mathrm{r}: \mathrm{p} \rightarrow(\sim p \vee q). If rr has a truth value FF, then the truth values of pp and qq are respectively:
View answer and explanation
Correct option: C
T, F
Option C (T, F) is correct because for p→(∼p∨q)p \rightarrow (\sim p \vee q) to be false, pp must be true and (∼p∨q)(\sim p \vee q) must be false, implying pp is true and qq is false.
149 Easy
149 of 171
Understanding +4 | -1
Contrapositive of the statement ‘If a function ff is differentiable at a, then it is also continuous at a′a' is
View answer and explanation
Correct option: D
If a function ff is not continuous at a, then it is not differentiable at a
Option D (If a function ff is not continuous at a, then it is not differentiable at a) is correct because it is the contrapositive of the given statement.
150 Easy
150 of 171
Understanding +4 | -1
Negation of the statement pp : for every real number, either x>1x > 1 or x<1x < 1 is
View answer and explanation
Correct option: A
There exist a real number xx such that neither x>1x > 1 nor x<1x < 1
Option A (There exist a real number xx such that neither x>1x > 1 nor x<1x < 1) is the correct negation of the given statement.
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 171 questions
0 /171
0✓ 0✗
0% Accuracy
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.