count_of_squarefree_k-almost_primes.pl 2.4 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990
  1. #!/usr/bin/perl
  2. # Daniel "Trizen" Șuteu
  3. # Date: 15 March 2021
  4. # https://github.com/trizen
  5. # Count the number of squarefree k-almost primes <= n.
  6. # See also:
  7. # https://en.wikipedia.org/wiki/Almost_prime
  8. =for comment
  9. # PARI/GP program:
  10. a(n,k) = my(N=10^n); (f(m, p, k, j=1)=my(s=sqrtnint(N\m, k), count=0); if(k==2, forprime(q=p, s, count += primepi(N\(m*q)) - j; j+=1); return(count)); forprime(q=p, s, count += f(m*q, q+1, k-1, j+1); j+=1); count); f(1, 2, k);
  11. =cut
  12. use 5.020;
  13. use ntheory qw(:all);
  14. use experimental qw(signatures);
  15. sub squarefree_almost_prime_count ($n, $k) {
  16. if ($k == 0) {
  17. return (($n <= 0) ? 0 : 1);
  18. }
  19. if ($k == 1) {
  20. return prime_count($n);
  21. }
  22. my $count = 0;
  23. sub ($m, $p, $k, $j = 1) {
  24. my $s = rootint(divint($n, $m), $k);
  25. if ($k == 2) {
  26. for (; $p <= $s ; $p = next_prime($p)) {
  27. $count += prime_count(divint($n, mulint($m, $p))) - $j++;
  28. }
  29. return;
  30. }
  31. for (; $p <= $s ; ++$j) {
  32. my $r = next_prime($p);
  33. __SUB__->(mulint($m, $p), $r, $k - 1, $j + 1);
  34. $p = $r;
  35. }
  36. }->(1, 2, $k);
  37. return $count;
  38. }
  39. # Run some tests
  40. foreach my $k (1 .. 7) {
  41. my $upto = pn_primorial($k) + int(rand(1e5));
  42. my $x = squarefree_almost_prime_count($upto, $k);
  43. my $y = scalar grep { is_square_free($_) } @{almost_primes($k, $upto)};
  44. say "Testing: $k with n = $upto -> $x";
  45. $x == $y
  46. or die "Error: $x != $y";
  47. }
  48. say '';
  49. foreach my $k (1 .. 8) {
  50. say("Count of squarefree $k-almost primes for 10^n: ",
  51. join(', ', map { squarefree_almost_prime_count(10**$_, $k) } 0 .. 9));
  52. }
  53. __END__
  54. Count of squarefree 1-almost primes for 10^n: 0, 4, 25, 168, 1229, 9592, 78498, 664579, 5761455, 50847534
  55. Count of squarefree 2-almost primes for 10^n: 0, 2, 30, 288, 2600, 23313, 209867, 1903878, 17426029, 160785135
  56. Count of squarefree 3-almost primes for 10^n: 0, 0, 5, 135, 1800, 19919, 206964, 2086746, 20710806, 203834084
  57. Count of squarefree 4-almost primes for 10^n: 0, 0, 0, 16, 429, 7039, 92966, 1103888, 12364826, 133702610
  58. Count of squarefree 5-almost primes for 10^n: 0, 0, 0, 0, 24, 910, 18387, 286758, 3884936, 48396263
  59. Count of squarefree 6-almost primes for 10^n: 0, 0, 0, 0, 0, 20, 1235, 32396, 605939, 9446284
  60. Count of squarefree 7-almost primes for 10^n: 0, 0, 0, 0, 0, 0, 8, 1044, 38186, 885674
  61. Count of squarefree 8-almost primes for 10^n: 0, 0, 0, 0, 0, 0, 0, 1, 516, 29421