The integer factoriser checks for the factors of an integer, and returns a list of factors while providing transcript of successful factor discoveries.
Use version 0.4 for quick access through a console, or use version 0.3 for direct access through an IDE.
If version 0.4 hangs on the console, use version 0.4b which removes an infinite loop that repeatedly calls 'factorise' to factorise many integers in the same console session.
Author: Ryan Fung
Created: 2013-10-18
Last Modified: 2013-12-14
Latest Versions: 0.4a , 0.4b
It checks prime factors up to the square root, while timing the operation and pausing to prevent processing overload on the CPU. Works by checking directly prime factors from 2 to 29, then checks factors in batches of 30.
None
- Initial release - basic factoriser function defined
- Implemented factorisation process duration, allows aborts after interval time
- Modified process duration check, allows user to change duration before next abort prompt
- Deprecated f(n) as shorthand
- Added code to allow factoriser function to run immediately following loading on a console
- Added validation code to modularise functional code
- Modified code to run once