Truncatable primes: Difference between revisions

Content deleted Content added
Line 386:
{
n -= n & 1; n--;
for (uint d, d0 = 10, d1 = 100; ; n -= 2)
{
while (n % 3 == 0 || n % 5 == 0 || n % 7 == 0) n -= 2;
if ((d = (n % 10)) == 3 || d == 7)
{
while (d1 < n && nd %< d1(d >= n % d0d1) && isP(nd)) %d1 d1))*= 10;
{if (d1 *=> 10n && isP(n)) return n; d0d1 *= 10100; }
if (d1 > n && isP(n)) return n; d0 = 10; d1 = 100;
}
}