Contents

module PerfectNumbers

type Classification = Perfect | Abundant | Deficient

let sumOfFactors n = [for x in 1..n / 2 do if n % x = 0 then yield x] |> List.sum

let classify n : Classification option = 
    match n with
    | x when x <= 0 -> None
    | _ ->
        match sumOfFactors n with
        | x when x = n -> Some Perfect
        | x when x < n -> Some Deficient
        | _ -> Some Abundant

Version data entries

131 entries across 131 versions & 1 rubygems

Version	Path
trackler-2.2.1.58	tracks/fsharp/exercises/perfect-numbers/Example.fs
trackler-2.2.1.57	tracks/fsharp/exercises/perfect-numbers/Example.fs
trackler-2.2.1.56	tracks/fsharp/exercises/perfect-numbers/Example.fs
trackler-2.2.1.55	tracks/fsharp/exercises/perfect-numbers/Example.fs
trackler-2.2.1.54	tracks/fsharp/exercises/perfect-numbers/Example.fs
trackler-2.2.1.53	tracks/fsharp/exercises/perfect-numbers/Example.fs
trackler-2.2.1.52	tracks/fsharp/exercises/perfect-numbers/Example.fs
trackler-2.2.1.51	tracks/fsharp/exercises/perfect-numbers/Example.fs
trackler-2.2.1.50	tracks/fsharp/exercises/perfect-numbers/Example.fs
trackler-2.2.1.49	tracks/fsharp/exercises/perfect-numbers/Example.fs
trackler-2.2.1.48	tracks/fsharp/exercises/perfect-numbers/Example.fs