Substring primes: Difference between revisions

</pre>

=={{header|Factor}}==

For fun, a translation of FreeBASIC.

{{trans|FreeBASIC}}

{{works with|Factor|0.99 2021-02-05}}

<lang factor>USING: combinators kernel math math.primes prettyprint sequences ;

:: ssp? ( n -- ? )

{

{ [ n prime? not ] [ f ] }

{ [ n 10 < ] [ t ] }

{ [ n 100 mod prime? not ] [ f ] }

{ [ n 10 mod prime? not ] [ f ] }

{ [ n 10 /i prime? not ] [ f ] }

{ [ n 100 < ] [ t ] }

{ [ n 100 /i prime? not ] [ f ] }

{ [ n 100 mod 10 /i prime? not ] [ f ] }

[ t ]

} cond ;

500 <iota> [ ssp? ] filter .</lang>

{{out}}

<pre>

V{ 2 3 5 7 23 37 53 73 373 }