find_a(10).pl 6.8 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194
  1. #!/usr/bin/perl
  2. # a(n) is the smallest number k such that n consecutive integers starting at k have the same number of nonprime divisors (A033273).
  3. # https://oeis.org/A324594
  4. # a(9) = a(10) = 2587701932494, discovered by Giovanni Resta on Sep 04 2019.
  5. # Notice that:
  6. # 2587701932494 + 2 = 2^4 * 3^2 * 17970152309
  7. # 2587701932494 + 6 = 2^2 * 5^4 * 1035080773
  8. # By looking for special numbers of the form 2^a * 3^b * p, we may find upper-bounds for the next terms.
  9. use 5.020;
  10. use ntheory qw(:all);
  11. use experimental qw(signatures);
  12. sub count ($n) {
  13. divisor_sum($n, 0) - scalar(factor_exp($n));
  14. }
  15. sub score ($n) {
  16. my $t = count($n);
  17. for my $k (1..100) {
  18. if (count($n+$k) != $t) {
  19. return $k;
  20. }
  21. }
  22. }
  23. foreach my $n (8311077681..1e11) {
  24. # p = 625 n + 434, q = 36 n + 25, n element Z
  25. my $p = 625 * $n + 434;
  26. my $q = 36*$n + 25;
  27. if (is_prime($q) and is_prime($p)) {
  28. # ( 2^4 * 3^2 * p - 2) = (2^2 * 5^4 * q - 6)
  29. my $m = 2**4 * 3**2 * $p - 2;
  30. my $s = score($m);
  31. if ($s >= 8) {
  32. say "For p = $q --> $m has a score of $s with n = $n";
  33. foreach my $k(1..4) {
  34. my $m = $n-$k;
  35. my $s = score($m);
  36. if ($s >= 9) {
  37. say "For q = $q --> $m has a score of $s";
  38. if ($s >= 10) {
  39. die "Upper-bound for a(10) = $m\n";
  40. }
  41. }
  42. }
  43. }
  44. }
  45. }
  46. __END__
  47. forprimes {
  48. my $n = 2**2 * 5**4 * $_ - 6;
  49. if ((($n+2) % (2**4 * 3**2) == 0 and is_prime(($n+2) / (2**4 * 3**2)))) {
  50. my $s = score($n);
  51. if ($s >= 8) {
  52. say "For p = $_ --> $n has a score of $s";
  53. foreach my $k(1..4) {
  54. my $m = $n-$k;
  55. my $s = score($m);
  56. if ($s >= 9) {
  57. say "For p = $_ --> $m has a score of $s";
  58. if ($s >= 10) {
  59. die "Upper-bound for a(10) = $m\n";
  60. }
  61. }
  62. }
  63. }
  64. }
  65. } 372522098053, 1e12;
  66. #~ forprimes {
  67. #~ my $n = 2**4 * 3**2 * $_ - 1;
  68. #~ if ((($n+5) % (2**2 * 5**4) == 0 and is_prime(($n+5) / (2**2 * 5**4)))) {
  69. #~ my $s = score($n);
  70. #~ if ($s >= 8) {
  71. #~ say "For p = $_ --> $n has a score of $s";
  72. #~ foreach my $k(1..4) {
  73. #~ my $m = $n-$k;
  74. #~ my $s = score($m);
  75. #~ if ($s >= 9) {
  76. #~ say "For p = $_ --> $m has a score of $s";
  77. #~ if ($s >= 10) {
  78. #~ die "Upper-bound for a(10) = $m\n";
  79. #~ }
  80. #~ }
  81. #~ }
  82. #~ }
  83. #~ }
  84. #~ } 17970152309, 1e12;
  85. __END__
  86. For p = 561889429 --> 1404723572494 has a score of 7
  87. For p = 1035080773 --> 2587701932494 has a score of 9
  88. For p = 1302098029 --> 3255245072494 has a score of 7
  89. For p = 1935566197 --> 4838915492494 has a score of 7
  90. For p = 1035080773 --> 2587701932494 has a score of 9
  91. For p = 18239128333 --> 45597820832494 has a score of 8
  92. For p = 19723897789 --> 49309744472494 has a score of 8
  93. For p = 25877506021 --> 64693765052494 has a score of 8
  94. For p = 28232914597 --> 70582286492494 has a score of 8
  95. For p = 42086368141 --> 105215920352494 has a score of 8
  96. For p = 54130664149 --> 135326660372494 has a score of 8
  97. For p = 55260657637 --> 138151644092494 has a score of 8
  98. For p = 55262128309 --> 138155320772494 has a score of 8
  99. For p = 57622809373 --> 144057023432493 has a score of 8
  100. For p = 61983345301 --> 154958363252493 has a score of 8
  101. For p = 63164144437 --> 157910361092494 has a score of 8
  102. For p = 72522098053 --> 181305245132494 has a score of 9
  103. For p = 96189817237 --> 240474543092494 has a score of 9
  104. For p = 100553807077 --> 251384517692494 has a score of 9
  105. For p = 105864885493 --> 264662213732494 has a score of 8
  106. For p = 106405795789 --> 266014489472494 has a score of 9
  107. For p = 110041035397 --> 275102588492494 has a score of 8
  108. For p = 113739238933 --> 284348097332494 has a score of 8
  109. For p = 121050305197 --> 302625762992494 has a score of 8
  110. For p = 123282435013 --> 308206087532494 has a score of 8
  111. For p = 125876453893 --> 314691134732494 has a score of 9
  112. For p = 129396961861 --> 323492404652494 has a score of 8
  113. For p = 141361196461 --> 353402991152494 has a score of 8
  114. For p = 150178310701 --> 375445776752494 has a score of 8 with n = 4171619741
  115. For p = 151094205709 --> 377735514272494 has a score of 8 with n = 4197061269
  116. For p = 156310948069 --> 390777370172494 has a score of 8 with n = 4341970779
  117. For p = 159538376941 --> 398845942352494 has a score of 8 with n = 4431621581
  118. For p = 160385248717 --> 400963121792494 has a score of 8 with n = 4455145797
  119. For p = 192844580893 --> 482111452232494 has a score of 9 with n = 5356793913
  120. For p = 193846276357 --> 484615690892494 has a score of 8 with n = 5384618787
  121. For p = 198253207357 --> 495633018392494 has a score of 8 with n = 5507033537
  122. For p = 205856273437 --> 514640683592494 has a score of 8 with n = 5718229817
  123. For p = 206835717013 --> 517089292532494 has a score of 8 with n = 5745436583
  124. For p = 215253787741 --> 538134469352494 has a score of 8 with n = 5979271881
  125. For p = 215661722389 --> 539154305972494 has a score of 8 with n = 5990603399
  126. For p = 223318321477 --> 558295803692494 has a score of 8 with n = 6203286707
  127. For p = 223653338341 --> 559133345852494 has a score of 9 with n = 6212592731
  128. For p = 225804906493 --> 564512266232494 has a score of 9 with n = 6272358513
  129. For p = 228099619933 --> 570249049832494 has a score of 8 with n = 6336100553
  130. For p = 232454185477 --> 581135463692494 has a score of 8 with n = 6457060707
  131. For p = 233938339837 --> 584845849592494 has a score of 8 with n = 6498287217
  132. For p = 234711721429 --> 586779303572494 has a score of 8 with n = 6519770039
  133. For p = 235027434949 --> 587568587372494 has a score of 8 with n = 6528539859
  134. For p = 242484828109 --> 606212070272494 has a score of 8 with n = 6735689669
  135. For p = 247949575117 --> 619873937792494 has a score of 8 with n = 6887488197
  136. For p = 254395377421 --> 635988443552494 has a score of 8 with n = 7066538261
  137. For p = 266683117093 --> 666707792732494 has a score of 8 with n = 7407864363
  138. For p = 275754225949 --> 689385564872494 has a score of 8 with n = 7659839609
  139. For p = 277299391381 --> 693248478452494 has a score of 8 with n = 7702760871
  140. For p = 284390002933 --> 710975007332494 has a score of 9 with n = 7899722303
  141. For p = 286488763909 --> 716221909772494 has a score of 8 with n = 7958021219
  142. For p = 289553761573 --> 723884403932494 has a score of 8 with n = 8043160043
  143. For p = 289642662637 --> 724106656592494 has a score of 8 with n = 8045629517
  144. For p = 295787783293 --> 739469458232494 has a score of 8 with n = 8216327313
  145. For p = 297051950149 --> 742629875372494 has a score of 9 with n = 8251443059
  146. For p = 299198796541 --> 747996991352494 has a score of 8 with n = 8311077681