Strange unique prime triplets: Difference between revisions
Added XPL0 example.
(Added solution for Action!) |
(Added XPL0 example.) |
||
Line 2,727:
{{out}}
Same as 'basic' version.
=={{header|XPL0}}==
<lang XPL0>func IsPrime(N); \Return 'true' if N is prime
int N, I;
[if N <= 2 then return N = 2;
if (N&1) = 0 then \even >2\ return false;
for I:= 3 to sqrt(N) do
[if rem(N/I) = 0 then return false;
I:= I+1;
];
return true;
]; \IsPrime
int Primes, Cnt, P, M, N, S;
[Primes:= [2, 3, 5, 7, 11, 13, 17, 19, 23, 29];
Format(2, 0);
Cnt:= 0;
for P:= 2 to 9 do
for M:= 1 to P-1 do
for N:= 0 to M-1 do
[S:= Primes(N) + Primes(M) + Primes(P);
if IsPrime(S) then
[Cnt:= Cnt+1;
RlOut(0, float(Cnt));
Text(0, ": ");
RlOut(0, float(Primes(N)));
Text(0, " + ");
RlOut(0, float(Primes(M)));
Text(0, " + ");
RlOut(0, float(Primes(P)));
Text(0, " = ");
RlOut(0, float(S));
CrLf(0);
];
];
]</lang>
{{out}}
<pre>
1: 3 + 5 + 11 = 19
2: 5 + 7 + 11 = 23
3: 3 + 7 + 13 = 23
4: 5 + 11 + 13 = 29
5: 7 + 11 + 13 = 31
6: 5 + 7 + 17 = 29
7: 3 + 11 + 17 = 31
8: 7 + 13 + 17 = 37
9: 11 + 13 + 17 = 41
10: 3 + 7 + 19 = 29
11: 5 + 7 + 19 = 31
12: 7 + 11 + 19 = 37
13: 5 + 13 + 19 = 37
14: 11 + 13 + 19 = 43
15: 5 + 17 + 19 = 41
16: 7 + 17 + 19 = 43
17: 11 + 17 + 19 = 47
18: 3 + 5 + 23 = 31
19: 3 + 11 + 23 = 37
20: 7 + 11 + 23 = 41
21: 5 + 13 + 23 = 41
22: 7 + 13 + 23 = 43
23: 11 + 13 + 23 = 47
24: 3 + 17 + 23 = 43
25: 7 + 17 + 23 = 47
26: 13 + 17 + 23 = 53
27: 5 + 19 + 23 = 47
28: 11 + 19 + 23 = 53
29: 17 + 19 + 23 = 59
30: 3 + 5 + 29 = 37
31: 5 + 7 + 29 = 41
32: 3 + 11 + 29 = 43
33: 7 + 11 + 29 = 47
34: 5 + 13 + 29 = 47
35: 11 + 13 + 29 = 53
36: 7 + 17 + 29 = 53
37: 13 + 17 + 29 = 59
38: 5 + 19 + 29 = 53
39: 11 + 19 + 29 = 59
40: 13 + 19 + 29 = 61
41: 7 + 23 + 29 = 59
42: 19 + 23 + 29 = 71
</pre>
| |||