prog.sf 900 B

12345678910111213141516171819202122232425262728293031323334353637383940414243444546
  1. #!/usr/bin/ruby
  2. # Primes in A323426.
  3. # https://oeis.org/A331265
  4. # Known terms:
  5. # 211, 322111, 4332221111
  6. # Next term, if it exists, is greater than A323426(k), with k = 309, which has more than 10^5 number of digits.
  7. func a(n) {
  8. var t = ""
  9. for k in (1..n) {
  10. t += ("#{n - k + 1}" * k)
  11. }
  12. t.to_i
  13. }
  14. for k in (310..1e5) {
  15. var t = a(k)
  16. say "Testing: #{k} -- len: #{t.len}"
  17. if (t.is_prob_prime) {
  18. say "Prime found for k = #{k}"
  19. if (k > 4) {
  20. die "New term found: #{k}"
  21. }
  22. }
  23. }
  24. __END__
  25. ...
  26. Testing: 301 -- len: 108732
  27. Testing: 302 -- len: 109530
  28. Testing: 303 -- len: 110331
  29. Testing: 304 -- len: 111135
  30. Testing: 305 -- len: 111942
  31. Testing: 306 -- len: 112752
  32. Testing: 307 -- len: 113565
  33. Testing: 308 -- len: 114381
  34. Testing: 309 -- len: 115200
  35. Testing: 310 -- len: 116022
  36. ^C
  37. 3450.34s user 5.55s system 93% cpu 1:01:23.04 total