Warning: foreach() argument must be of type array|object, bool given in /var/www/html/web/app/themes/studypress-core-theme/template-parts/header/mobile-offcanvas.php on line 20

Exercises 14-23 deal with the Boolean algebra \(\left\{ {{\bf{0,1}}} \right\}\) with addition, multiplication, and complement defined at the beginning of this section. In each case, use a table as in Example \(8\).

20. Verify the first distributive law in Table \({\bf{5}}\) .

Short Answer

Expert verified

The given distributive laws \(x + y z = \left( {x + y} \right)\left( {x + z} \right)\) and \(x\left( {y + z} \right) = x y + x z\) are verified.

Step by step solution

01

Definition

The complement of an element:\({\bf{\bar 0 = 1}}\)and\({\bf{\bar 1 = }}0\)

The Boolean sum + or\(OR\)is 1 if either term is 1.

The Boolean product \( \cdot \) or \(AND\) is 1 if both terms are 1.

02

Using the distributive law

Distributive laws

\(\begin{array}{c}x + y z = \left( {x + y} \right)\left( {x + z} \right) \\x\left( {y + z} \right) = x y + x z\end{array}\)

x and y can both take on the value of 0 or 1.

\(\begin{array}{*{20}{r}}x&y&z&{yz}&{x + y}&{x + z}&{x + yz}&{(x + y)(x + z)}\\0&0&0&0&0&0&0&0\\0&0&1&0&0&1&0&0\\0&1&0&0&1&0&0&0\\0&1&1&1&1&1&1&1\\1&0&0&0&1&1&1&1\\1&0&1&0&1&1&1&1\\1&1&0&0&1&1&1&1\\1&1&1&1&1&1&1&1\end{array}\)

The last two columns of the table are identical.

Therefore, you get \(x + y z = \left( {x + y} \right)\left( {x + z} \right)\).

03

Verifying the second law

Note: you had to verify the first distributive law, but the following part contains the verification of the second law.

\(\begin{array}{*{20}{r}}x&y&z&{y + z}&{xy}&{xz}&{x(y + z)}&{xy + xz}\\0&0&0&0&0&0&0&0\\0&0&1&1&0&0&0&0\\0&1&0&1&0&0&0&0\\0&1&1&1&0&0&0&0\\1&0&0&0&0&0&0&0\\1&0&1&1&0&1&1&1\\1&1&0&1&1&0&1&1\\1&1&1&1&1&1&1&1\end{array}\)

The last two columns of the table are identical.

Therefore, you get \(x\left( {y + z} \right) = x y + x z\).

Unlock Step-by-Step Solutions & Ace Your Exams!

  • Full Textbook Solutions

    Get detailed explanations and key concepts

  • Unlimited Al creation

    Al flashcards, explanations, exams and more...

  • Ads-free access

    To over 500 millions flashcards

  • Money-back guarantee

    We refund you if you fail your exam.

Over 30 million students worldwide already upgrade their learning with Vaia!

One App. One Place for Learning.

All the tools & learning materials you need for study success - in one app.

Get started for free

Most popular questions from this chapter

  1. Show that \({\bf{(\bar 1}} \cdot {\bf{\bar 0) + (1}} \cdot {\bf{\bar 0) = 1}}\).
  2. Translate the equation in part (a) into a propositional equivalence by changing each \(0\) into an \({\bf{F}}\), each \(1\) into a \({\bf{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.

Find a minimal sum-of-products expansion, given the \(K{\bf{ - }}\)map shown with don't care conditions indicated with\(d\)โ€™s.

Construct a circuit that computes the product of the two-bitintegers \({{\bf{(}}{{\bf{x}}_{\bf{1}}}{{\bf{x}}_{\bf{o}}}{\bf{)}}_{\bf{2}}}\)and\({{\bf{(}}{{\bf{y}}_{\bf{1}}}{{\bf{y}}_{\bf{o}}}{\bf{)}}_{\bf{2}}}\).The circuit should have four output bits for the bits in the product. Two gates that are often used in circuits are NAND and NOR gates. When NAND or NOR gates are used to represent circuits, no other types of gates are needed. The notation for these gates is as follows:

Design a circuit for a light fixture controlled by four switches, where flipping one of the switches turns the light on when it is off and turns it off when it is on.

use the laws in Definition \(1\) to show that the stated properties hold in every Boolean algebra.

Show that in a Boolean algebra, the modular properties hold. That is, show that \({\bf{x}} \wedge {\bf{(y}} \vee {\bf{(x}} \wedge {\bf{z)) = (x}} \wedge {\bf{y)}} \vee {\bf{(x}} \wedge {\bf{z)}}\) and \({\bf{x}} \vee {\bf{(y}} \wedge {\bf{(x}} \vee {\bf{z)) = (x}} \vee {\bf{y)}} \wedge {\bf{(x}} \vee {\bf{z)}}\).

See all solutions

Recommended explanations on Math Textbooks

View all explanations

What do you think about this solution?

We value your feedback to improve our textbook solutions.

Study anywhere. Anytime. Across all devices.

Sign-up for free