prog.pl 1003 B

1234567891011121314151617181920212223242526272829303132333435363738394041
  1. #!/usr/bin/perl
  2. # Data:
  3. # 3, 5, 7, 11, 17, 19, 29, 41, 71, 181, 239, 379, 449, 701, 881, 1429, 1871, 2729, 3079, 4159, 10529, 11969, 23561, 40699, 51679, 90271, 104651, 146719, 226799, 244529, 252449, 388961, 403649, 825551, 906751, 1276001, 2408561, 2648449, 3807649, 4058209, 4406401, 12227489, 14579839, 16780609, 23779601, 38313001, 57762431, 74850049, 166676399, 384988031,
  4. use ntheory qw(:all);
  5. use 5.014;
  6. local $| = 1;
  7. my $k = 1;
  8. my $n = 384988031;
  9. my $m = divisors($n+1)*divisors($n-1)/divisors($n)**2;
  10. --$n;
  11. --$m;
  12. #for (my ($n, $m) = (2, -1) ; ; ++$n) {
  13. for (;;++$n) {
  14. #my $d = (divisors($n-1) / divisors($n)) + (divisors($n+1) / divisors($n));
  15. #tau(n+1)*tau(n-1)/tau(n)^2
  16. my $d = divisors($n+1) * divisors($n-1) / divisors($n)**2;
  17. if ($m < $d) {
  18. $m = $d;
  19. print "$n, ";
  20. # print "$d, ";
  21. #say "$k $n";
  22. ++$k;
  23. }
  24. }
  25. # upto(n) = my(m=-1); for(k=2, n, my(d=numdiv(k+1)*numdiv(k-1)/numdiv(k)^2); if (d>m, m=d; print1(k, ", ")));