Given the following Boolean function:
F1 = ABC + A'BC + A'B'C + A'BC' + A'B'C'
Show, using perfect induction (truth table) that
it is equivalent to:
F2 = BC + A'B' + A'C'
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|||||||||
|
|
|
|
|||||||||
|
|
|
|
|||||||||
|
|
|
|
|||||||||
|
|
|
|
|||||||||
|
|
|
|
|||||||||
|
|
|
|
|||||||||
|
|
|
|
Show using the theorems of Boolean algebra that F2
is equivalent to (make sure to show each step of your work):
BC + A'B' + A'C' = ABC + A'