https://github.com/schernykh/factorization
Fast factorization of numbers less than 2^64
https://github.com/schernykh/factorization
division-free factorization
Last synced: about 1 year ago
JSON representation
Fast factorization of numbers less than 2^64
- Host: GitHub
- URL: https://github.com/schernykh/factorization
- Owner: SChernykh
- Created: 2017-04-03T08:53:57.000Z (about 9 years ago)
- Default Branch: master
- Last Pushed: 2017-04-03T08:54:05.000Z (about 9 years ago)
- Last Synced: 2025-02-13T06:18:31.545Z (about 1 year ago)
- Topics: division-free, factorization
- Language: C++
- Size: 62.5 KB
- Stars: 3
- Watchers: 2
- Forks: 1
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# Factorization
Fast factorization of numbers less than 2^64. It does trial divisions up to fourth root of N and then 1 or 2 Pollard-Brent calls to get the remaining factors.
All integer divisions are replaced with multiplications by reciprocals, both for trial division step and Pollard-Brent step.
Some performance data: ~296,000 factorizations per second on a single core of Core i7-4770K for numbers around ~10^15