The contrapositive of $(p \vee q) \Rightarrow r$ is
$r \Rightarrow (p \vee q)$
$\sim r \Rightarrow (p \vee q)$
$\sim r \Rightarrow \;\sim p\; \wedge \sim q$
$p \Rightarrow (q \vee r)$
Consider the following statements:
$P :$ Ramu is intelligent
$Q $: Ramu is rich
$R:$ Ramu is not honest
The negation of the statement "Ramu is intelligent and honest if and only if Ramu is not rich" can be expressed as.
For integers $m$ and $n$, both greater than $1$ , consider the following three statements
$P$ : $m$ divides $n$
$Q$ : $m$ divides $n^2$
$R$ : $m$ is prime,
then true statement is
The negation of the statement
"If I become a teacher, then I will open a school", is
Statement $\left( {p \wedge q} \right) \to \left( {p \vee q} \right)$ is
The Boolean expression $\left(\sim\left(p^{\wedge} q\right)\right) \vee q$ is equivalent to