Here's the question you clicked on:

55 members online
  • 0 replying
  • 0 viewing

JadeEyes

  • 3 years 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.

  • This Question is Closed
  1. kashyap
    • 3 years ago
    Best Response
    You've already chosen the best response.
    Medals 1

    a'b'c'+a'b'c+a'bc'+a'bc+ab'c'+ab'c+abc'+abc|dw:1349346391795:dw|

    1 Attachment
  2. kashyap
    • 3 years ago
    Best Response
    You've already chosen the best response.
    Medals 1

    here n=3 .. so we have 8 minterms ..

  3. mandeep05
    • 3 years ago
    Best Response
    You've already chosen the best response.
    Medals 0

    According to K-Map law, the result of grouping of 8 1's or 0's [1's for SOP and 0's for POS ] is 1.

  4. mandeep05
    • 3 years ago
    Best Response
    You've already chosen the best response.
    Medals 0

    Another way of doing it can be:- acronyms= (1-X) = X bar as i can not write it directly As you know A+(1-A) =1 So abc+(1-abc)=1 similarly other pairs can be solve and we will get 1+1+1+1 which itself is equal to 1. Hence proved.

  5. Not the answer you are looking for?
    Search for more explanations.

    • Attachments:

Ask your own question

Sign Up
Find more explanations on OpenStudy
Privacy Policy