| Safe Haskell | Safe |
|---|---|
| Language | Haskell2010 |
Math.Tools.Integer
Synopsis
- square_root_integer :: Integer -> Integer
- newton_square_root_list :: Integral a => a -> [a]
- gcd_ :: Integral a => a -> a -> a
- rising_factorial_power :: (Num a, Eq a) => a -> a -> a
- falling_factorial_power :: (Num a, Eq a) => a -> a -> a
- binomial :: (Enum a, Fractional a) => a -> a -> a
Documentation
square_root_integer :: Integer -> Integer Source #
newton_square_root_list :: Integral a => a -> [a] Source #
Some numbers may cause newton_square_root_list to produce an infinite sequence such as newton_square_root_list 48 == [1,24,13,8,7,8,7,...] We guard against this by terminating if the difference between two adjacent results is less than 2.
rising_factorial_power :: (Num a, Eq a) => a -> a -> a Source #
See Knuth: TAOCP, or http://www.math.harvard.edu/~mazur/preprints/when_is_one.pdf
falling_factorial_power :: (Num a, Eq a) => a -> a -> a Source #
See Knuth: TAOCP or http://www.math.harvard.edu/~mazur/preprints/when_is_one.pdf
binomial :: (Enum a, Fractional a) => a -> a -> a Source #