Find prime n such that reversed n is also prime: Difference between revisions
Content added Content deleted
m (entry ordering) |
(add FreeBASIC) |
||
Line 197: | Line 197: | ||
359 373 383 389 |
359 373 383 389 |
||
</pre> |
</pre> |
||
=={{header|FreeBASIC}}== |
|||
Use one of the primality testing algorithms as an include as I can't be bothered putting these in all the time. |
|||
<lang freebasic>#include "isprime.bas" |
|||
function isbackprime( byval n as integer ) as boolean |
|||
if not isprime(n) then return false |
|||
dim as integer m = 0 |
|||
while n |
|||
m *= 10 |
|||
m += n mod 10 |
|||
n \= 10 |
|||
wend |
|||
return isprime(m) |
|||
end function |
|||
for n as uinteger = 2 to 499 |
|||
if isbackprime(n) then print n;" "; |
|||
next n |
|||
print</lang> |
|||
{{out}}<pre>2 3 5 7 11 13 17 31 37 71 73 79 97 101 107 113 131 149 151 157 167 179 181 191 199 311 313 337 347 353 359 373 383 389</pre> |
|||
=={{header|Go}}== |
=={{header|Go}}== |
||
Line 268: | Line 289: | ||
34 such primes found. |
34 such primes found. |
||
</pre> |
</pre> |
||
=={{header|Haskell}}== |
=={{header|Haskell}}== |