Advanced Exercism • groovy

Perfect Numbers

Challenge Overview

Determine if a number is perfect, abundant, or deficient based on Nicomachus' (60 - 120 CE) classification scheme for positive integers.

Visit the perfect-numbers exercise on Exercism to read the full instructions and download the exercise files.

Community Solutions

View Community Solutions

The following are the top 3 community solutions by stars:

Solution 1 by @heptalophos (⭐ 0) — View on Exercism
Solution 2 by @ancho (⭐ 0) — View on Exercism
Solution 3 by @pldupont (⭐ 0) — View on Exercism

Source: Exercism groovy/perfect-numbers

💡 View Solution

class PerfectNumbers {

    static Classification classify(int num) {
        
        if (num <= 0) 
            throw new ArithmeticException("not a natural number")

        int aliquot = (num == 1) ? 0 :
                      (1 .. Math.floor(num / 2)).findAll { n -> num % n == 0}
                                                .sum(0) as int