Timeline for Find the "Bittiest" Number
Current License: CC BY-SA 4.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 22, 2020 at 11:29 | comment | added | Arnauld | @user81655 Nice! The main difference is that q is considered to have less bits set than p when they actually have as many bits set. But this is compatible with the challenge rules. Thank you! | |
| Dec 22, 2020 at 11:29 | history | edited | Arnauld | CC BY-SA 4.0 | saved 2 bytes |
| Dec 22, 2020 at 8:03 | comment | added | user81655 | Would !p|-!q||g(p&p-1,q&q-1) work? | |
| Dec 19, 2020 at 23:59 | history | edited | Arnauld | CC BY-SA 4.0 | minor update |
| Dec 19, 2020 at 23:05 | history | edited | Arnauld | CC BY-SA 4.0 | saved 1 byte |
| Dec 19, 2020 at 22:58 | history | edited | Arnauld | CC BY-SA 4.0 | minor update |
| Dec 19, 2020 at 22:50 | history | edited | Arnauld | CC BY-SA 4.0 | added a commented version |
| Dec 19, 2020 at 22:36 | history | edited | Arnauld | CC BY-SA 4.0 | saved 1 byte |
| Dec 19, 2020 at 20:58 | history | answered | Arnauld | CC BY-SA 4.0 |