| Safe Haskell | Safe |
|---|---|
| Language | Haskell98 |
Combinatorics.Partitions
Synopsis
- pentagonalPowerSeries :: [Integer]
- numPartitions :: [Integer]
- partitionsInc :: Integral a => a -> a -> [[a]]
- partitionsDec :: Integral a => a -> a -> [[a]]
- allPartitionsInc :: [[[[Int]]]]
- propInfProdLinearFactors :: Int -> Bool
- propPentagonalPowerSeries :: Int -> Bool
- propPentagonalsDifP :: Int -> Bool
- propPentagonalsDifN :: Int -> Bool
- propPartitions :: Int -> Int -> Bool
- propNumPartitions :: Int -> Bool
Documentation
pentagonalPowerSeries :: [Integer] Source #
This is a very efficient implementation of prodLinearFactors.
numPartitions :: [Integer] Source #
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
propInfProdLinearFactors :: Int -> Bool Source #
propPentagonalPowerSeries :: Int -> Bool Source #
propPentagonalsDifP :: Int -> Bool Source #
propPentagonalsDifN :: Int -> Bool Source #
propNumPartitions :: Int -> Bool Source #