|
|
A272552
|
|
Numbers n such that n*prime(n) is a pandigital number containing digits 0-9 exactly once.
|
|
0
|
|
|
|
OFFSET
|
1,1
|
|
LINKS
|
|
|
EXAMPLE
|
11376 appears in the list because 11376 * prime(11376) = 1375028496 that contains digits 0-9 only once.
15057 appears in the list because 15057 * prime(15057) = 2476108593 that contains digits 0-9 only once.
|
|
MATHEMATICA
|
Select[Range[100000], Sort@IntegerDigits[# Prime@#] == Range[0, 9] &]
|
|
PROG
|
(PARI) isok(n) = my(d = digits(n*prime(n))); (#d == 10) && (#vecsort(d, , 8) == 10); \\ Michel Marcus, May 02 2016
(Python)
from sympy import prime
from numpy import sort
for n in range(10000, 30000):
num=sort(list(str(n*prime(n))))
res=''.join(num)
if(res=='0123456789'):print(n)
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,base,fini,full
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|