Find prime numbers of the form n*n*n+2: Difference between revisions
Content added Content deleted
Not a robot (talk | contribs) (Add COBOL) |
(Find prime numbers of the form n*n*n+2 en Python) |
||
Line 1,170: | Line 1,170: | ||
Done. |
Done. |
||
</pre> |
</pre> |
||
=={{header|Python}}== |
|||
<lang python>#!/usr/bin/python |
|||
def isPrime(n): |
|||
for i in range(2, int(n**0.5) + 1): |
|||
if n % i == 0: |
|||
return False |
|||
return True |
|||
if __name__ == '__main__': |
|||
for n in range(1, 200): |
|||
if isPrime(n**3+2): |
|||
print(f'{n}\t{n**3+2}');</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> |
|||
=={{header|Raku}}== |
=={{header|Raku}}== |