Emirp primes: Difference between revisions

Content deleted Content added
Added Quackery.
Line 808:
let rec fN n g = match n with |0->g |_->fN (n/10) (g*10+n%10)
let fG n g = n<>g && isPrime g
primesprimes32() |> Seq.filter (fun n -> fG n (fN n 0))
</lang>
 
===The Task===
<lang fsharp>