|
PROG
|
(PARI)
{for (n=2, 10^9,
F = fibonacci(n); q = 1;
while ( F, if ( !isprime(F%10), q=0; break() ); F\=10 );
if ( q, print1(fibonacci(n), ", ") );
if ( bitand(n, 4095)==0, print([n]) ); /* document how far search went */
); }
(Magma) [ k: n in [1..70000] | forall{ d: d in Intseq(k) | IsPrime(d) } where k is Fibonacci(n) ];
|