Discrete Mathematics and Its Applications, Seventh Edition

Published by McGraw-Hill Education
ISBN 10: 0073383090
ISBN 13: 978-0-07338-309-5

Chapter 12 - Section 12.1 - Boolean Functions - Exercises - Page 818: 3

Answer

a) Showing that (1 · 1) + (0 · 1 + 0) = 1. b) Translating the equation in part (a) into a propositional equivalence by changing each 0 into an F, each 1 into a T, each Boolean sum into a disjunction, each Boolean product into a conjunction, each complementation into a negation, and the equals sign into a propositional equivalence sign.

Work Step by Step

"~" sign mean the value is inverted a) (1 · 1) + (~(0 · 1) + 0) = 1 + (~0 + 0) = 1 + (1 + 0) = 1 + 1 = 1 b) (T ∧ T) ∨ (¬(F ∧ T) ∨ F) ≡ T
Update this answer!

You can help us out by revising, improving and updating this answer.

Update this answer

After you claim an answer you’ll have 24 hours to send in a draft. An editor will review the submission and either publish your submission or provide feedback.