commit 05b0faa28b0a33f7b61e6dfa72b557b5c87b2603
parent 70b4a705dcf606e65388de33cc16d97fd4539f33
Author: Ryan Wolf <rwolf@borderstylo.com>
Date: Sun, 17 Oct 2010 14:08:45 -0700
included level 2 instructions for greplin
Diffstat:
1 file changed, 19 insertions(+), 0 deletions(-)
diff --git a/greplin/README.md b/greplin/README.md
@@ -11,6 +11,7 @@ three levels in a single sitting. It should take anywhere from 20 minutes to
2 hours.
Level 1
+
----------------------------------------
Embedded in this block of text is the password for level 2.
@@ -19,3 +20,21 @@ The password is the longest substring that is the same in reverse.
As an example, if the input was "I like racecars that go fast"
the password would be "racecar".
+Level 2
+
+----------------------------------------
+
+Congratulations. You have reached level 2.
+
+To get the password for level 3, write code to find the first prime
+fibonacci number larger than a given minimum. For example, the first
+prime fibonacci number larger than 10 is 13.
+
+Step 1. Use your code to compute the smallest prime fibonacci number
+greater than 227,000. Call this number X.
+
+Step 2. The password for level 3 is the sum of prime divisors of X + 1.
+
+For the second portion of this task, note that for the number 12 we consider the
+sum of the prime divisors to be 2 + 3 = 5. We do not include 2 twice even
+though it divides 12 twice.
