Numbers whose binary and ternary digit sums are prime: Difference between revisions
Content added Content deleted
Catskill549 (talk | contribs) (added AWK) |
(Added Go) |
||
Line 559: | Line 559: | ||
= 157= 162= 167= 171= 173= 179= 181= 185= 191= 193 |
= 157= 162= 167= 171= 173= 179= 181= 185= 191= 193 |
||
= 199</pre> |
= 199</pre> |
||
=={{header|Go}}== |
|||
{{trans|Wren}} |
|||
{{libheader|Go-rcu}} |
|||
<lang go>package main |
|||
import ( |
|||
"fmt" |
|||
"rcu" |
|||
) |
|||
func main() { |
|||
var numbers []int |
|||
for i := 2; i < 200; i++ { |
|||
bds := rcu.DigitSum(i, 2) |
|||
if rcu.IsPrime(bds) { |
|||
tds := rcu.DigitSum(i, 3) |
|||
if rcu.IsPrime(tds) { |
|||
numbers = append(numbers, i) |
|||
} |
|||
} |
|||
} |
|||
fmt.Println("Numbers < 200 whose binary and ternary digit sums are prime:") |
|||
for i, n := range numbers { |
|||
fmt.Printf("%4d", n) |
|||
if (i+1)%14 == 0 { |
|||
fmt.Println() |
|||
} |
|||
} |
|||
fmt.Printf("\n\n%d such numbers found\n", len(numbers)) |
|||
}</lang> |
|||
{{out}} |
|||
<pre> |
|||
Numbers < 200 whose binary and ternary digit sums are prime: |
|||
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 |
|||
61 such numbers found |
|||
</pre> |
|||
=={{header|Haskell}}== |
=={{header|Haskell}}== |