Sum of primes in odd positions is prime: Difference between revisions
Sum of primes in odd positions is prime (view source)
Revision as of 13:23, 8 November 2021
, 2 years agoadd gwbasic
Catskill549 (talk | contribs) (added AWK) |
(add gwbasic) |
||
Line 163:
143 823 26,879
</pre>
=={{header|GW-BASIC}}==
<lang gwbasic>10 S = 2
20 A = 1
30 PRINT 1, 2, 2
40 FOR P = 3 TO 999 STEP 2
50 GOSUB 90
60 IF Q=1 THEN GOSUB 190
70 NEXT P
80 END
90 Q=0
100 IF P=3 THEN Q=1:RETURN
110 IF P = 2 THEN Q = 1: RETURN
120 IF INT(P/2)*2= P THEN Q = 0: RETURN
130 I=1
140 I=I+2
150 IF INT(P/I)*I = P THEN RETURN
160 IF I*I<=P THEN GOTO 140
170 Q = 1
180 RETURN
190 A = A + 1
200 IF A MOD 2 = 0 THEN RETURN
210 S = S + P
220 T = P
230 P = S
240 GOSUB 90
250 IF Q = 1 THEN PRINT A, T, S
260 P = T
270 RETURN</lang>
=={{header|jq}}==
Line 197 ⟶ 226:
143 823 26879
</pre>
=={{header|Julia}}==
{{trans|Factor}}
| |||