0

hi i am told to perform a simplification using demorgans rule 2.

Here is the question

' = Equals Not

B . (C + B')'

I got

B' + (C' + B'') then

B' + (C' + B) Now i dont know where to go from here. Could you guys please help. Thank You

Niel
  • 1

2 Answers2

0

I think you've taken the negation of the expression you want. Consider:

B . (C + B')'

((B . (C + B')')')'

(B' + (C + B')'')'

(B' + (C + B'))'

...which doesn't look like a simplification at all. So, we simply negate the inner "or":

B . (C' . B'')

B . (C' . B)

Ken
  • 3,751
  • Im sorry ken im finding it hard to understand, If you dont mind Could you display it the way i have written , its the way ive been taught. Im very sorry but ive been on this question for about 4-5 hours now and its really frustrating – Niel May 23 '15 at 23:13
  • Sure thing. Edited. – Ken May 23 '15 at 23:14
  • Ken are you able to attach pics to a message? or is there a private message function so i can hand write the equation – Niel May 23 '15 at 23:22
  • I've edited again to remove all the formal logic symbols. – Ken May 23 '15 at 23:27
  • So B. (C+B') ' becomes B. (C'.B) ? im sorry about this its so difficult for me – Niel May 23 '15 at 23:32
0

$$B • \overline{ (C + \overline {B})}$$

Take DeMorgan's on second term. Remove complement, change operator (which you did not do) and complement terms.

$$B • (\overline {C} • \overline {\overline {B}})$$ $$B • \overline {C} • B$$

$ X•X = X $, which means:

$$B • \overline {C}$$

StainlessSteelRat
  • 514