LMD Async Tutoring

[LMD]

@Eternity

I got my solution by assuming that some of the stuff I did with logic would work directly with math. So or(x,y) = not(and(not(x),not(y)). In in-fix: !(!x&!y). Translating that to math: 1-((1-x)*(1-y)). That simplifies down to x+y -xy.

Okay cool. I didn’t consider simplifying the equation further. I can see how now.

Cool so a simpler way of doing the xor I did above is:

xor(x, y): x + y - 2xy