Integer factiorization function somewhere in Haskell library?

Question

I find some library with implementation of integer factorization function. Preferably some fast implementation in some popular library, to not reinvent the wheel.

Is there some ?

score 12 · Accepted Answer · answered Feb 22 '13 at 12:49

12

A quick google search shows arithmoi package by Daniel Fischer.

answered Feb 22 '13 at 12:49

Satvik

11,238
1
38
46

5

Arithmoi is great. Not only does it contain lots of number-theoretical tools, but it also implements them properly and gets near GMP speeds. – ertes Feb 22 '13 at 15:14
1

It is not tests covered, not very good for me ... – s9gf4ult Feb 22 '13 at 17:32
@s9gf4ult: You will find it more helpful to give constraints in your question, rather than after an answer has been provided. – President James K. Polk Feb 23 '13 at 01:48
It has a rather elaborate 'certification' infrastructure. It might help if you were clearer what you want. – applicative Feb 23 '13 at 07:33

score 2 · Answer 2 · answered Feb 22 '13 at 12:49

2

See primeFactors in primes. It's reasonably fast, for example it factors 104729 * 104723 instantly.

answered Feb 22 '13 at 12:49

Petr

62,528
13
153
317

Note that `104729 * 104723` can be deduced from a simple square root test and some linear probing. A better factorization litmus test would involve primes which are farther apart, but not too close to `1`. Consider `104729 * 88801` – recursion.ninja Jul 10 '14 at 18:25

Integer factiorization function somewhere in Haskell library?

2 Answers2