How to resolve the algorithm Abundant, deficient and perfect number classifications step by step in the VBScript 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 VBScript 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 VBScript programming language
Source code in the vbscript programming language
Deficient = 0
Perfect = 0
Abundant = 0
For i = 1 To 20000
sum = 0
For n = 1 To 20000
If n < i Then
If i Mod n = 0 Then
sum = sum + n
End If
End If
Next
If sum < i Then
Deficient = Deficient + 1
ElseIf sum = i Then
Perfect = Perfect + 1
ElseIf sum > i Then
Abundant = Abundant + 1
End If
Next
WScript.Echo "Deficient = " & Deficient & vbCrLf &_
"Perfect = " & Perfect & vbCrLf &_
"Abundant = " & Abundant
You may also check:How to resolve the algorithm Empty string step by step in the oberon-2 programming language
You may also check:How to resolve the algorithm Ackermann function step by step in the MAXScript programming language
You may also check:How to resolve the algorithm Levenshtein distance step by step in the uBasic/4tH programming language
You may also check:How to resolve the algorithm Ackermann function step by step in the ooRexx programming language
You may also check:How to resolve the algorithm Take notes on the command line step by step in the 8086 Assembly programming language