Find squares n where n+1 is prime: Difference between revisions

→‎{{header|ALGOL W}}: No need to calculate root 1000
m (→‎{{header|PL/M}}: Removed unnecessary variable)
(→‎{{header|ALGOL W}}: No need to calculate root 1000)
Line 57:
integer i2, toNext;
toNext := i2 := 4; % note: ( 2n + 2 )^2 - 2n^2 = 8n + 4 %
forwhile ii2 := 2 step 2 until entier( sqrt(< 1000 ) ) do begin
if isPrime( i2 + 1 ) then writeon( i_w := 1, s_w := 0, " ", i2 );
toNext := toNext + 8;
i2 := i2 + toNext
end for_i;while_i2_lt_1000
end;
 
end.
3,021

edits