Hoogle Search
Within LTS Haskell 24.51 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
derangementNumber :: Integer -> Integercombinatorial Combinatorics No documentation available.
derangementNumbers :: Num a => [a]combinatorial Combinatorics Number of fix-point-free permutations with n elements. http://oeis.org/A000166
equalFuncList Comb.derangementNumber Comb.derangementNumbers 1000
fibonacciNumber :: Integer -> Integercombinatorial Combinatorics No documentation available.
-
combinatorial Combinatorics Number of possibilities to compose a 2 x n rectangle of n bricks.
||| |-- --| ||| |-- --|
equalFuncList Comb.fibonacciNumber Comb.fibonacciNumbers 10000
setPartitionNumbers :: Num a => [[a]]combinatorial Combinatorics Number of partitions of an n element set into k non-empty subsets. Known as Stirling numbers http://oeis.org/A048993.
QC.forAll (QC.choose (0,10000)) $ \k -> QC.forAll (take 7 <$> QC.arbitrary) $ \xs -> length (Comb.setPartitions k xs) == (Comb.setPartitionNumbers !! length (xs::String) ++ repeat 0) !! k
QC.forAll (QC.choose (0,7)) $ \k xs -> length (Comb.rectifications k xs) == (Comb.setPartitionNumbers !! k ++ repeat 0) !! length (xs::String)
surjectiveMappingNumber :: Integer -> Integer -> Integercombinatorial Combinatorics surjectiveMappingNumber n k computes the number of surjective mappings from a n element set to a k element set. http://oeis.org/A019538
surjectiveMappingNumbers :: Num a => [[a]]combinatorial Combinatorics equalFuncList2 Comb.surjectiveMappingNumber Comb.surjectiveMappingNumbers 20
module Combinatorics.
BellNumbers No documentation available.
representationNumbers :: [Integer]combinatorial Combinatorics.Coin No documentation available.
representationNumbersSingle :: Int -> [Integer]combinatorial Combinatorics.Coin No documentation available.