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 19:01, 27 March 2021
, 3 years agoadded Rust programming solution
MaiconSoft (talk | contribs) (Added Delphi example) |
(added Rust programming solution) |
||
Line 515:
done...
</pre>
=={{header|Rust}}==
<lang rust>// 202100327 Rust programming solution
use primes::is_prime;
fn main() {
let mut count = 0;
let begin = 0;
let end = 200;
println!("Find prime numbers of the form");
println!(" n => n³ + 2 ");
for n in begin+1..end-1 {
let m = n*n*n+2;
if is_prime(m) {
println!("{:4} => {}", n, m);
count += 1;
}
}
println!("Found {} such prime numbers where {} < n < {}.", count,begin,end);
}</lang>
{{out}}
<pre>
Find prime numbers of the form
n => n³ + 2
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
Found 19 such prime numbers where 0 < n < 200.
</pre>
| |||