Chapter 3

Problem Solutions

- + x
3.1. (a) xy + xy --y = x(y+y-) + - x-
y P4b
-
= x .1 + xy - P5a
= x + x--
y P2b
= x + y- T7a
__________________ __________________
(b) (x-- -y + -
z + x xz + xy) = (x -z + x --
z + yx + yx-) P3a,P3b
________________
= [x- - -
(z+z) + y(x+x)] P4b
__________
= (x-.1 + y.1) P5a
______
= (x-
__ + y) P2b
-
= (x)y - T9a
= xy- T5
_______ _______
(c) (x + y)(x--
z + z)(y- + xz) = (x + y)(z + z --x)(y- + xz)P3a,P3b
_______
= (x + y)(z + x -)(y - + xz) T7a
___
-
= (x + y)(z + x)y(xz) T9a,T5
- -
= (x + y)(z + x)y(x + z) - T9b
= (x + y)(x- + z)(x- + -
z)y P3a,P3b
= (x + y)(x- + zz
-)y P4a
= (x + y)(x- + 0)y P5b
-
= (x + y)xy P2a
-y(x + y)
= x P3b
-[y(x + y)]
= x T8b
-[y(y + x)]
= x P3a
-y
= x T6b

- 3.1 -
3.1. (continued)
_____________ ___ ___ ___
(d) (xy + yz + xz) = (xy)(yz)(xz) T9a
= (x- + - - + z
y)(y -)(x
- + -)
z T9b
- + -
= (x - + z
y)(x -)(y
- + -)
z P3b
= (x- + -
y-z)(y- + z
-) P4a
= (x- + -
y-z)y- + (x
- + y--
z)z- P4b
-(x
= y - + y--
z) + -z(x- + y
--z) P3b
--
= y x + -
y-y- --
z + z --
x + z y-z P4b
- - - - - - -
= x y + yyz + xz + yzz- - - P3b
--
= x y + -
y-z + -x-
z + y--
z T4b
--
= x y + -
y-z + -
y- --
z + x z P3a
- - - - -
= x y + yz + xz - T4a
-z = xy + yz.1 + -
(e) xy + yz + x xz P2b
-) +
= xy + yz(x + x -z
x P5a
= xy + yzx + yzx- + -z
x P4b
= xyz + xy + x -zy + x
-z P3a,P3b
= xy(z + 1) + x -z(y + 1) P4b
= xy.1 + -xz.1 T2a
-z
= xy + x P2b
- + z) = (x + y)x
(f) (x + y)(x - + (x + y)z P4b
-(x + y) + z(x + y)
= x P3b
-x + -
= x xy + zx + zy P4b
- + -
= xx xy + zx + zy P3b
-
= 0 + xy + zx + zy P5b
-y + zx + zy
= x P2a
-y + zx + zy.1
= x P2b
-y + zx + zy(x + x
= x -) P5a
-y + zx + zyx + zyx
= x - P4b
-yz + x
= x -y + xzy + xz P3a,P3b
-y(z + 1) + xz(y + 1)
= x P4b
-y.1 + xz.1
= x T2a
-y + xz
= x P2b

- 3.2 -
3.1. (continued)
(g) (x + y)(y + z)(x + z) = [(x + y)y + (x + y)z](x + z) P4b
= [y(x + y) + z(x + y)](x + z) P3b
= (yx + yy + zx + zy)(x + z) P4b
= (yx + y + zx + zy)(x + z) T4b
= (y + yx + yz + zx)(x + z) P3a
= (y + zx)(x + z) T6a
= (y + zx)x + (y + zx)z P4b
= x(y + zx) + z(y + zx) P3b
= xy + xzx + zy + zzx P4b
= xy + xxz + yz + xzz P3b
= xy + xz + yz + xz T4b
= xy + (xz + xz) + yz P3a
= xy + xz + yz T4a
- + yz
(h) xy - + x
-z = xy-.1 + yz -.1 + - xz.1 P2b
- - - -
= xy(z + z) + yz(x + x) + xz(y + y)- - P5a
- - - - - -
= xyz + xyz + yzx + yzx + xzy + xzy- - - P4b
- - - - - - -
= xyz + xyz + yzx + yzx + xzy + xzy P3a,P3b - -
-y(z + z
= x -) + - yz(x + x -) + xz-(y + -y) P4b
-y.1 + -
= x yz.1 + xz -.1 P5a
- -
= xy + yz + xz - P2b

3.2. To prove the cancellation law does not hold, use the method
of contradiction. According to T7b, x(x-+y)=xy. Assuming
-+y=y for all x
the cancellation law holds, it follows that x
and y in the Boolean algebra. Since x and y denote any
elements in the Boolean algebra, let x=y. It then follows
-+y=y. However, from P5a it is known that y must be 1
that y
in this case and not any arbitrary element in the algebra.
Thus, by contradiction, the cancellation law does not hold.
By applying a dual argument starting with T7a, it can be
shown that x+y=x+z does not imply y=z.

- 3.3 -
3.3.

(a) (b) (c)

______
x y z -z+xy
x -+y)(x+z)
(x (x+y+z) -x-
y-z -z xy+x
xy+yz+x -z

0 0 0 o 0 1 1 0 0
0 0 1 1 1 0 0 1 1
0 1 0 0 0 0 0 0 0
0 1 1 1 1 0 0 1 1
1 0 0 0 0 0 0 0 0
1 0 1 0 0 0 0 0 0
1 1 0 1 1 0 0 1 1
1 1 1 1 1 0 0 1 1

3.4. Let B={0,1,a} where a…0,1. By Postulate P5 of a Boolean

-, must
algebra, the complement of the element a, i.e., a
-=1 and a.-
exist and satisfy the relationships a+a a=0. Since
-
there are just three elements in B, a must be 0, 1, or a.
-=a, then a+a
Suppose a -=a+a=a. However, since a…1, Postulate
P5a is not satisfied. -
Thus, a…a. Now suppose a -=1. Then

a.-
a=a.1=a. However, since a…0, Postulate P5b is not
satisfied. Finally, suppose a-=0. Then, a+a
-=a+0=a. Again
- does
Postulate P5a is not satisfied since a…1. Therefore, a
not exist and B cannot be a Boolean algebra.

- 3.4 -
3.5. (a)

x y z -
x -
z -
x+y -+z
x - -+y)(x
(x -+z
-) yz f
0 0 0 1 1 1 1 1 0 1
0 0 1 1 0 1 1 1 0 1
0 1 0 1 1 1 1 1 0 1
0 1 1 1 0 1 1 1 1 1
1 0 0 0 1 0 1 0 0 0
1 0 1 0 0 0 0 0 0 0
1 1 0 0 1 1 1 1 0 1
1 1 1 0 0 1 0 0 1 1

(b)
______
x y z -
x xy -z
x -z
xy+x -z)
(xy+x yz f
0 0 0 1 0 0 0 1 0 1
0 0 1 1 0 1 1 0 0 0
0 1 0 1 0 0 0 1 0 1
0 1 1 1 0 1 1 0 1 1
1 0 0 0 0 0 0 1 0 1
1 0 1 0 0 0 0 1 0 1
1 1 0 0 1 0 1 0 0 0
1 1 1 0 1 0 1 0 1 1

- 3.5 -
3.5. (continued)
(c)

x y z -
x -
y -
x+y y+z -+z
x -)(y+z)
(x+y f
0 0 0 1 1 1 0 1 0 0
0 0 1 1 1 1 1 1 1 1
0 1 0 1 0 0 1 1 0 0
0 1 1 1 0 0 1 1 0 0
1 0 0 0 1 1 0 0 0 0
1 0 1 0 1 1 1 1 1 1
1 1 0 0 0 1 1 0 1 0
1 1 1 0 0 1 1 1 1 1

- 3.6 -
3.5. (continued)
(d)

w x y z -
w -
y wx wxy -+z
y -(y
w -+z) f
0 0 0 0 1 1 0 0 1 1 1
0 0 0 1 1 1 0 0 1 1 1
0 0 1 0 1 0 0 0 0 0 0
0 0 1 1 1 0 0 0 1 1 1
0 1 0 0 1 1 0 0 1 1 1
0 1 0 1 1 1 0 0 1 1 1
0 1 1 0 1 0 0 0 0 0 0
0 1 1 1 1 0 0 0 1 1 1
1 0 0 0 0 1 0 0 1 0 0
1 0 0 1 0 1 0 0 1 0 0
1 0 1 0 0 0 0 0 0 0 0
1 0 1 1 0 0 0 0 1 0 0
1 1 0 0 0 1 1 0 1 0 0
1 1 0 1 0 1 1 0 1 0 0
1 1 1 0 0 0 1 1 0 0 1
1 1 1 1 0 0 1 1 1 0 1

--
3.6. (a) f(x,y,z) = x y- --
z + x -yz + xy
yz + x -z + xyz
-

= m 0 + m1 + m3 + m5 + m6
= 3m(0,1,3,5,6)
--
(b) f(w,x,y,z) = w x-
yz + w-- - + -
xyz --
wxy -xyz
z + w - + w
-xyz + wx
-yz
--
+ wxy -z + wxyz
z + wxy
= m1 + m2 + m4 + m6 + m7 + m11 + m12
+ m13 + m15
= 3m(1,2,4,6,7,11,12,13,15)

- 3.7 -
3.7. (a) f(x,y,z) = 3m(0,2,4,5,7)
--
= x y- -yz
z + x - + xy
-- -z + xyz
z + xy

x y z f
0 0 0 1
0 0 1 0
0 1 0 1
0 1 1 0
1 0 0 1
1 0 1 1
1 1 0 0
1 1 1 1

- 3.8 -
3.7. (continued)
(b) f(w,x,y,z) = 3m(1,3,7,8,9,14,15)
--
= w x-
yz + w-- -xyz + wx
xyz + w --y- --
z + wx yz
-
+ wxyz + wxyz

w x y z f
0 0 0 0 0
0 0 0 1 1
0 0 1 0 0
0 0 1 1 1
0 1 0 0 0
0 1 0 1 0
0 1 1 0 0
0 1 1 1 1
1 0 0 0 1
1 0 0 1 1
1 0 1 0 0
1 0 1 1 0
1 1 0 0 0
1 1 0 1 0
1 1 1 0 1
1 1 1 1 1

-+z)(x
3.8. (a) f(x,y,z) = (x+y -+y+z)(x
-+y
-+z
-)

= M 2M4M7
= JM(2,4,7)
-+z
(b) f(w,x,y,z) = (w+x+y+z)(w+x+y -)(w+x
-+y+z
-)(w-+x+y+z)
-+x+y+z
.(w -)(w
-+x+y
-+z)(w
-+x
-+y
-+z)

= M0M3M5M8M9M10M14
= JM(0,3,5,8,9,10,14)

- 3.9 -
3.9. (a) f(x,y,z) = JM(0,1,2,5,7)
-)(x+y
= (x+y+z)(x+y+z -+z)(x
-+y+z
-)(x
-+y
-+z
-)

x y z f
0 0 0 0
0 0 1 0
0 1 0 0
0 1 1 1
1 0 0 1
1 0 1 0
1 1 0 1
1 1 1 0

- 3.10 -
3.9. (continued)
(b) f(w,x,y,z) = JM(0,3,6,7,9,10,12,13,15)
-+z
= (w+x+y+z)(w+x+y -)(w+x
-+y
-+z)(w+x
-+y
-+z
-)
-+x+y+z
.(w -)(w
-+x+y
-+z)(w
-+x
-+y+z)
-+x
.(w -+y+z
-)(w
-+x
-+y
-+z
-)

w x y z f
0 0 0 0 0
0 0 0 1 1
0 0 1 0 1
0 0 1 1 0
0 1 0 0 1
0 1 0 1 1
0 1 1 0 0
0 1 1 1 0
1 0 0 0 1
1 0 0 1 0
1 0 1 0 0
1 0 1 1 1
1 1 0 0 0
1 1 0 1 0
1 1 1 0 1
1 1 1 1 0

_________________ ______________ ___

- - -
3.10. (a) [(w+x+y)(w+xz)+yz] = [(w+x+y)(w -+xz)](y
--z)
______ _____
= [(w+x+y) -
+(w+xz)](y+z)
___
- - -
= [wxy+w(xz)](y+z)
= [w--x-y+w(x-+z-)](y+z)
__________ _______
- - - -
(b) [x(wy+xyz)] = x + (w --
y+xyz -)
___ ____
= x + (w --
y)(xyz -)
-+y
= x + (w+y)(x -+z)

- 3.11 -
3.10. (continued)
____________
___ ________
___
-
(c) {wy[(wy-)+xz
-]} = w
- + y + [(wy-)+xz-
___ ]
- + y +
= w (wy-)(xz-)
- + y +
= w -(x
wy -+z)
____________________
______ ____ ___ _________________
______ ____
- -
(d) {wx+z[(w+x+y)+(x+y)]} = (wx){z[(w+x -+y
-)+(x+y)]}
______________
______ ____
- - -
= (w+x){z+[(w+x -+y-)+(x+y)]}
-+x
= (w -)[z
-+(w+x-+y-)(x+y)]

-.1.yz
3.11. (a) f = x[w -+z(1.-
y+w.- -[w
1)] + x -.0.yz
-+z(0.-
y+w.-
0)]
-yz
= x(w -+y
-z) + x-(wz)

-xy.-
(b) f = [z+w 0+0.(xy-+wx-)][z
-+w
-xy.- -+wx
1+1.(xy -)]
-xy)(z
= (z+w -+xy
-+wx
-)

--
3.12. (a) yz + x - = 1.yz + x
yz + xyz -- -
yz + xyz
-)yz + x
= (x+x -- -
yz + xyz
= xyz + x-yz + x
-- -
yz + xyz
-) + x
= xy(z+z -z(y+y-)
-z
= xy + x
--
(b) x y- --
z + x yz + - - + xy
xyz --
z + xy-z + xyz
-
-(x
= y -- -z+xz
z+x -+xz) + yz
-(x
-+x)
-[x
= y -(z
-+z)+x(z-+z)] + yz
-
-(x
= y -+x) + yz
-
- + yz
= y -
- + z
= y -

- + xz + x
(c) xy -- - + -
z + xyz x- -+z+yz
yz = x(y -) + - -+y
x(z -z)
-+z+y) + x
= x(y -(z-+y-)
-(y
= x + x -+z
-)
- + z
= x + y -

- 3.12 -
3.12. (continued)
_____
-z = x
(d) (x+yz) + y -(y -+z
-) + -yz
- - - -
= x y + xz + y -z
--
= x -) + x
y(z+z --
z + y-z
--
= x yz + x--
y-z + -x-
z + y-z
--
= x -+1) + y
z(y -z(x-+1)
--
= x -z
z + y
--
(e) w x- --
yz + wx - = x
yz + xz + xyz -- -+w) + x(z+yz
yz(w -)
--
= x yz + x(z+y)
--
= x yz + xz + xy
= (x-
- y+x)z + xy
= (y-+x)z + xy
-z + xz + xy
= y
-z + xz(y+y
= y -) + xy
-z + xyz + xy
= y -z + xy
-z(1+x) + xy(z+1)
= y
-z + xy
= y
--
(f) w --
xyz + wxy + w - + x
y + xy -- --
y = w xyz + wxy + y-(w
-+x+x
-)
--
= w xyz + wxy + y-

= (w-- -
xz+wx)y + y
--
= w -
xz + wx + y
-+z)(w+x+y
(g) (w+x+y -+z
-)(w+x -+y
-+z)(w+x
-+y
-+z-)(w
-+x
-+y-+z)(w
-+x
-+y
-+z
-)

= (w+x+y-+zz
-)(w+x-+y
-+zz
-)(w-+x
-+y
-+zz-)
-)(w+x
= (w+x+y -+y
-)(w -+x
-+y
-)
-)(ww
= (w+x+y -+x-+y-)

= (w+x+y-)(x
-+y
-)
- + x
= y -(w+x)
- + wx
= y - + xx
-
- + wx
= y -

-+z)(w+y
(h) (x+z)(w+x)(y -) = (x+wz)(y-+wz)
-
= wz + xy

- 3.13 -
3.13. xi.f(x1,x2,...,xi,...,xn)
= xi[xi.f(x1,x2,...,1,...,xn)+x- .f(x ,x ,...,0,...,x )]
i 1 2 n
. - .
= xi f(x1,x2,...,1,...,xn)+xixi f(x1,x2,...,0,...,xn)
= xi.f(x1,x2,...,1,...,xn)

Equation (b) follows from the duality principle.

-(y
3.14. (a) f(x,y,z) = x -+z) + z
-
--
= x -z + -
y + x z
--
= x -) + -
y(z+z -) + z
xz(y+y -(x+x
-)(y+y-)
--
= x yz + -x-
y- -yz + xyz
z + x - + xy-- -yz
z + x -

-)(x+z)
(b) f(x,y,z) = (x+y
= x + y-z
-)(z+z
= x(y+y -) + (x+x
-)y
-z
- + xy
= xyz + xyz -z + xy
-- --
z + x yz

-)(xy
3.15. (a) f(x,y,z) = (y+z -+z)
-)(x+z)(y
= (y+z -+z)
-+y+z
= (xx -)(yy
-+x+z)(xx
-+y
-+z)
-)(x
= (x+y+z -+y+z
-)(x+y+z)(x+y-+z)(x
-+y
-+z)

(b) f(x,y,z) = x + x--

z(y+z)
-)(x+z
= (x+x -)(x+y+z)
-)(x+y+z)
= (x+z
-+yy
= (x+z -)(x+y+z)
-)(x+y
= (x+y+z -+z
-)(x+y+z)

-(x,y,z) = 3m(1,3,4,6,7) = JM(0,2,5)

3.16. (a) f
-(x,y,z) = 3m(1,2,5,7) = JM(0,3,4,6)
(b) f
-(w,x,y,z) = 3m(0,2,3,5,9,10,11,13,15)
(c) f
= JM(1,4,6,7,8,12,14)
-(w,x,y,z) = 3m(3,7,8,10,12,13)
(d) f
= JM(0,1,2,4,5,6,9,11,14,15)

- 3.14 -
3.17. (a) f(x,y,z) = 3m(1,3,5)
-
f(x,y,z) = JM(1,3,5)
=
f(x,y,z) = f(x,y,z) =JM(0,2,4,6,7)

(b) f(x,y,z) = JM(3,4)

-
f(x,y,z) = 3m(3,4)
=
f(x,y,z) = f(x,y,z) = 3m(0,1,2,5,6,7)

(c) f(w,x,y,z) = 3m(0,1,2,3,7,9,11,12,15)

-
f(w,x,y,z) = 3m(4,5,6,8,10,13,14)
=
f(w,x,y,z) = f(w,x,y,z) = JM(4,5,6,8,10,13,14)

(d) f(w,x,y,z) = JM(0,2,5,6,7,8,9,11,12)

-
f(w,x,y,z) = JM(1,3,4,10,13,14,15)
=
f(w,x,y,z) = f(w,x,y,z) = 3m(1,3,4,10,13,14,15)

-z+y)(w+z) + w
3.18. (a) f = v(wx -

(b) f = [(w+x)(v-+y+z)+w
-][(w+x)(v
-+y+z)+v]
___________
(c) f = [(w+x-)(w
-+y)]z + (w
-+y)z
-

3.19. (a)

- 3.15 -
3.19. (continued)
(b)

(c)

______
-
3.20. (a) f = xyz +____
(xy-z+w) + wy
-

= A + (A+w) - -z
____ + wy where A=xy
= A + (0+w) + wy - by T3.12b
-
= A + w + wy -

= xy-z + -
w + wy-

= xy-z + - -
w + y
- + y
= w -(xz+1)
- + y
= w -

- 3.16 -
3.20. (continued)
_____
(b) f = [(w-xy
-z)z+x-- - + wyz
z]w
= [(w+x-+y+z
-)z+x-- - + wyz
z]w
= (wz+x-z+yz+x
-- - + wyz
z)w
--
= w xz + -
wyz + w--
x-z + wyz
--
= w -) + yz(w
x(z+z -+w)
--
= w x + yz

--
3.21. (a) f = w[(x+y)z+x z]

(b)

3.22. (a) f(w,x,y,z) = 3m(2,3,6,10,15) + dc(0,1,5,9,11,13,14)

= JM(4,7,8,12) + dc(0,1,5,9,11,13,14)

- 3.17 -
3.22. (continued)
(b)

w x y z f -
f
0 0 0 0 - -
0 0 0 1 - -
0 0 1 0 1 0
0 0 1 1 1 0
0 1 0 0 0 1
0 1 0 1 - -
0 1 1 0 1 0
0 1 1 1 0 1
1 0 0 0 0 1
1 0 0 1 - -
1 0 1 0 1 0
1 0 1 1 - -
1 1 0 0 0 1
1 1 0 1 - -
1 1 1 0 - -
1 1 1 1 1 0

-(w,x,y,z) = 3m(4,7,8,12) + dc(0,1,5,9,11,13,14)

(c) f
= JM(2,3,6,10,15) + dc(0,1,5,9,11,13,14)

- 3.18 -
3.23. (a) Using perfect induction:

x y z nand(y,z) nand[x,nand(y,z)] nand(x,y) nand[nand(x,y),z]

0 0 0 1 1 1 1
0 0 1 1 1 1 0
0 1 0 1 1 1 1
0 1 1 0 1 1 0
1 0 0 1 0 1 1
1 0 1 1 0 1 0
1 1 0 1 0 0 1
1 1 1 0 1 0 1

Since the columns for nand[x,nand(y,z)] and

nand[nand(x,y),z] are dissimilar, the nand-operation is
not associative.

(b) Using perfect induction:

x y z nor(y,z) nor[x,nor(y,z)] nor(x,y) nor[nor(x,y),z]

0 0 0 1 0 1 0
0 0 1 0 1 1 0
0 1 0 0 1 0 1
0 1 1 0 1 0 0
1 0 0 1 0 0 1
1 0 1 0 0 0 0
1 1 0 0 0 0 1
1 1 1 0 0 0 0

Since the columns for nor[x,nor(y,z)] and

nor[nor(x,y),z] are dissimilar, the nor-operation is
not associative.

- 3.19 -
 _____________
__________
___ ___
3.24. (a) f = {[(u --
v)(wx)y]z}
= (u+v)(w -+x
-)y + z -
_______________
______
___ ______
___
(b) f = {[x(xy)][y(xy)]}
= x(x-+y-) + y(x-+y
-)

= xy- + x-y
________________________
____________ ________
______ ____
- - -
(c) f = {[(x+y+z)+w+z]+[(w+x -)+y]}

= (xy -z+w
-+z)(w
-x+y)
-+z)(w
= (w -x+y)
________________________
____________ ________
____ ____ ____
-
(d) f = {[(v+w)+(x+y)]+[(x-+y)+z]}

= (v--
w+xy-)(xy
-+z)

_________________
____ ____
(e) f = {[(u -+v
-)+(w+x)+y
-]z}

= (u-+v
-)(w+x)y + z-

3.25. (a)

- 3.20 -
3.25. (continued)
(b)

- 3.21 -
3.25. (continued)
(c)

- 3.22 -
3.25. (continued)
(d)

- 3.23 -
3.26. (a)

- 3.24 -
3.26. (continued)
(b)

- 3.25 -
3.26. (continued)
(c)

- 3.26 -
3.26. (continued)
(d)

- 3.27 -
3.27. (a)

(b)

- 3.28 -
3.27. (continued)
(c)

- 3.29 -
3.27. (continued)
(d)

- 3.30 -
3.28. (a)

(b)

- 3.31 -
3.28. (continued)
(c)

- 3.32 -
3.28. (continued)
(d)

- 3.33 -
3.29. (a) Nand realization

-+x)y+u
f = [(w -+v](w+z)y

- 3.34 -
3.29. (continued)
(b) Nor realization

-+x)y+u
f = [(w -+v](w+z)y

- 3.35 -
 ____ ____
3.30. (x+y)r(x+z) = (x+y)(x+z) + (x+y)(x+z)
--
= x --
y(x+z) + (x+y)x z
- - -
= xyz + xyz-
-(y
= x -z+yz-)
-(yrz)
= x
Alternatively, perfect induction could be used.

3.31. Using perfect induction

x y z yz xryz xr y xr z (xry)(xrz)
0 0 0 0 0 0 0 0
0 0 1 0 0 0 1 0
0 1 0 0 0 1 0 0
0 1 1 1 1 1 1 1
1 0 0 0 1 1 1 1
1 0 1 0 1 1 0 0
1 1 0 0 1 0 1 0
1 1 1 1 0 0 0 0
Since the columns for xryz and (xry)(xrz) are dissimilar,
the exclusive-or-operation is not distributive over the
and-operation.

-.-
3.32. (a) xu1 = x 1 + x.1
-.0 + x
= x
= x
-.-
(b) xu0 = x 0 + x.0
-.1
= x
-
= x
--
(c) xux = x x + xx
- + x
= x
= 1

- 3.36 -
3.32. (continued)
(d) xu- -x + xx
x = x -

= 0 + 0
= 0
-u -
(e) x --
y = xy + x y
= xu y
-uy = xy
(f) x - + x
-y

ry
= x____
= (xuy)
____ ____
(g) (x+y)u(x+z) = (x+y)(x+z) + (x+y)(x+z)
--
= x y-x-z + x + yz
- - -
= xyz + x + yz
--
= y z + x + yz
= x + (yuz)

(h) xuyu(x+y) = xu[yu____

(x+y)]
-
= xu[y(x+y)+y(x+y)]
--
= xu(y x+xy+y)
--
= xu(x y+y)
-+y)
= xu____
(x
-(x
= x -+y) + x(x-+y)
-xy
= x - + xx- + xy

= xy

3.33. From the definition of the dual of a function, xry should

first be complemented by DeMorgan's law and then each of
the variables in the complemented expression should be
complemented.
____ ______ Applying DeMorgan's law gives
- - -)(x
(xry)=(xy+xy)=(x+y -+y). Complementing each variable in
-)(x
(x+y -+y) gives (x-+y)(x+y
-). Therefore,

(xry)dual = (x-+y)(x+y
-)
____
= (xry)
= xu y

- 3.37 -
3.34. (a)

According to statement 1, bn-1 should be connected to

gn-1. According to statement 2, for n-1$k$1,
bk-1=f(bk,gk-1). This function is given by the truth
table

bk gk-1 bk-1
0 0 0
0 1 1
1 0 1
1 1 0
which is described by bk-1=bkrgk-1. Thus, each of the
outputs bk-1 for n-1$k$1 is the exclusive-or of the
next higher order binary digit (bk) and the present
order Gray bit (gk-1). The corresponding logic diagram
is

- 3.38 -
3.34. (continued)
(b) From part (a) we have
bn-1 = gn-1
bk-1 = bkrgk-1 for n-1$k$1
We now need expressions for gn-1 and gk-1 for n-1$k$1.
Clearly, gn-1=bn-1. For the remaining expression,
consider property (x) in Table 3.16. Letting X=gk-1,
Y=bk, and Z=bk-1, bk-1=bkrgk-1 has the form XrY=Z.
Thus, X=YrZ or gk-1=bkrbk-1 for n-1$k$1. A logic
diagram for an n-bit binary-to-Gray converter is:

3.35. Position: 7 6 5 4 3 2 1
Code group format: b4 b3 b2 p3 b1 p2 p1

c*
1 = 0 if even parity over inputs b4, b2, b1, and p1
c*
1 = 1 if odd parity over inputs b4, b2, b1, and p1

- 3.39 -
3.35. (continued)
Truth table for c*
1:
b4 b2 b1 p1 c*1
0 0 0 0 0
0 0 0 1 1
0 0 1 0 1
0 0 1 1 0
0 1 0 0 1
0 1 0 1 0
0 1 1 0 0
0 1 1 1 1
1 0 0 0 1
1 0 0 1 0
1 0 1 0 0
1 0 1 1 1
1 1 0 0 0
1 1 0 1 1
1 1 1 0 1
1 1 1 1 0

c* - - - - - - - - - - - - -
1 = b4b2b1p1 + b4b2b1p1 + b4b2b1p1 + b4b2b1p1 + b4b2b1p1
+ b 4-
b2b1p1 + b4b2-
b1p1 + b4b2b1-p1
- -
= b - - - - - - - -
4b2(b1p1+b1p1) + b4b2(b1p1+b1p1) + b4b2(b2p1+b1p1)
+ b4b2(b- p +b -
1 1 1p______
1) ______
- - - -
= b4b2(b1rp1) + b4b2(b1rp1) + b4b2(b1rp1) + b4b2(b1rp1)
______
- -
= (b1rp1)(b4b2+b4b2) + (b1rp1)(b - b +b -
______ ______ 4 2 4b2)
= (b1rp1)(b4rb2) + (b1rp1)(b4rb2)

Let b1rp1=X and b4rb2=Y, then c* - -

1 = XY + XY = XrY
1 = (b1rp1) r (b4rb2)
Therefore, c*

- 3.40 -
3.35. (continued)
Using a similar procedure,

2 = (b1rp2) r (b4rb3)
c*

3 = (b2rp3) r (b4rb3)
c*

Each c*
i can be realized with a network of the form:

To correct an appropriate bit, it is first necessary to

detect each of the seven combinations of c*
3c*
2c*
1 which can
be done with seven and-gates. To invert a bit if in error,
an exclusive-or-gate can be used. For example, to detect
c*
3c*
2c*
1=011 and correct the corresponding bit, b1, in
position 3, the following network can be used:

- if the
B1=b1 if the output of the and-gate is 0 and B1=b 1
output of the and-gate is 1.

- 3.41 -
3.35. (continued)
Logic Diagram:

- 3.42 -