jlengrand/project_euler
1
0
Fork 0
mirror of https://github.com/jlengrand/project_euler.git synced 2026-03-10 08:41:20 +00:00
Code Issues Packages Projects Releases Wiki Activity

Updates README to include running time.

Browse Source 
Work on primes to be performed. dump has been created to avoid recalculation each time.
But I 'll spend some time working on sieves.

Signed-off-by: Julien Lengrand-Lambert <julien@lengrand.fr>
This commit is contained in:
Julien Lengrand-Lambert
2012-02-03 14:37:46 +01:00
parent 5d55ff3f50
commit 08549c4a2a
1 changed files with 2 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
README.markdown
View File

@@ -15,11 +15,11 @@ Should be used in order to help future reuse of code :)
1 - Add all the natural numbers below one thousand that are multiples of 3 or 5. - 0.011
2 - By considering the terms in the Fibonacci sequence whose values do not exceed four million, find the sum of the even-valued terms. - 0.011
3 - Find the largest prime factor of a composite number. - too long -
3 - Find the largest prime factor of a composite number. - too long
4 - Find the largest palindrome made from the product of two 3-digit numbers. - 0.790
5 - What is the smallest number divisible by each of the numbers 1 to 20? - 4.102
6 - What is the difference between the sum of the squares and the square of the sums? - 0.013
7 - Find the 10001st prime. - too long -
7 - Find the 10001st prime. - too long
8 - Discover the largest product of five consecutive digits in the 1000-digit number. - 0.045
9 - Find the only Pythagorean triplet, {a, b, c}, for which a + b + c = 1000. (a^2 + b^2 = c^2) - 1.500
10 - Calculate the sum of all the primes below two million. - too long