Talk:Euler problems/1 to 10
Jump to navigation
Jump to search
Should the "solution" of problem 10 not contain a way how the primes are constructed? In itself its no solution. hk
- It's in problem 3 earlier on the page. The primes function is needed for the solution of many problems. Quale 16:55, 26 February 2008 (UTC)
- It's barely a solution anyway, IMHO. They've changed the problems to all primes below *two* million now, and it takes about 3 minutes to run for me (Athlon64 3200+). Exscape 18:29, 27 May 2008 (UTC)
The solution for problem 7 has an off-by-one error, no? Doesn't (!!) start indexing at 0?