Timeline for Project Euler #5 - Lowest common multiple of 1 through 20
Current License: CC BY-SA 3.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 26, 2015 at 7:55 | history | edited | David Zhang | CC BY-SA 3.0 |
Added LaTeX
|
| Dec 29, 2014 at 17:56 | vote | accept | CommunityBot | moved from User.Id=34073 by developer User.Id=8983 | |
| Dec 29, 2014 at 13:32 | comment | added | rolfl | @DavidZhang - I took the liberty of implementing your suggestions in this Ideone here.. Feel free to modify/fork/copy whatever you want to in to your answer. | |
| Dec 29, 2014 at 13:26 | comment | added | rschwieb | This is precisely the approach I took when solving this a long time ago. The Eulidean algorithm and iterative application of the LCM are very fast. | |
| Dec 29, 2014 at 9:42 | comment | added | Heslacher | You can use pseudo code to explain it better. Pseudo code is ok because it is language independent. | |
| Dec 29, 2014 at 9:39 | comment | added | David Zhang | @Heslacher I have edited my answer in an attempt to make it language-independent. However, I fear that by doing this I lose some clarity. | |
| Dec 29, 2014 at 9:37 | history | edited | David Zhang | CC BY-SA 3.0 |
Removed Python 3 code samples
|
| Dec 29, 2014 at 9:19 | review | First posts | |||
| Dec 29, 2014 at 9:40 | |||||
| Dec 29, 2014 at 9:16 | history | answered | David Zhang | CC BY-SA 3.0 |