lynn / elm-arithmetic

Elm library for integer arithmetic and number theory

Arithmetic: Elm library for integer arithmetic and number theory

(View the docs here.)

Implements some useful functions involving:

• Parity and modular arithmetic
• Base conversion
• Squares and cubes
• Divisors, GCD, LCM
• The Chinese Remainder Theorem
• Prime sieves and prime checking (Miller–Rabin)

Released under the BSD3 license.

elm-arithmetic's Issues

Consider longer function names for certain functions

First up - this package looks really useful! I've used Native to change number bases in the past - a pure Elm function is much better.

Is there a reason cbrt and gcd aren't named cubeRoot and greatestCommonDivisor? Seems out of place with the other functions that are in plain English. Perhaps these names are common in MATLAB or numpy, but full English is far more approachable for math noobs like myself.

Arithmetic.isPrime (1000 ^ 1000)

Arithmetic.isPrime (1000 ^ 1000)
HANGS SYSTEM

Possible support for numbers larger than 32 bits?

Only because Project Euler #3 asks for the largest prime factor of 600851475143 (≈6e11) I realized that Arithmetic.primeFactors does something unexpected when faced with numbers too large to fit in 32 bits:

-- Arithmetic.primeFactors 600851475143
[71,-127237759]

It seems to handle inputs less than or equal to 2^32-1 fine but stumbles on bigger values.

Thank you for this very handy library!

Please tag version 3.0.0