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

Browse Source
This commit is contained in:
Julien Lengrand-Lambert
2012-10-16 21:47:34 +02:00
parent 1bedcd4c00
commit aa788db715
1 changed files with 1 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
README.markdown
View File

@@ -63,6 +63,7 @@ So you may find some of the code here quite ugly. And this is the case :). Why o
48 - Find the last ten digits of 1^1 + 2^2 + ... + 1000^1000. - 0.053 <br />
52 - Find the smallest positive integer, x, such that 2x, 3x, 4x, 5x, and 6x, contain the same digits. - 2min <br />
53 - How many values of C(n,r), for 1 <= n <= 100, exceed one-million? - < 1 sec <br />
56 - Considering natural numbers of the form, a^b, finding the maximum digital sum. > 3 sec <br />
67 - Using an efficient algorithm find the maximal sum in the triangle? - 0.027 <br />
## In progress:
@@ -70,7 +71,6 @@ So you may find some of the code here quite ugly. And this is the case :). Why o
40 - Finding the nth digit of the fractional part of the irrational number. <br />
43 - Find the sum of all pandigital numbers with an unusual sub-string divisibility property. <br />
47 - Find the first four consecutive integers to have four distinct primes factors. <br />
56 - Considering natural numbers of the form, a^b, finding the maximum digital sum. <br />
97 - Find the last ten digits of the non-Mersenne prime: 28433 <20> 2^7830457 + 1. <br />
## Contact