|
|
A355651
|
|
Emirps p such that (p*q) mod (p+q) is also an emirp, where q is the digit reversal of p.
|
|
2
|
|
|
389, 709, 907, 983, 1669, 3163, 3613, 7349, 9349, 9437, 9439, 9661, 11071, 11959, 12841, 13513, 13751, 13757, 13873, 14549, 14593, 14713, 14821, 14923, 15013, 15731, 15919, 16573, 16937, 17011, 17681, 18133, 18671, 30197, 31051, 31531, 31741, 32579, 32783, 32941, 33181, 33287, 35129, 36217, 37561
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
|
|
LINKS
|
|
|
EXAMPLE
|
a(3) = 907 is a term because 907 and its digit reversal 709 are distinct primes, and (907*709) mod (907 + 709) = 1511 and its digit reversal 1151 are distinct primes.
|
|
MAPLE
|
rev:= proc(n) local L, i;
L:= convert(n, base, 10);
add(L[-i]*10^(i-1), i=1..nops(L))
end proc:
filter:= proc(p) local q, r, s;
if not isprime(p) then return false fi;
q:= rev(p);
if q=p or not isprime(q) then return false fi;
r:= (p*q) mod (p+q);
if not isprime(r) then return false fi;
s:= rev(r);
s <> r and isprime(s)
end proc:
select(filter, [seq(i, i=13..10^5, 2)]);
|
|
MATHEMATICA
|
emirpQ[p_] := (r = IntegerReverse[p]) != p && PrimeQ[p] && PrimeQ[r]; Select[Range[40000], emirpQ[#] && emirpQ[Mod[#*(r = IntegerReverse[#]), # + r]] &] (* Amiram Eldar, Sep 04 2022 *)
|
|
PROG
|
(Python)
from sympy import isprime
def emirp(n):
revn = int(str(n)[::-1])
return n != revn and isprime(n) and isprime(revn)
def ok(n):
if not emirp(n): return False
q = int(str(n)[::-1])
return emirp((n*q)%(n+q))
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,base,less
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|