A function F(A, B, C) defined by three Boolean variables A, B and C when expressed as sum of products is given by

F = $$\overline A .\overline B .\overline C + \overline A .B.\overline C + A.\overline B .\overline C $$

where, $$\overline A $$, $$\overline B $$, and $$\overline C $$ are the complements of the respective variables. The product of sums (POS) form of the function F is

The Boolean expression (X+Y)(X+$$\overline Y $$)+($$\overline {(X\overline Y ) + \overline X } $$ simplifies to

For an n - variable Boolean function maximum number of prime implicants is

In the sum of products function f (x,y,z) = $$\sum {} $$m (2,3,4,5), the prime implicants are