Timeline for Output two numbers (Cops' thread)
Current License: CC BY-SA 4.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 1, 2022 at 15:20 | comment | added | Dominic van Essen |
@Giuseppe: Yes. Trivially it could be 13 bytes, because of "1.797693e+308", but if we disqualify this then "2^1023*1.9999999 is only 16...
|
|
| Feb 1, 2022 at 14:55 | comment | added | Giuseppe |
@DominicvanEssen It has to be at most 20 bytes, because of .Machine$double.xmax
|
|
| Jan 31, 2022 at 15:49 | comment | added | Dominic van Essen |
@Giuseppe - (and now I'm quite curious what would be the shortest expression that would output 1.797693e+308, assuming that this actually is the highest number that can be output in R...)
|
|
| Jan 31, 2022 at 15:45 | comment | added | Dominic van Essen | @Giuseppe - Hm, so I was clearly wrong about 'the highest number that we can output using 5 bytes' then... | |
| Jan 31, 2022 at 15:39 | comment | added | Giuseppe |
Note that 3^ceiling(log(9e307,3)) (and variants) are bigger than 1e308, so those are dead ends.
|
|
| Jan 31, 2022 at 11:57 | history | edited | Dominic van Essen | CC BY-SA 4.0 |
added 494 characters in body
|
| Jan 31, 2022 at 11:43 | history | edited | Dominic van Essen | CC BY-SA 4.0 |
added 494 characters in body
|
| Jan 31, 2022 at 11:41 | comment | added | Dominic van Essen | @i4m2 - Oh, that was stupid of me. | |
| Jan 31, 2022 at 11:40 | comment | added | l4m2 | Cracked but the question suggests to better make uncrackable solutions | |
| Jan 31, 2022 at 11:36 | history | answered | Dominic van Essen | CC BY-SA 4.0 |