Safe Haskell | Safe-Infered |
---|

A module for finding prime factors.

- module Math.NumberTheory.Prime
- pfactors :: Integer -> [Integer]

# Documentation

module Math.NumberTheory.Prime

pfactors :: Integer -> [Integer]Source

List the prime factors of n (with multiplicity). The algorithm uses trial division to find small factors, followed if necessary by the elliptic curve method to find larger factors. The running time increases with the size of the second largest prime factor of n. It can find 10-digit prime factors in seconds, but can struggle with 20-digit prime factors.