Got Homework?
Connect with other students for help. It's a free community.
Here's the question you clicked on:
 0 viewing
The sum of minterms of a boolean function of n variables is equal to 1.
(a) Prove the above statement for n=3.
(b) Suggest a procedure for a general proof.
 one year ago
 one year ago
The sum of minterms of a boolean function of n variables is equal to 1. (a) Prove the above statement for n=3. (b) Suggest a procedure for a general proof.
 one year ago
 one year ago

This Question is Closed

kashyapBest ResponseYou've already chosen the best response.1
a'b'c'+a'b'c+a'bc'+a'bc+ab'c'+ab'c+abc'+abcdw:1349346391795:dw
 one year ago

kashyapBest ResponseYou've already chosen the best response.1
here n=3 .. so we have 8 minterms ..
 one year ago

mandeep05Best ResponseYou've already chosen the best response.0
According to KMap law, the result of grouping of 8 1's or 0's [1's for SOP and 0's for POS ] is 1.
 one year ago

mandeep05Best ResponseYou've already chosen the best response.0
Another way of doing it can be: acronyms= (1X) = X bar as i can not write it directly As you know A+(1A) =1 So abc+(1abc)=1 similarly other pairs can be solve and we will get 1+1+1+1 which itself is equal to 1. Hence proved.
 one year ago
See more questions >>>
Your question is ready. Sign up for free to start getting answers.
spraguer
(Moderator)
5
→ View Detailed Profile
is replying to Can someone tell me what button the professor is hitting...
23
 Teamwork 19 Teammate
 Problem Solving 19 Hero
 Engagement 19 Mad Hatter
 You have blocked this person.
 ✔ You're a fan Checking fan status...
Thanks for being so helpful in mathematics. If you are getting quality help, make sure you spread the word about OpenStudy.