Iccanobif primes: Difference between revisions

=={{header|Quackery}}==

As with the other solutions, finds Fibonacci emirps (Fibonacci numbers which are primes when reversed) and reverses them.

<code>isprime</code> is defined at [[Primality by trial division#Quackery]].

<code>from</code>, <code>incr</code> and <code>end</code> are defined at [[Loops/Increment loop index within loop body#Quackery]].

<syntaxhighlight lang="Quackery"> [ 0

[ swap 10 /mod

rot 10 * +

over 0 = until ]

nip ] is revnum ( n --> n )

[] 1 1 from

[ dup revnum isprime if

[ tuck revnum

join swap ]

index swap incr

over size 10 = if end ]

drop echo</syntaxhighlight>

{{out}}

<pre>[ 2 3 5 31 43 773 7951 64901 52057 393121 ]</pre>