Timeline for Finding the smallest number whose digits sum to N
Current License: CC BY-SA 3.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 18, 2015 at 20:11 | comment | added | gnasher729 | From the question: "find the smallest integer that is greater than M..." | |
| May 18, 2015 at 14:37 | history | edited | Yves Daoust | CC BY-SA 3.0 |
added 264 characters in body
|
| May 18, 2015 at 14:35 | comment | added | Yves Daoust |
@gnasher729: IMO, M is an allowed solution.
|
|
| May 18, 2015 at 14:32 | history | edited | Yves Daoust | CC BY-SA 3.0 |
added 264 characters in body
|
| May 18, 2015 at 14:06 | comment | added | gnasher729 | You also need the case where N is quite small, for example M = 100 (so solutions must be > 100) and N = 1 should find the number 1,000. If M+1 has a digit sum that is too large, you'd increase the number until the last digit is 0, if that has a digit sum that is too large increase by 10 until the last digits are 00, and so on. | |
| May 18, 2015 at 9:54 | history | edited | 200_success | CC BY-SA 3.0 |
Incorporated comments
|
| May 18, 2015 at 9:40 | history | edited | Yves Daoust | CC BY-SA 3.0 |
edited body
|
| May 18, 2015 at 8:23 | history | edited | Yves Daoust | CC BY-SA 3.0 |
added 15 characters in body
|
| May 18, 2015 at 8:18 | history | answered | Yves Daoust | CC BY-SA 3.0 |