Use app×
Join Bloom Tuition
One on One Online Tuition
JEE MAIN 2025 Foundation Course
NEET 2025 Foundation Course
CLASS 12 FOUNDATION COURSE
CLASS 10 FOUNDATION COURSE
CLASS 9 FOUNDATION COURSE
CLASS 8 FOUNDATION COURSE
0 votes
222 views
in Logarithm by (20 points)
recategorized by

Write the negation of the following statement using the rule of negation ( p ⇒ q ) and r.

Please log in or register to answer this question.

1 Answer

0 votes
by (44.1k points)

Given statement is (P implies q ) and r

i.e., (p ⇒ q) ∧ r

or (~ p ∨ q) ∧ r. (\(\because\) p ⇒ q ≡ ~ p ∧ q)

Now, the negation of (p ⇒ q) ∧ r is

~((~p ∨ q) ∧ r)

or ~ (~p ∨ q) ∨~ r (\(\because\) ~ (p ∧ q) ≡ ~ p ∨ ~ q)

or (~ (~ p) ∧ ~ q) ∨ (~ r) (\(\because\) ~(p ∨ q) ≡ ~p ∧ ~ q)

or (p ∧ ~p) ∨ ~r (\(\because\) ~ (~p) ≡ p)

or p ∧ ~q ∨ ~r

or p ∧ ~(q ∧ r)

Welcome to Sarthaks eConnect: A unique platform where students can interact with teachers/experts/students to get solutions to their queries. Students (upto class 10+2) preparing for All Government Exams, CBSE Board Exam, ICSE Board Exam, State Board Exam, JEE (Mains+Advance) and NEET can ask questions from any subject and get quick answers by subject teachers/ experts/mentors/students.

...