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 00:20, 29 March 2021
, 3 years ago→{{header|C}}
(added Rust programming solution) |
Catskill549 (talk | contribs) |
||
Line 4:
<br><br>
=={{header|AWK}}==
<lang AWK>
# syntax: GAWK -f FIND_PRIME_NUMBERS_OF_THE_FORM_NNN2.AWK
BEGIN {
start = 1
stop = 200
for (n=start; n<=stop; n++) {
p = n*n*n + 2
if (is_prime(p)) {
printf("%3d %'10d\n",n,p)
count++
}
}
printf("Prime numbers %d-%d of the form n*n*n+2: %d\n",start,stop,count)
exit(0)
}
function is_prime(x, i) {
if (x <= 1) {
return(0)
}
for (i=2; i<=int(sqrt(x)); i++) {
if (x % i == 0) {
return(0)
}
}
return(1)
}
</lang>
{{out}}
<pre>
1 3
3 29
5 127
29 24,391
45 91,127
63 250,049
65 274,627
69 328,511
71 357,913
83 571,789
105 1,157,627
113 1,442,899
123 1,860,869
129 2,146,691
143 2,924,209
153 3,581,579
171 5,000,213
173 5,177,719
189 6,751,271
Prime numbers 1-200 of the form n*n*n+2: 19
</pre>
=={{header|C}}==
{{trans|Wren}}
| |||