How to resolve the algorithm Abundant, deficient and perfect number classifications step by step in the Quackery 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 Quackery 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 Quackery programming language

Source code in the quackery programming language

  [ 0 swap witheach + ]        is sum ( [ --> n )

  [ factors -1 pluck 
    dip sum 
    2dup = iff
      [ 2drop 1 ] done
    < iff 0 else 2 ]           is dpa ( n --> n )

  0 0 0
  20000 times 
    [ i 1+ dpa 
      [ table
        [ 1+ ]
        [ dip 1+ ]
        [ rot 1+ unrot ] ] do ]
  say "Deficient = " echo cr
  say "  Perfect = " echo cr
  say " Abundant = " echo cr

  

You may also check:How to resolve the algorithm 2048 step by step in the Factor programming language
You may also check:How to resolve the algorithm Hello world/Graphical step by step in the VBA programming language
You may also check:How to resolve the algorithm Conjugate transpose step by step in the Ada programming language
You may also check:How to resolve the algorithm Strong and weak primes step by step in the Nim programming language
You may also check:How to resolve the algorithm HTTPS step by step in the Lasso programming language