Find prime n such that reversed n is also prime: Difference between revisions
Find prime n such that reversed n is also prime (view source)
Revision as of 22:48, 20 December 2021
, 2 years agoAdd BCPL
Not a robot (talk | contribs) (Add CLU) |
Not a robot (talk | contribs) (Add BCPL) |
||
Line 211:
Reversible primes 1-500: 34
</pre>
=={{header|BCPL}}==
<lang bcpl>get "libhdr"
let sieve(prime, n) be
$( 0!prime := false
1!prime := false
for i = 2 to n do i!prime := true
for p = 2 to n/2 if p!prime
$( let c = p*2
while c <= n
$( c!prime := false
c := c+p
$)
$)
$)
let reverse(n) = valof
$( let r=0
while n>0
$( r := 10*r + n rem 10
n := n/10
$)
resultis r
$)
let start() be
$( let prime = vec 999
sieve(prime, 999)
for i = 2 to 500
if i!prime & reverse(i)!prime do
writef("%N ",i)
wrch('*N')
$)</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|C}}==
| |||