How to resolve the algorithm Abundant, deficient and perfect number classifications step by step in the Sidef programming language

Published on 12 May 2024 09:40 PM

How to resolve the algorithm Abundant, deficient and perfect number classifications step by step in the Sidef programming language

Table of Contents

Problem Statement

These define three classifications of positive integers based on their   proper divisors. Let   P(n)   be the sum of the proper divisors of   n   where the proper divisors are all positive divisors of   n   other than   n   itself.

6   has proper divisors of   1,   2,   and   3. 1 + 2 + 3 = 6,   so   6   is classed as a perfect number.

Calculate how many of the integers   1   to   20,000   (inclusive) are in each of the three classes. Show the results here.

Let's start with the solution:

Step by Step solution about How to resolve the algorithm Abundant, deficient and perfect number classifications step by step in the Sidef programming language

Source code in the sidef programming language

func propdivsum(n) { n.sigma - n }

var h = Hash()
{|i| ++(h{propdivsum(i) <=> i} := 0) } << 1..20000
say "Perfect: #{h{0}}    Deficient: #{h{-1}}    Abundant: #{h{1}}"


  

You may also check:How to resolve the algorithm Color wheel step by step in the GML programming language
You may also check:How to resolve the algorithm 100 doors step by step in the Lang programming language
You may also check:How to resolve the algorithm Bell numbers step by step in the Mathematica / Wolfram Language programming language
You may also check:How to resolve the algorithm Penta-power prime seeds step by step in the Python programming language
You may also check:How to resolve the algorithm String concatenation step by step in the Euphoria programming language