Timeline for Reversing a number
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 5, 2015 at 12:07 | history | edited | holroy | CC BY-SA 3.0 |
corrected formatting of multidigit exponential
|
| Nov 5, 2015 at 8:30 | history | edited | Jamal | CC BY-SA 3.0 |
added 36 characters in body
|
| Sep 2, 2015 at 4:48 | comment | added | ErikR | You're right, it's not saying anything about the computer, but it is saying a lot about the algorithm. Since a CPU can only execute about 10^9 instructions per second, clearly the algorithm referred to in the Reddit post is not examining all 10^10000 numbers (or even a fraction of that.) | |
| Sep 2, 2015 at 4:38 | comment | added | Dan Oberlam | @ErikR imo any statement "problem x can be solved in n time" that doesn't say anything about the computer it's run on and the context isn't worth much. | |
| Sep 1, 2015 at 13:30 | comment | added | ErikR | Good observation. The Reddit post says that you can solve the problem for N = 10000 in 30 secs so there must be a short cut way of finding the sum of all of the numbers. | |
| Sep 1, 2015 at 11:27 | review | First posts | |||
| Sep 1, 2015 at 11:31 | |||||
| Sep 1, 2015 at 11:21 | history | answered | FazeL | CC BY-SA 3.0 |