By giving a counterexample,show that the following statement is false: "If $n$ is an odd integer,then $n$ is prime."

Vedclass pdf generator app on play store
Vedclass iOS app on app store
(N/A) The given statement is in the form "If $p$,then $q$". To show that this statement is false,we need to find a counterexample where $p$ is true but $q$ is false.
Here,$p$ is "$n$ is an odd integer" and $q$ is "$n$ is prime".
We look for an odd integer $n$ that is not a prime number.
Consider $n = 9$.
$9$ is an odd integer,so $p$ is true.
However,$9$ is a composite number $(9 = 3 \times 3)$,so $q$ is false.
Since we found an odd integer that is not prime,the original statement is false.

Explore More

Similar Questions

The number of ordered triplets of the truth values of $p, q$ and $r$ such that the truth value of the statement $(p \vee q) \wedge (p \vee r) \Rightarrow (q \vee r)$ is True,is equal to

Which of the following is true?

Difficult
View Solution

The statement $p$ $\rightarrow (q$ $\rightarrow p)$ is equivalent to

The contrapositive of the statement pattern $[p \lor (p \to q)] \to (p \land \sim q)$ is

State whether the "Or" used in the following statement is "exclusive" or "inclusive". Give reasons for your answer.
To apply for a driving licence,you should have a ration card or a passport.

Vedclass Products

For Students

Vedclass Test Series

Mock tests in real JEE/NEET style with performance analysis. 5-day free trial.

Start Free Trial
For Teachers

Exam Paper Generator

Generate Set A/B/C/D exam papers from 7.5L+ questions in 2 minutes. 3 chapters free.

Try Free
For Institutes

Online Exam Module

Live online exams with unlimited students, 360° analytics & white-label branding.

See Demo