arithmoi-0.6.0.1: Efficient basic number-theoretic functions.

Copyright (c) 2011 Daniel Fischer MIT Daniel Fischer Provisional Non-portable (GHC extensions) None Haskell2010

Math.NumberTheory.GCD.LowLevel

Description

Low level gcd and coprimality functions using the binary gcd algorithm. Normally, accessing these via the higher level interface of Math.NumberTheory.GCD should be sufficient.

Synopsis

# Specialised GCDs

gcdInt :: Int -> Int -> Int Source #

Greatest common divisor of two Ints, calculated with the binary gcd algorithm.

Greatest common divisor of two Words, calculated with the binary gcd algorithm.

## GCDs for unboxed types

Greatest common divisor of two Int#s, calculated with the binary gcd algorithm.

Greatest common divisor of two Word#s, calculated with the binary gcd algorithm.

# Specialised tests for coprimality

Test whether two Ints are coprime, using an abbreviated binary gcd algorithm.

Test whether two Words are coprime, using an abbreviated binary gcd algorithm.

## Coprimality tests for unboxed types

Test whether two Int#s are coprime.

Test whether two Word#s are coprime.