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

add tinybasic
m (-oops)
(add tinybasic)
Line 200:
done...
</pre>
 
=={{header|TinyBASIC}}==
<lang tinybasic> PRINT 1
LET N = 2
LET M = 4
10 LET J = M + 1
GOSUB 20
IF P = 1 THEN PRINT M
LET N = N + 2
LET M = N*N
IF M < 1000 THEN GOTO 10
END
20 LET P = 0
LET I = 3
30 IF (J/I)*I = J THEN RETURN
LET I = I + 2
IF I*I < J THEN GOTO 30
LET P = 1
RETURN</lang>
{{out}}<pre>1
4
16
36
100
196
256
400
576
676</pre>
 
 
=={{header|Wren}}==
781

edits