Vampire Numbers
C_K_Yang liuguangxi mafia eulerscheZahl C3PO Philippe_57721 mathpseudo sinan benito255 lesnik7 nielkh
Public  09/08/17  5xp  Programming  64.7% 
A vampire number is a 2kdigits number $n$ such as there exist two kdigits numbers $a$ and $b$ such as:
 $n=a \times b$
 the digits of $a$ and $b$ are exactly the digits of $n$
Example: $ 1001295697 = 19001 \times 52697$
The two factors $a$ and $b$ are called, quite logically, the fangs.
Find the first and last 10digits vampire numbers not containing the digit 0 with prime fangs.
Anwer format: $first,last$
Example : 11722657,79168819 (for 8 digits)
$(11722657 = 2267 \times 5171 \quad \blacksquare \quad 79168819 = 8171 \times 9689)$
[My timing: 82 sec]
Hint:
The first digits of $last$ are $945 \dots $
 $n=a \times b$
 the digits of $a$ and $b$ are exactly the digits of $n$
Example: $ 1001295697 = 19001 \times 52697$
The two factors $a$ and $b$ are called, quite logically, the fangs.
Find the first and last 10digits vampire numbers not containing the digit 0 with prime fangs.
Anwer format: $first,last$
Example : 11722657,79168819 (for 8 digits)
$(11722657 = 2267 \times 5171 \quad \blacksquare \quad 79168819 = 8171 \times 9689)$
[My timing: 82 sec]
Hint:
The first digits of $last$ are $945 \dots $
New Members
 JMR03 1d:1h
 MrSexysPizza 2d:9h
 N3W70N 2d:12h
 cod3bluezer0 3d:19h
 cduruk 1w:2d
Fresh Problems

Segments 17h:30m
solved by 3 
Plowing the field 2d:15h
solved by 11 
Mertens Equations 1w:2d
solved by 9 
Vampire Numbers 2w:2d
solved by 11 
Convex numbers 2w:5d
solved by 4