Find prime numbers of the form n*n*n+2: Difference between revisions

Added 11l
(Added Quackery.)
(Added 11l)
Line 3:
;Task: Find prime numbers of the form &nbsp; <big> n<sup>''3''</sup>+2</big>, &nbsp; where 0 < n < 200
<br><br>
 
=={{header|11l}}==
{{trans|Python}}
 
<syntaxhighlight lang="11l">
F isPrime(n)
L(i) 2 .. Int(n ^ 0.5)
I n % i == 0
R 0B
R 1B
 
L(n) 1..199
I isPrime(n ^ 3 + 2)
print(n"\t"(n ^ 3 + 2))
</syntaxhighlight>
 
{{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|Ada}}==
1,480

edits