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:36, 14 June 2021
, 2 years agoAdd Plain English example
(Add Seed7 example) |
(Add Plain English example) |
||
Line 684:
n = 173 => n^3+2 = 5,177,719
n = 189 => n^3+2 = 6,751,271
</pre>
=={{header|Plain English}}==
<lang plainenglish>To run:
Start up.
Put 1 into a counter.
Loop.
Put the counter into a number.
Raise the number to 3.
Add 2 to the number.
If the number is prime, write the counter then " " then the number on the console.
Add 2 to the counter.
If the counter is greater than 200, break.
Repeat.
Write "Done." on the console.
Wait for the escape key.
Shut down.</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
Done.
</pre>
| |||