Timeline for Find All Digitroot Cyclic Sequences With Length Greater Than One
Current License: CC BY-SA 4.0
30 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 18, 2022 at 12:00 | history | tweeted | twitter.com/StackCodeGolf/status/1504789724808032277 | ||
| Mar 2, 2022 at 20:50 | history | edited | jixperson | CC BY-SA 4.0 |
added 1 character in body
|
| Mar 2, 2022 at 19:12 | history | edited | jixperson | CC BY-SA 4.0 |
added 427 characters in body
|
| Mar 2, 2022 at 17:06 | answer | added | jixperson | timeline score: 1 | |
| Mar 2, 2022 at 10:41 | answer | added | Kevin Cruijssen | timeline score: 1 | |
| Mar 1, 2022 at 20:23 | answer | added | Jonathan Allan | timeline score: 2 | |
| Mar 1, 2022 at 19:37 | history | edited | jixperson | CC BY-SA 4.0 |
deleted 27 characters in body
|
| Mar 1, 2022 at 19:20 | review | Close votes | |||
| Mar 2, 2022 at 9:36 | |||||
| Mar 1, 2022 at 19:14 | history | edited | jixperson | CC BY-SA 4.0 |
deleted 9 characters in body
|
| Mar 1, 2022 at 18:52 | history | edited | jixperson | CC BY-SA 4.0 |
added 11 characters in body
|
| Mar 1, 2022 at 18:47 | history | edited | jixperson | CC BY-SA 4.0 |
added 177 characters in body
|
| Mar 1, 2022 at 18:32 | comment | added | Sundar R | A single sentence description of a "Digital root" in the question would be good, rather than requiring everyone to click through to a Wikipedia article. You can even just copy-paste the first two sentences from the Wiki. | |
| Mar 1, 2022 at 18:13 | history | edited | jixperson | CC BY-SA 4.0 |
deleted 1 character in body
|
| Mar 1, 2022 at 18:07 | history | edited | jixperson | CC BY-SA 4.0 |
added 80 characters in body
|
| Mar 1, 2022 at 16:15 | comment | added | jixperson | One way of dealing with it might be to convert it to string and then extracting the two sides by spliting it by '.' and then taking DR(DR(R)+DR(L)). | |
| Mar 1, 2022 at 16:11 | history | edited | jixperson | CC BY-SA 4.0 |
added 1 character in body
|
| Mar 1, 2022 at 16:10 | comment | added | Jonathan Allan | Floating point should not come into it since the inputs are integers. | |
| Mar 1, 2022 at 16:06 | history | edited | jixperson | CC BY-SA 4.0 |
added 1 character in body
|
| Mar 1, 2022 at 15:55 | history | edited | jixperson | CC BY-SA 4.0 |
added 1 character in body
|
| Mar 1, 2022 at 15:24 | comment | added | jixperson | I guess the only thing i can think of is floating point numbers which need some more rules to be added. | |
| Mar 1, 2022 at 15:22 | history | edited | jixperson | CC BY-SA 4.0 |
added 4 characters in body
|
| Mar 1, 2022 at 15:21 | comment | added | Jonathan Allan | Also, probably worth adding some test cases. (Try to think of any edge-cases when making them too.) | |
| Mar 1, 2022 at 15:19 | comment | added | Jonathan Allan |
Oh - I think the question might need to be "Return all cyclic sequences of length greater than one for Digit roots of n * i in base m + 1" since the example of 9 4 takes 4 to 7 since \$4\times 4=16\$ (base ten) and \$1+6=7\$ (using m would yield 8 since \$4\times 4=17\$ (base nine)).
|
|
| Mar 1, 2022 at 15:01 | history | edited | jixperson | CC BY-SA 4.0 |
added 27 characters in body; edited title
|
| Mar 1, 2022 at 14:44 | history | edited | jixperson | CC BY-SA 4.0 |
deleted 5 characters in body
|
| Mar 1, 2022 at 14:26 | history | edited | rydwolf |
edited tags
|
|
| Mar 1, 2022 at 14:25 | history | edited | jixperson | CC BY-SA 4.0 |
deleted 70 characters in body
|
| Mar 1, 2022 at 13:58 | history | edited | jixperson | CC BY-SA 4.0 |
added 140 characters in body; edited tags
|
| S Mar 1, 2022 at 13:48 | review | First questions | |||
| Mar 1, 2022 at 14:26 | |||||
| S Mar 1, 2022 at 13:48 | history | asked | jixperson | CC BY-SA 4.0 |