From aa788db7150548cda401540c19f2311d9800b19b Mon Sep 17 00:00:00 2001 From: Julien Lengrand-Lambert Date: Tue, 16 Oct 2012 21:47:34 +0200 Subject: [PATCH] Updates README --- README.markdown | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/README.markdown b/README.markdown index 27f541e..fd93a0f 100644 --- a/README.markdown +++ b/README.markdown @@ -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
52 - Find the smallest positive integer, x, such that 2x, 3x, 4x, 5x, and 6x, contain the same digits. - 2min
53 - How many values of C(n,r), for 1 <= n <= 100, exceed one-million? - < 1 sec
+56 - Considering natural numbers of the form, a^b, finding the maximum digital sum. > 3 sec
67 - Using an efficient algorithm find the maximal sum in the triangle? - 0.027
## 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.
43 - Find the sum of all pandigital numbers with an unusual sub-string divisibility property.
47 - Find the first four consecutive integers to have four distinct primes factors.
-56 - Considering natural numbers of the form, a^b, finding the maximum digital sum.
97 - Find the last ten digits of the non-Mersenne prime: 28433 � 2^7830457 + 1.
## Contact