Consider the Fibonacci numbers: F1 = 1, F2 = 1, Fn = Fn-1 + Fn-2 for n > 2. Find the sum of all Fibonacci numbers less than 10271027102710271027 whose indexes are prime.
(wheh-wheh-wheeeh. sorry, you can try again or watch our twitter feed for hints)
(high-five! are you SURE you don’t want to submit your email for the monthly drawing...?)