fast-combinatorics-0.1.0.8: Fast combinatorics.
Numeric.Integer
Description
Synopsis
integerExp :: Int -> Int -> Int Source #
Note that both arguments must be positive. O(log(n)) in the exponent.
isPrime :: Int -> Bool Source #
O(√n)