Timeline for Print this sequence I just made up
Current License: CC BY-SA 4.0
28 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 5, 2023 at 13:03 | answer | added | Peter | timeline score: 1 | |
| Jun 30, 2021 at 20:50 | answer | added | DLosc | timeline score: 1 | |
| Jun 30, 2021 at 18:52 | answer | added | DLosc | timeline score: 1 | |
| Jun 30, 2021 at 9:16 | answer | added | Shaggy | timeline score: 1 | |
| Jun 29, 2021 at 20:51 | comment | added | Darrel Hoffman | Might be a worthy submission to the OEIS, they don't seem to have it currently... | |
| Jun 29, 2021 at 19:35 | comment | added | aschepler | @Anush I assume it should read "TSIJMU is the sequence of integers whose inverses are added". | |
| Jun 29, 2021 at 16:19 | answer | added | Kyuuhachi | timeline score: 0 | |
| Jun 29, 2021 at 13:20 | history | became hot network question | |||
| Jun 29, 2021 at 12:29 | answer | added | Neil | timeline score: 1 | |
| Jun 29, 2021 at 9:25 | comment | added | Dominic van Essen | Ok - I've added a non-overflowing version using arbitrary-precision GMP library, but it's a funny requirement, because (a) this avoids floating-point errors already, so I probably would have written the function differently from the outset if I wanted to use it, and (b) I can imagine there may be some other languages for which arbitrary-precision arithmetic or unlimited integers are not implemented, and if so it seems a shame to insist on this... | |
| Jun 29, 2021 at 9:04 | comment | added | emanresu A | @Anush Sorry, weird typo. | |
| Jun 29, 2021 at 9:04 | comment | added | emanresu A | @DominicvanEssen If you answer in R, your actual submission can just be R, and the non-overflowing version can be as a side note. | |
| Jun 29, 2021 at 9:00 | history | edited | emanresu A | CC BY-SA 4.0 |
added 9 characters in body
|
| Jun 29, 2021 at 9:00 | answer | added | Kjetil S | timeline score: 2 | |
| Jun 29, 2021 at 8:59 | answer | added | ovs | timeline score: 2 | |
| Jun 29, 2021 at 8:38 | answer | added | Dominic van Essen | timeline score: 5 | |
| Jun 29, 2021 at 8:04 | answer | added | cnamejj | timeline score: 1 | |
| Jun 29, 2021 at 7:27 | comment | added | user7467 | "If you do this forever, TSIJMU is the sequence of integers that are added, stati. This goes 2,3,5,6,8, " Up until that point you described adding fractions. Where do the integers in that sequence come from? | |
| Jun 29, 2021 at 7:17 | comment | added | Dominic van Essen | "your code may fail due to integer overflow errors. If this is the case, please provide a version which works for arbitrary input size" - What do you mean by this? Does it mean, for instance, that if I answer in R (or any other general-purpose language which will error due to integer overflow eventually), I need to provide a second, independent, program that somehow avoids this effect? One obvious way to do this would be to import arbitrary-precision libraries, but then I will be changing the 'language' to R+gmp... | |
| Jun 29, 2021 at 6:29 | answer | added | tsh | timeline score: 1 | |
| Jun 29, 2021 at 6:08 | answer | added | Razetime | timeline score: 7 | |
| Jun 29, 2021 at 6:02 | answer | added | dingledooper | timeline score: 10 | |
| Jun 29, 2021 at 6:00 | history | tweeted | twitter.com/StackCodeGolf/status/1409753522791407616 | ||
| Jun 29, 2021 at 5:57 | answer | added | Razetime | timeline score: 2 | |
| Jun 29, 2021 at 5:50 | answer | added | att | timeline score: 5 | |
| Jun 29, 2021 at 5:32 | answer | added | Jo King♦ | timeline score: 5 | |
| Jun 29, 2021 at 5:22 | answer | added | hyperneutrino♦ | timeline score: 2 | |
| Jun 29, 2021 at 5:20 | history | asked | emanresu A | CC BY-SA 4.0 |