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 13:35, 15 March 2021
, 3 years ago→{{header|Ring}}
(Created page with "{{Draft task}} ;Task: Find prime numbers of form <big> n<sup>''3''</sup>+2</big>, where 0 < n < 200 <br> =={{header|Ring}}== <lang ring> load "stdlib.ring" see...") |
|||
Line 12:
pr = pow(n,3)+2
if isprime(pr)
see "n: " + n + " n*n*n+
ok
next
Line 21:
<pre>
working...
n: 1 n*n*n+
n: 3 n*n*n+
n: 5 n*n*n+
n: 29 n*n*n+
n: 45 n*n*n+
n: 63 n*n*n+
n: 65 n*n*n+
n: 69 n*n*n+
n: 71 n*n*n+
n: 83 n*n*n+
n: 105 n*n*n+
n: 113 n*n*n+
n: 123 n*n*n+
n: 129 n*n*n+
n: 143 n*n*n+
n: 153 n*n*n+
n: 171 n*n*n+
n: 173 n*n*n+
n: 189 n*n*n+
done...
</pre>
| |||