proposed
approved
proposed
approved
editing
proposed
Prime digits p in base n are counted if there is no prime with 2 digits which can have its leftmost digit removed to produce p, ; e. g. , in base 10 the prime digits 2 and 5 are counted, because there are no primes containing them as rightmost digit.
Steven Kahan; Sol Weintraub: Left truncatable primes. In: Journal of recreational mathematics 29 (1998), ppp. 254-264.
approved
editing
proposed
approved
editing
proposed
Eric Weisstein: 's World of Mathematics, <a href="http://mathworld.wolfram.com/TruncatablePrime.html">Truncatable Prime</a>.
Angell, I. O. and Godwin, H. J. "On Truncatable Primes." Math. Comput. 31, 265-267, 1977.
<a href="/index/Tri#tprime">Index entries for sequences related to truncatable primes</a>
I. O. Angell and H. J. Godwin, <a href="http://dx.doi.org/10.1090/S0025-5718-1977-0427213-2">On Truncatable Primes</a>, Math. Comput. 31, 265-267, 1977.
<a href="/index/Tri#tprime">Index entries for sequences related to truncatable primes</a>
approved
editing
editing
approved
Chai Wah Wu, <a href="http://arxiv.org/abs/1503.08883">On a conjecture regarding primality of numbers constructed from prepending and appending identical digits</a>, arXiv:1503.08883 [math.NT], 2015.
approved
editing
_Martin Renner (martin.renner(AT)gmx.net), _, Jan 04 2008