View source for Safe and Sophie Germain primes

=={{header|11l}}==
<syntaxhighlight lang="11l">F is_prime(a)
   I a == 2
      R 1B
   I a < 2 | a % 2 == 0
      R 0B
   L(i) (3 .. Int(sqrt(a))).step(2)
      I a % i == 0
         R 0B
   R 1B

V cnt = 0
L(n) 1..
   I is_prime(n) & is_prime(2 * n + 1)
      print(n, end' ‘ ’)
      I ++cnt == 50
         L.break
print()</syntaxhighlight>

{{out}}
<pre>
2 3 5 11 23 29 41 53 83 89 113 131 173 179 191 233 239 251 281 293 359 419 431 443 491 509 593 641 653 659 683 719 743 761 809 911 953 1013 1019 1031 1049 1103 1223 1229 1289 1409 1439 1451 1481 1499 
</pre>