fast-combinatorics-0.1.0.8: Fast combinatorics.

CopyrightCopyright (c) 2017 Vanessa McHale
Safe HaskellNone
LanguageHaskell2010

Numeric.Integer

Description

 

Synopsis

Documentation

integerExp :: Int -> Int -> Int Source #

Note that both arguments must be positive. O(log(n)) in the exponent.

isPrime :: Int -> Bool Source #

O(√n)