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

Content added Content deleted
(Added C++ solution)
m (Minor edit to Forth code)
Line 399: Line 399:


: main
: main
200 0 do
200 1 do
i i i * * 2 + dup prime? if
i i i * * 2 + dup prime? if
i 3 .r 9 .r cr
i 3 .r 9 .r cr
Line 405: Line 405:
drop
drop
then
then
loop ;
2 +loop ;


main
main
Retrieved from "https://rosettacode.org/wiki/Find_prime_numbers_of_the_form_n*n*n%2B2"