Rosetta Code

Abundant, deficient and perfect number classifications

Classify sample integers by comparing them with the sum of their proper divisors.

Edit the source, then Run. Checks start after your first Run. Ctrl/⌘ + Enter runs; Tab indents. Preview services use sample data and never contact a real service.

Sourcerosettacode/popular/abundant_deficient_and_perfect_number_classifications.vibe
def proper_divisor_sum(number: int) -> int
  if number == 1
    return 0
  end

  total = 1
  candidate = 2

  while candidate * candidate <= number
    if number % candidate == 0
      total = total + candidate
      other = number // candidate
      if other != candidate
        total = total + other
      end
    end
    candidate = candidate + 1
  end

  total
end

def classification(number: int) -> string
  divisor_sum = proper_divisor_sum(number)
  if divisor_sum < number
    "deficient"
  elsif divisor_sum > number
    "abundant"
  else
    "perfect"
  end
end

def run -> array<{ classification: string, value: int }>
  [
    { value: 12, classification: classification(12) },
    { value: 15, classification: classification(15) },
    { value: 28, classification: classification(28) }
  ]
end

Output

Click Run example to see the result.

Code checks

Run once to load the checker. Your code stays in this browser.