Math.Combinat.Combinations

Combinations

Documentation

combinations'

Arguments

:: [Int]

shape

-> Int

sum

-> [[Int]]

Combinations fitting into a given shape and having a given degree. The order is lexicographic, that is,

 sort cs == cs where cs = combinations' shape k

countCombinations' :: [Int] -> Int -> Integer

allCombinations' :: [Int] -> [[[Int]]]

All combinations fitting into a given shape.

combinations

Arguments

:: Int

length

-> Int

sum

-> [[Int]]

Combinations of a given length.

countCombinations :: Int -> Int -> Integer

# = \binom { len+d-1 } { len-1 }

combinations1

Arguments

:: Int

length

-> Int

sum

-> [[Int]]

Positive combinations of a given length.

countCombinations1 :: Int -> Int -> Integer