fast-arithmetic-0.2.3.0: Fast functions on integers.

Copyright	Copyright (c) 2017 Vanessa McHale
Safe Haskell	None
Language	Haskell2010

Numeric.Integer

Description

This module provides a fast primality check.

Synopsis

Documentation

isPrime :: Int -> Bool Source #

O(√n)

fibonacci :: Int -> IO Integer Source #

Indexed starting at 0. This function is slower on small values but faster on large values.