Each of three coins has two sides, heads and tails. Represent the heads or tails status of each coin by a logical variable (A for the first coin, B for the second coin, and C for the third) where the logical variable is 1 for heads and 0 for tails. Write a logic function F(A, B, C) which is 1 iff exactly one of the coins is heads after a toss of the coins. Express F (as a minterm expansion. (b) as an maxterm expansion

(a) F(A, B, C) = AB'C' + A'BC' + A'B'C

(b) F(A, B, C) = (A' + B' + C')(A' + B + C)(A + B' + C)(A + B + C')(A + B + C)

Step-by-step explanation:

(a) If F(A, B, C) = 1 iff exactly one of the coins is heads, then either

A is heads and the others are tails (AB'C')

B is heads and the others are tails (A'BC')

C is heads and the others are tails (A'B'C)

Hence, as a minterm expansion,

F(A, B, C) = AB'C' + A'BC' + A'B'C

(b) To get the corresponding maxterm expansion, we convert to binary.

The maxterm is the product of the complements.

Expanding,

F(A, B, C) = (A' + B' + C')(A' + B + C)(A + B' + C)(A + B + C')(A + B + C)

or

step-by-step explanation:

we need to solve for 'x' the following equation:  

we have that:

⇒

⇒ ⇒

factorizing, we get that:

  ⇒

then, the solutions are: or

nothing extraneous has been found!

3000000000000000000000