How to resolve the algorithm Sequence: smallest number with exactly n divisors step by step in the Nim programming language

Published on 12 May 2024 09:40 PM

How to resolve the algorithm Sequence: smallest number with exactly n divisors step by step in the Nim programming language

Table of Contents

Problem Statement

Calculate the sequence where each term   an   is the smallest natural number that has exactly   n   divisors.

Show here, on this page, at least the first  15  terms of the sequence.

Let's start with the solution:

Step by Step solution about How to resolve the algorithm Sequence: smallest number with exactly n divisors step by step in the Nim programming language

Source code in the nim programming language

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


  

You may also check:How to resolve the algorithm Playing cards step by step in the Go programming language
You may also check:How to resolve the algorithm Strip a set of characters from a string step by step in the Excel programming language
You may also check:How to resolve the algorithm Sleeping Beauty problem step by step in the XPL0 programming language
You may also check:How to resolve the algorithm Lucas-Lehmer test step by step in the C programming language
You may also check:How to resolve the algorithm Sorting algorithms/Sleep sort step by step in the V (Vlang) programming language