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 13:56, 8 May 2021
, 3 years agoAdd BCPL
Not a robot (talk | contribs) (Add ALGOL-M) |
Not a robot (talk | contribs) (Add BCPL) |
||
Line 141:
157 162 167 171 173
179 181 185 191 193
199</pre>
=={{header|BCPL}}==
<lang bcpl>get "libhdr"
let digitsum(n, base) =
n=0 -> 0, n rem base + digitsum(n/base, base)
let isprime(n) = valof
$( if n<2 then resultis false
for i=2 to n-1 do
if n rem i = 0 then resultis false
resultis true
$)
let accept(n) =
isprime(digitsum(n,2)) & isprime(digitsum(n,3))
let start() be
$( let c = 0
for i=0 to 199 do
if accept(i) do
$( writef("%I4",i)
c := c + 1
if c rem 10 = 0 then wrch('*N')
$)
wrch('*N')
$)</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>
| |||