Prime triplets: Difference between revisions
Content added Content deleted
(Added XPL0 example.) |
|||
Line 807: | Line 807: | ||
Found 43 such prime triplets. |
Found 43 such prime triplets. |
||
</pre> |
|||
=={{header|XPL0}}== |
|||
<lang XPL0>func IsPrime(N); \Return 'true' if N is a prime number |
|||
int N, I; |
|||
[if N <= 1 then return false; |
|||
for I:= 2 to sqrt(N) do |
|||
if rem(N/I) = 0 then return false; |
|||
return true; |
|||
]; |
|||
int Count, P; |
|||
[ChOut(0, ^ ); |
|||
Count:= 0; |
|||
P:= 3; |
|||
repeat if IsPrime(P) & IsPrime(P+2) & IsPrime(P+6) then |
|||
[IntOut(0, P); ChOut(0, ^ ); |
|||
IntOut(0, P+2); ChOut(0, ^ ); |
|||
IntOut(0, P+6); ChOut(0, ^ ); |
|||
Count:= Count+1; |
|||
if rem(Count/5) then ChOut(0, 9\tab\) else CrLf(0); |
|||
]; |
|||
P:= P+2; |
|||
until P >= 5500; |
|||
CrLf(0); |
|||
IntOut(0, Count); |
|||
Text(0, " prime triplets found below 5500. |
|||
"); |
|||
]</lang> |
|||
{{out}} |
|||
<pre> |
|||
5 7 11 11 13 17 17 19 23 41 43 47 101 103 107 |
|||
107 109 113 191 193 197 227 229 233 311 313 317 347 349 353 |
|||
461 463 467 641 643 647 821 823 827 857 859 863 881 883 887 |
|||
1091 1093 1097 1277 1279 1283 1301 1303 1307 1427 1429 1433 1481 1483 1487 |
|||
1487 1489 1493 1607 1609 1613 1871 1873 1877 1997 1999 2003 2081 2083 2087 |
|||
2237 2239 2243 2267 2269 2273 2657 2659 2663 2687 2689 2693 3251 3253 3257 |
|||
3461 3463 3467 3527 3529 3533 3671 3673 3677 3917 3919 3923 4001 4003 4007 |
|||
4127 4129 4133 4517 4519 4523 4637 4639 4643 4787 4789 4793 4931 4933 4937 |
|||
4967 4969 4973 5231 5233 5237 5477 5479 5483 |
|||
43 prime triplets found below 5500. |
|||
</pre> |
</pre> |