Timeline for Project Euler #5
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 8, 2016 at 15:59 | history | edited | mdfst13 | CC BY-SA 3.0 |
added 1963 characters in body
|
| Jul 8, 2016 at 14:38 | vote | accept | Ethan Watson | ||
| Jul 8, 2016 at 14:38 | comment | added | Ethan Watson | Yes, please explain the num += 2520. Great answer by the way. | |
| Jul 8, 2016 at 6:51 | comment | added | twohundredping |
The num += 2520 part of the line for (int num = 2520; num < 1000000000; num += 2520) might require more explanation. The OP showed insight by only searching even numbers but there is still quite a leap between understanding divisibility by 2 and divisibility in general. Regardless, nice answer.
|
|
| Jul 8, 2016 at 4:23 | history | answered | mdfst13 | CC BY-SA 3.0 |