5 5 votes Number of boolean function with 3 boolean variable such that the function contain exactly 2 or 7 min term in their canonical SOP? Please explain the logic! Digital Logic combinatory min-sum-of-products-form + – smartmeet 4.5k views answer comment Share Follow Print See 1 comment 1 1 comment reply Lakshman Bhaiya commented Apr 13, 2017 reply Follow flag 36 maximum functions are possible 0 0 replyShare Please log in or register to add a comment.
Best answer 5 5 votes If we draw the truth table with 3 variables, then 23 combinations are possible. The function needs to produce exactly 2 minterms, so $\binom{2^{3}}{2}$ functions ar possible. Similarly, to have 7 minterms, $\binom{2^{3}}{7}$ functions are possible. Using addition rule of counting, $\binom{2^{3}}{2} + \binom{2^{3}}{7}$ functions are possible. Samujjal Das answered Jan 8, 2017 • selected Jul 23, 2017 by Bikram Samujjal Das comment Share Follow See all 5 Comments 5 5 Comments reply Show 2 previous comments smartmeet commented Jan 8, 2017 reply Follow flag thanks brother, so it means that any 2 min-term in final function, I thouht 2 or 7 means (010 or 111 only) so they are, (X'Y'Z'+XYZ),(XY'Z'+XYZ),etc. right? 1 1 replyShare mcjoshi commented Jan 8, 2017 reply Follow flag Yes any 2 minterms means any two out of these eight minterms. 1 1 replyShare smartmeet commented Jan 9, 2017 reply Follow flag Thanks bro! 0 0 replyShare Please log in or register to add a comment.