Find prime numbers of the form n*n*n+2: Difference between revisions
Find prime numbers of the form n*n*n+2 (view source)
Revision as of 22:36, 13 June 2021
, 2 years agoAdded XPL0 example.
m (added a category) |
(Added XPL0 example.) |
||
Line 964:
n = 173 => n³ + 2 = 5,177,719
n = 189 => n³ + 2 = 6,751,271
</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 N;
[for N:= 1 to 199 do
[if IsPrime(N*N*N+2) then
[IntOut(0, N);
ChOut(0, 9\tab\);
IntOut(0, N*N*N+2);
CrLf(0);
]
];
]</lang>
{{out}}
<pre>
1 3
3 29
5 127
29 24391
45 91127
63 250049
65 274627
69 328511
71 357913
83 571789
105 1157627
113 1442899
123 1860869
129 2146691
143 2924209
153 3581579
171 5000213
173 5177719
189 6751271
</pre>
| |||