combinatorial-0.1.0.1: Count, enumerate, rank and unrank combinatorial objects

Combinatorics.Partitions

Synopsis

# Documentation

This is a very efficient implementation of prodLinearFactors.

partitionsInc :: Integral a => a -> a -> [[a]] Source #

Give all partitions of the natural number n with summands which are at least k. Not quite correct for k>n.

partitionsDec :: Integral a => a -> a -> [[a]] Source #

allPartitionsInc :: [[[[Int]]]] Source #

it shall be k>0 && n>=0 ==> partitionsInc k n == allPartitionsInc !! k !! n type Int is needed because of list node indexing