Solved: Show that a Boolean function can be represented as
Chapter 11, Problem 11.2.10(choose chapter or problem)
Show that a Boolean function can be represented as a Boolean product of maxterms. This representation is called the product-of-sums expansion or conjunctive normal form of the function. [Hint: Include one maxterm in this product for each combination of the variables where the function has the value 0.]
Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.
Becoming a subscriber
Or look for another answer