login
Reversible primes with k digits, of the form concat(a,b), such that, with all the possible k-1 concatenation of two numbers a and b, we get k-1 primes (a mod b) and the sum of these k-1 primes is a reversible prime itself.
0

%I #12 May 31 2024 14:34:19

%S 37,79,97,353,383,389,3203,3803,37463,79687,311137,311957,312289,

%T 313517,371057,715109,797009,3112913,3137003,3600017,7100003,71947037,

%U 380000009,733193633,3794000333,7193124947,7331702267,37337357017

%N Reversible primes with k digits, of the form concat(a,b), such that, with all the possible k-1 concatenation of two numbers a and b, we get k-1 primes (a mod b) and the sum of these k-1 primes is a reversible prime itself.

%H Carlos Rivera, <a href="https://www.primepuzzles.net/puzzles/puzz_1053.htm">Puzzle 1053. p=concat(a,b) such that ...</a>, The Prime Puzzles and Problems Connection.

%Y Cf. A007500 (reversible primes).

%K nonn,base,more

%O 1,1

%A _Michel Marcus_, Sep 17 2021

%E Definition corrected by _Jason Yuen_, May 31 2024