Substring primes: Difference between revisions
Content added Content deleted
m (→{{header|REXX}}: changed the location of counting of primality tests.) |
(add FreeBASIC) |
||
Line 108: | Line 108: | ||
373 |
373 |
||
</pre> |
</pre> |
||
=={{header|FreeBASIC}}== |
|||
Since this is limited to one, two, or three-digit numbers I will be a bit cheeky. |
|||
<lang freebasic>#include "isprime.bas" |
|||
function is_ssp(n as uinteger) as boolean |
|||
if not isprime(n) then return false |
|||
if n < 10 then return true |
|||
if not isprime(n mod 100) then return false |
|||
if not isprime(n mod 10) then return false |
|||
if not isprime(n\10) then return false |
|||
if n < 100 then return true |
|||
if not isprime(n\100) then return false |
|||
if not isprime( (n mod 100)\10 ) then return false |
|||
return true |
|||
end function |
|||
for i as uinteger = 1 to 500 |
|||
if is_ssp(i) then print i;" "; |
|||
next i |
|||
print</lang> |
|||
{out}}<pre>2 3 5 7 23 37 53 73 373</pre> |
|||
=={{header|Julia}}== |
=={{header|Julia}}== |