arithmoi v0.9.0.0 Release Notes
-
โ Added
- Introduce
Prime
newtype. This newtype is now used extensively in public API:
primes :: Integral a => [Prime a] primeList :: Integral a => PrimeSieve -> [Prime a] sieveFrom :: Integer -> [Prime Integer] nthPrime :: Integer -> Prime Integer
- ๐ New functions
nextPrime
andprecPrime
. Implement an instance ofEnum
for primes (#153):
> [nextPrime 101 .. precPrime 130] [Prime 101,Prime 103,Prime 107,Prime 109,Prime 113,Prime 127]
โ Add the Hurwitz zeta function on non-negative integer arguments (#126).
๐ Implement efficient tests of n-freeness: pointwise and in interval. See
isNFree
andnFreesBlock
(#145).Generate preimages of the totient and the sum-of-divisors functions (#142):
> inverseTotient 120 :: [Integer] [155,310,183,366,225,450,175,350,231,462,143,286,244,372,396,308,248]
- Generate coefficients of Faulhaber polynomials
faulhaberPoly
(#70).
๐ Changed
๐ Support Gaussian and Eisenstein integers in smooth numbers (#138).
๐ Change types of
primes
,primeList
,sieveFrom
,nthPrime
, etc., to usePrime
newtype.โ
Math.NumberTheory.Primes.{Factorisation,Testing,Counting,Sieve}
are no longer re-exported fromMath.NumberTheory.Primes
. MergeMath.NumberTheory.UniqueFactorisation
intoMath.NumberTheory.Primes
(#135, #153).From now on
Math.NumberTheory.Primes.Factorisation.factorise
and similar functions return[(Integer, Word)]
instead of[(Integer, Int)]
.sbcFunctionOnPrimePower
now acceptsPrime Word
instead ofWord
.๐ Better precision for exact values of Riemann zeta and Dirichlet beta functions (#123).
Speed up certain cases of modular multiplication (#160).
Extend Chinese theorem to non-coprime moduli (#71).
๐ Deprecated
- ๐ Deprecate
Math.NumberTheory.Recurrencies.*
. UseMath.NumberTheory.Recurrences.*
instead (#146).
โ Removed
โ Remove
Prime
type family.โ Remove deprecated
Math.NumberTheory.GCD
andMath.NumberTheory.GCD.LowLevel
.
- Introduce