Cousin primes: Difference between revisions
Content added Content deleted
m (→{{header|J}}: minor note about code structure) |
(Added XPL0 example.) |
||
Line 2,024: | Line 2,024: | ||
41 pairs found |
41 pairs found |
||
</pre> |
|||
=={{header|XPL0}}== |
|||
<syntaxhighlight lang "XPL0">include xpllib; \For IsPrime and Print |
|||
int N, C; |
|||
[C:= 0; |
|||
for N:= 2 to 1000-1-4 do |
|||
[if IsPrime(N) then |
|||
if IsPrime(N+4) then |
|||
[Print("(%3.0f, %3.0f) ", float(N), float(N+4)); |
|||
C:= C+1; |
|||
if rem(C/6) = 0 then CrLf(0); |
|||
]; |
|||
]; |
|||
Print("\nThere are %d cousin primes less than 1000.\n", C); |
|||
]</syntaxhighlight> |
|||
{{out}} |
|||
<pre> |
|||
( 3, 7) ( 7, 11) ( 13, 17) ( 19, 23) ( 37, 41) ( 43, 47) |
|||
( 67, 71) ( 79, 83) ( 97, 101) (103, 107) (109, 113) (127, 131) |
|||
(163, 167) (193, 197) (223, 227) (229, 233) (277, 281) (307, 311) |
|||
(313, 317) (349, 353) (379, 383) (397, 401) (439, 443) (457, 461) |
|||
(463, 467) (487, 491) (499, 503) (613, 617) (643, 647) (673, 677) |
|||
(739, 743) (757, 761) (769, 773) (823, 827) (853, 857) (859, 863) |
|||
(877, 881) (883, 887) (907, 911) (937, 941) (967, 971) |
|||
There are 41 cousin primes less than 1000. |
|||
</pre> |
</pre> |