Problem 97 - Large non-mersenne prime

 - only last 10 digits are required, so just take mod 10**10
   at each iteration to keep memory usage small.