I'm learning to implement basic logic gates with the help of NAND. I've learned that you can use De Morgan's theorem as such:

$ a + b = bar { bar a} + bar { bar b} = overline {( bar a * bar b)} $

In other words, we would need two NOT gates (which are essentially NAND gates) and another NAND gate.

However, I want to practice the simplification of Boolean algebra. Using a truth table, I have formed the sum of products:

$ f (a, b) = ab + + a & # 39; b + ab $

I have mapped out several paths without success. I would appreciate that someone can point out the simplification steps or give me guidance on the laws to use to achieve this simplification. If there are any log errors I made, thank you for letting me know 🙂