Problem 132 - Large repunit factors (optimized)
Problem 132 - Large repunit factors (optimized)

 - Rather than finding A(p) for all primes, just
   test if 10^n == 1 mod 9p
 - Reduces running time from >50 seconds to < 1 second.

mbuhot/mbuhot-euler-solutions,mbuhot/mbuhot-euler-solutions