Ask
your own question, for FREE!
Computer Science
8 Online
The sum of all the 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.
Still Need Help?
Join the QuestionCove community and study together with friends!
(a) Prove the above statement for n=3. a'b'c' + a'b'c + a'bc' + a'bc + ab'c' + ab'c + abc' + abc = a'b' + a'b + ab' + ab = a' + a = 1. (b) Suggest a general procedure for a general proof. (Hint) For n > 3. If E represents the sum of all minterms of a function of n variables, then the sum of all minterms of a function of n+1 variables will be E(z'+z), which is equal to 1. This is obviously so for n = 4. Use induction for any n > 4. BIBLIOGRAPHY: http://www2.cs.uh.edu/~jhuang/JCH/LD/chap02.html
Thanks you very much osanseviero. :)
Can't find your answer?
Make a FREE account and ask your own questions, OR help others and earn volunteer hours!
Join our real-time social learning platform and learn together with your friends!
Join our real-time social learning platform and learn together with your friends!
Latest Questions
VERNEISH:
Two objects are moving along separate linear paths where each path is described by position, d, and time, t.
Maci:
what are the best stock apps for people who want to start investing?
Twaylor:
genuienly how do i get better self control i keep watcing youtube and theres this
IzzyCookie:
|dw:1792074056138:dw| Uhm, I don't know where to ask this, but I'm in college welding at my community college, and I need help learning vertical welding for
thehearken:
not sure if this is considered spam, im sorry if it is, but does anyone have tips
18 hours ago
1 Reply
0 Medals
5 days ago
3 Replies
2 Medals
1 week ago
3 Replies
0 Medals
3 days ago
9 Replies
1 Medal
1 week ago
2 Replies
1 Medal