check.sf 569 B

123456789101112131415161718192021
  1. #!/usr/bin/ruby
  2. # Primes p such that, starting with p, 10 consecutive primes = {1,2,3,4,5,6,7,8,9,10} modulo 11.
  3. # https://oeis.org/A338374
  4. var arr = [
  5. 23700022897, 60962211883, 92728531127, 197520193069, 359754461617, 498393445859, 628772434951,
  6. 715117260463, 1053978912361, 1113788109127, 1188162419291, 1562407603483,
  7. 2482030844173, 3021762188281, 3521525276413, 4660551540041, 4933735042897
  8. ]
  9. assert(arr.all{.is_prime})
  10. for p in (arr) {
  11. say assert_eq(10.n_primes(p).map{ _ % 11 }, @(1..10))
  12. }
  13. arr.each{|p|
  14. 10.n_primes(p).map{_ % 11}.say
  15. }