your method of knowing the rules is so fu$ing awesome prof!!! I don't have to memorize this nor adding a stupid paper on the wall to force me not to forget them.
I dont really understand rules 11, but as for other rules, I understand it clearly. Thank you!
Thanks from Freeport, IL./Madison, WI. I've been having a hard time wrapping my head around Boolean Algebra, and I have a test on it next week. Your video of the lesson is helping. The book I'm using is "Digital Fundamentals" (10th edition) by Floyd, and I've been re-reading it over, and over again. I'm not sure which book you teach from, but it's easy to follow along in the book from your videos. Thanks.
awesome work
thank you good sir,
Thank you so much!
Thank you kindly!
@aziz I think the A notA was just needed for the proof. Think about adding a zero to any equation, it would not change the outcome of that equation.
Perfect, thank you so much!
thank you
this really help better than my professor
Well according to rule 8 : A • ¬A = 0
So it seems you can just shoehorn it into the equation using an OR with no effect if it's convenient to do so.
It does seem odd but prof did say it was quite an esoteric proof.
thanks so much
I didn't really get number 11. but that's ok, thanks SO much man!
ty so much
How did you go to (A+|A)(A+B)??? Please explain
you lost me a little with the second not A at 8:20 where did that come from?
hey for rule 11, where did the A.notA come from on the forth line?? pls explain
How about a'a'?
english is not my native language, and i dinðt study in america.
So why is A+(A*C) --> A*(1+C)?
@kamran14march you cant do that. B(A'+A) = B(1) since (A+A')=1
Why are you making the rule 11 proof so long just take B as common term from
BA' + AB => B(A'+A) => BA = > AB
thanks for helping me understand my college course better than my instructor or text book!