Anonymous user
Sequence: smallest number with exactly n divisors: Difference between revisions
Sequence: smallest number with exactly n divisors (view source)
Revision as of 22:22, 23 October 2019
, 4 years ago→{{header|Kotlin}}
(Added Python solution) |
|||
Line 397:
{{output}}
<pre>
The first 15 terms of the sequence are:
[1, 2, 4, 6, 16, 12, 64, 24, 36, 48, 1024, 60, 4096, 192, 144]
</pre>
=={{header|Nim}}==
{{trans|Kotlin}}
<lang nim>import strformat
const MAX = 15
func countDivisors(n: int): int =
var count = 0
var i = 1
while i * i <= n:
if n mod i == 0:
if i == n div i:
inc count, 1
else:
inc count, 2
inc i
count
var sequence: array[MAX, int]
echo fmt"The first {MAX} terms of the sequence are:"
var i = 1
var n = 0
while n < MAX:
var k = countDivisors(i)
if k <= MAX and sequence[k - 1] == 0:
sequence[k - 1] = i
inc n
inc i
echo $sequence</lang>
{{out}}
<pre>
The first 15 terms of the sequence are:
| |||