132 Large repunit factors -- v2.pl 498 B

123456789101112131415161718192021222324252627282930313233343536
  1. #!/usr/bin/perl
  2. # Daniel "Trizen" Șuteu
  3. # Date: 21 September 2019
  4. # https://github.com/trizen
  5. # https://projecteuler.net/problem=132
  6. # Runtime: 0.051s
  7. # See also:
  8. # https://oeis.org/A178070
  9. use 5.010;
  10. use strict;
  11. use warnings;
  12. use ntheory qw(:all);
  13. my $n = 1e9;
  14. my $count = 40;
  15. my $factors_sum = 0;
  16. for (my $p = 7 ; ; $p = next_prime($p)) {
  17. my $z = znorder(10, $p);
  18. if ($n % $z == 0) {
  19. $factors_sum += $p;
  20. last if --$count == 0;
  21. }
  22. }
  23. say $factors_sum;