Sum of two adjacent numbers are primes: Difference between revisions
Sum of two adjacent numbers are primes (view source)
Revision as of 13:37, 21 January 2022
, 2 years agoAdded XPL0 example.
(Created page with "{{Draft task}} ;Task: <br> Show on this page the first 20 numbers and sum of two adjacent numbers which sum is prime. =={{header|Ring}}== <lang ring> load "stdlibcore.ring"...") |
(Added XPL0 example.) |
||
Line 51:
n = 36 sum= 73
done...
</pre>
=={{header|XPL0}}==
{{trans|Ring}}
<lang XPL0>
include xpllib;
int N, Num, Sum;
[Text(0, "Working...^M^J");
N:= 0;
Num:= 0;
while true do
[N:= N+1;
Sum:= 2*N + 1;
if IsPrime(Sum) then
[Num:= Num+1;
if Num < 21 then
[Text(0,"N = "); IntOut(0,N); Text(0," Sum = "); IntOut(0,Sum); CrLf(0)]
else
exit
]
];
Text(0, "Done...^M^J");
]</lang>
{{out}}
<pre>
Working...
N = 1 Sum = 3
N = 2 Sum = 5
N = 3 Sum = 7
N = 5 Sum = 11
N = 6 Sum = 13
N = 8 Sum = 17
N = 9 Sum = 19
N = 11 Sum = 23
N = 14 Sum = 29
N = 15 Sum = 31
N = 18 Sum = 37
N = 20 Sum = 41
N = 21 Sum = 43
N = 23 Sum = 47
N = 26 Sum = 53
N = 29 Sum = 59
N = 30 Sum = 61
N = 33 Sum = 67
N = 35 Sum = 71
N = 36 Sum = 73
</pre>
| |||