First slide

Introduction to mathematical reasoning

Question

The contra positive of the statement, if x is a prime number and x divides ab, then x divides a or x divides b, can be symbolically represented using logical connectives on appropriately defined statements p, q, r and s as

Moderate

A

$(~ r \lor ~ s) \to (~ p \land ~ q)$
B

$(r \land s) \to (~ p \land ~ q)$
C

$(~ r \land ~ s) \to (~ p \lor ~ q)$
D

$(r \lor s) \to (~ p \lor ~ q)$

Solution

$Let p = x is prime number q = x divides a b r = x divides a$
$s = x divides b The given statement becomes in logical form is p \land q \to r \lor s I t' s c o n t r a p o s i t i v e i s$
$\begin{array}{l} ~ (r \lor s) \to\sim (p \land q) \\ \Rightarrow (~ r \land ~ s) \to (~ p \lor ~ q) \end{array}$

Get Instant Solutions

When in doubt download our app. Now available Google Play Store- Doubts App

Recieve an sms with download link

Doubts App

OR

SCAN ME

Doubts App

Doubts App