Timeline for In what sense is GCD an extension of boolean OR?
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 6, 2016 at 13:39 | comment | added | Jonah | @FanZheng Are you making a separate point or a point related to the one Bjorn makes in his answer? | |
| Dec 6, 2016 at 7:56 | answer | added | Brendan McKay | timeline score: 1 | |
| Dec 6, 2016 at 7:15 | answer | added | Bjørn Kjos-Hanssen | timeline score: 18 | |
| Dec 6, 2016 at 7:08 | comment | added | Fan Zheng | GCD is the meet (max) of the exponents of primes, and meet, union, OR are synonymous in lattice theory. | |
| Dec 6, 2016 at 6:51 | comment | added | Brendan McKay | Boundary cases of the gcd function are usually (but not always) defined like gcd$(0,0)=0$ and gcd$(0,1)=1$. And of course gcd$(1,1)=1$. So if boolean is mapped to integer as F=0,T=1, gcd agrees with OR. | |
| Dec 6, 2016 at 6:47 | review | First posts | |||
| Dec 6, 2016 at 7:25 | |||||
| Dec 6, 2016 at 6:43 | history | asked | Jonah | CC BY-SA 3.0 |