1. Limited time only! Sign up for a free 30min personal tutor trial with Chegg Tutors
    Dismiss Notice
Dismiss Notice
Join Physics Forums Today!
The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

Digital logic - Boolean algebra simplification problem

  1. Feb 22, 2014 #1
    1. The problem statement, all variables and given/known data
    Simplify (A+B')(B+C)

    3. The attempt at a solution
    I first expanded it and got
    = AB + AC + B'B + B'C
    = AB + AC + B'C

    Turns out the solution is AB + B'C (according to an online source). How do we get rid of the AC term?
     
  2. jcsd
  3. Feb 22, 2014 #2

    NascentOxygen

    User Avatar

    Staff: Mentor

    On examining the expression, you can see ....
    If B is true, then for the expression to be true, the only condition that need be met is that A is true, and it doesn't matter what C is.

    If B is false, then for the expression to be true all we need is that C is true, it doesn't matter what A is.

    Just as in algebra you can multiply any term by 1 and you don't change its value, then in Boolean algebra you can multiply a term by true and you change nothing.

    For example, (B+B') is true, and it's always true.

    AB + AC(B+B') + B'C

    expand this out, then simpify the result
     
Know someone interested in this topic? Share this thread via Reddit, Google+, Twitter, or Facebook

Have something to add?
Draft saved Draft deleted



Similar Discussions: Digital logic - Boolean algebra simplification problem
  1. Logic problem (Replies: 5)

  2. Logics Problem (Replies: 2)

  3. Logic problem (Replies: 10)

Loading...