Numbers whose binary and ternary digit sums are prime: Difference between revisions

=={{header|EasyLang}}==

<syntaxhighlight>

fastfunc isprim num .

if num < 2

return 0

.

i = 2

while i <= sqrt num

if num mod i = 0

return 0

.

i += 1

.

return 1

.

func digsum n b .

while n > 0

sum += n mod b

n = n div b

.

return sum

.

for i = 1 to 199

if isprim digsum i 2 = 1 and isprim digsum i 3 = 1

write i & " "

.

.

</syntaxhighlight>

{{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>