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 10:06, 15 May 2021
, 3 years agoAdded Swift solution
(Added Forth solution) |
(Added Swift solution) |
||
Line 817:
189 => 6751271
Found 19 such prime numbers where 0 < n < 200.
</pre>
=={{header|Swift}}==
<lang swift>import Foundation
func isPrime(_ n: Int) -> Bool {
if n < 2 {
return false
}
if n % 2 == 0 {
return n == 2
}
if n % 3 == 0 {
return n == 3
}
var p = 5
while p * p <= n {
if n % p == 0 {
return false
}
p += 2
if n % p == 0 {
return false
}
p += 4
}
return true
}
for n in 1...200 {
let p = n * n * n + 2
if isPrime(p) {
print(String(format: "%3d%9d", n, p))
}
}</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>
| |||