Timeline for Alternating bit smearing
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 22, 2017 at 18:41 | history | edited | Emigna | CC BY-SA 3.0 |
deleted 17 characters in body
|
| Dec 22, 2017 at 18:30 | comment | added | Mr. Xcoder |
Does 05ab1e have bitwise AND? If so, (<bitwise and here>3÷+ should work for ~5 bytes.
|
|
| Dec 22, 2017 at 18:04 | history | edited | Emigna | CC BY-SA 3.0 |
added 114 characters in body
|
| Dec 22, 2017 at 18:02 | comment | added | Emigna | @Mr.Xcoder: Ooh, that's a neat formula. | |
| Dec 22, 2017 at 18:01 | comment | added | Mr. Xcoder | Maybe worth mentioning that porting the Mathematica answer gives you 8 bytes | |
| Dec 22, 2017 at 17:56 | history | answered | Emigna | CC BY-SA 3.0 |