Numbers whose binary and ternary digit sums are prime: Difference between revisions
Numbers whose binary and ternary digit sums are prime (view source)
Revision as of 20:13, 16 April 2021
, 3 years agoAdd BASIC
Not a robot (talk | contribs) (Add BASIC) |
|||
Line 68:
<pre>5 6 7 10 11 12 13 17 18 19 21 25 28 31 33 35 36 37 41 47 49 55 59 61 65 67 69 73 79 82 84 87 91 93 97 103 107 109 115 117
121 127 129 131 133 137 143 145 151 155 157 162 167 171 173 179 181 185 191 193 199</pre>
=={{header|BASIC}}==
None of the digit sums are higher than 9, so the easiest thing to do
is to hardcode which ones are prime.
<lang BASIC>10 DEFINT I,J,K,P
20 DIM P(9): DATA 0,1,1,0,1,0,1,0,0
30 FOR I=1 TO 9: READ P(I): NEXT
40 FOR I=0 TO 199
50 J=0: K=I
60 IF K>0 THEN J=J+K MOD 2: K=K\2: GOTO 60 ELSE IF P(J)=0 THEN 90
70 J=0: K=I
80 IF K>0 THEN J=J+K MOD 3: K=K\3: GOTO 80 ELSE IF P(J) THEN PRINT I,
90 NEXT I</lang>
{{out}}
<pre> 5 6 7 10 11
12 13 17 18 19
21 25 28 31 33
35 36 37 41 47
49 55 59 61 65
67 69 73 79 82
84 87 91 93 97
103 107 109 115 117
121 127 129 131 133
137 143 145 151 155
157 162 167 171 173
179 181 185 191 193
199</pre>
=={{header|C}}==
| |||