Anonymous user
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:04, 8 June 2021
, 2 years ago→{{header|Nim}}
m (→{{header|REXX}}: used a better variable name, changed/added whitespace and comments, displayed a better grid, changed output title.) |
|||
Line 678:
193
199</pre>
=={{header|Nim}}==
<lang Nim>import strutils
func isPrime(n: Positive): bool =
if n == 1: return false
if n mod 2 == 0: return n == 2
if n mod 3 == 0: return n == 3
var d = 5
while d * d <= n:
if n mod d == 0: return false
inc d, 2
if n mod d == 0: return false
inc d, 4
return true
func digitSum(n, b: Natural): int =
var n = n
while n != 0:
result += n mod b
n = n div b
var count = 0
for n in 2..<200:
if digitSum(n, 2).isPrime and digitSum(n, 3).isPrime:
inc count
stdout.write ($n).align(3), if count mod 16 == 0: '\n' else: ' '
echo()
echo "Found ", count, " numbers."</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
Found 61 numbers.</pre>
=={{header|Perl}}==
{{libheader|ntheory}}
| |||