072 Counting fractions -- v2.pl 521 B

123456789101112131415161718192021222324
  1. #!/usr/bin/perl
  2. # Daniel "Trizen" Șuteu
  3. # Date: 25 July 2021
  4. # https://github.com/trizen
  5. # Sum of Euler phi function phi(k) for 2 <= k <= 10^6.
  6. # https://projecteuler.net/problem=72
  7. # Runtime: 0.119s
  8. use 5.020;
  9. use strict;
  10. use warnings;
  11. use ntheory qw(moebius mertens);
  12. use Math::AnyNum qw(dirichlet_sum);
  13. #use Math::Sidef qw(:all);
  14. use experimental qw(signatures);
  15. say dirichlet_sum(1e6, sub ($n) { moebius($n) }, sub ($n) { $n },
  16. sub ($n) { mertens($n) }, sub ($n) { ($n*($n+1))>>1 })-1;