# LMD Async Tutoring

**URL:** https://discuss.criticalfallibilism.com/t/lmd-async-tutoring/1933
**Category:** Tutoring
**Created:** [April 23, 2024, 12:05am UTC](https://discuss.criticalfallibilism.com/t/lmd-async-tutoring/1933 "2024-04-23T00:05:39Z")
**Posts on this page:** 1
**Showing post:** 418

<div class="post-metadata">

### Author: ![LMD](https://discuss.criticalfallibilism.com/user_avatar/discuss.criticalfallibilism.com/lmd/32/3213_2.png) [@LMD](https://discuss.criticalfallibilism.com/u/LMD)
#### Post date: [July 20, 2024, 1:23am UTC](https://discuss.criticalfallibilism.com/t/lmd-async-tutoring/1933/418 "2024-07-20T01:23:55Z")

</div>

> [@Eternity Async Tutoring](https://discuss.criticalfallibilism.com/t/eternity-async-tutoring/1932/414):
>
> 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.

 ![Screenshot 2024-07-20 at 11.13.54 AM](https://discuss.criticalfallibilism.com/uploads/default/original/2X/6/64ce8fa74dc645daf4a46019faa5541adbe2c775.png)

Cool so a simpler way of doing the xor I did [above](https://discuss.criticalfallibilism.com/t/lmd-async-tutoring/1933/414) is:

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

---

_[View the full topic](https://discuss.criticalfallibilism.com/t/lmd-async-tutoring/1933)._