0 votes 0 votes The sum of all the minterms of the boolean function of the n variable is 1. Prove the above statement with n = 3. give a Procedure for a general proof Digital Logic digital-logic morris-mano boolean-algebra min-sum-of-products-form + – ajaysoni1924 asked Mar 31, 2019 ajaysoni1924 3.8k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
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 . abhishekmehta4u answered Apr 1, 2019 abhishekmehta4u comment Share Follow See all 0 reply Please log in or register to add a comment.