in Digital Logic
3,734 views
0 votes
0 votes

The sum of all the minterms of the boolean function of the n  variable is 1.

  1. Prove the above statement with n = 3.
  2. give a Procedure for a general proof
in Digital Logic
3.7k views

1 Answer

0 votes
0 votes

we can proof using k-map

  • if we sum of all minterms then we can find one largest sub cube in k-map . 

Related questions