ˌbodʲɪˈɡrʲim
ˌbodʲɪˈɡrʲim
As described in documentation, `powMod` is dangerously polymorphic, as we have little idea how `a` behaves when multiplication overflows. And `powModInteger` can be accessed directly from `integer-gmp`, so `arithmoi` does...
I believe that type level numbers provide a less error-prone way of doing modular arithmetic, and API should encourage users into this route. A PR, adding a mention of `powModInteger`...
This is more or less ready _per se_. But unfortunately prime counting is so intimately (and impenetrably) connected to the existing Eratosthenes sieve, that I cannot decomission the latter. That...
My main goal here is to make source code more maintainable. I can even agree to worsen performance mildly. It might happen that I'd never untangle `Math.NumberTheory.Primes.Counting`. Having two implementations...
Nice! I was working on an overhaul of prime numbers and factorization, but unlikely to make much progress before finishing `text-utf8` project.
Yes, makes sense. Because of GHC 9.0 changes, primes in `arithmoi` require a huge overhaul anyways. I'm painfully slowly fleshing out `Math.NumberTheory.Primes` as a separate library.
Cool :) ---- Another possible source of inspiration is http://hackage.haskell.org/package/computational-algebra-0.5.0.0/docs/Algebra-Ring-Polynomial-Factorise.html But I would like it to be implemented as [`instance UniqueFactorisation`](https://github.com/Bodigrim/arithmoi/blob/master/Math/NumberTheory/Primes.hs#L41) for [`Data.Poly.Poly`](http://hackage.haskell.org/package/poly).
A better API, I guess, and a better interaction with other packages. With all due respect, both `toysolver` and `computational-algebra` are pretty monstrous packages with tons of dependencies. Looking at...
Ideally - yes, but I do not foresee this happening. IMO it is less work to add polynomial factorisation to `arithmoi` than inject all desired improvements into `toysolver`. Also it...
Polynomials over integers, but AFAIR their factorisation would require factorisation of polynomials over `Mod p` as well.