# project-euler/132/132-3.pl

+A number consisting entirely of ones is called a repunit. We shall define R(k) to be a repunit of length k.

+For example, R(10) = 1111111111 = 11×41×271×9091, and the sum of these prime factors is 9414.

+Find the sum of the first forty prime factors of R(109).

+ $mod = (($mod * 10 + 1) % $n);

+open my $primes_fh, "primes 7|";

+ my $n = int(scalar(<$primes_fh>));

+ if (1_000_000_000 % $A == 0)

+ print "Found $n ; Sum = $sum ; Count = $count\n";