Math::Factoring - Math::Factoring - Advanced Factoring Algorithms
use Math::Factoring; my $n = 42; my @factors = factor(42); # 2 3 7
Jonathan "Duke" Leto,
<jonathan at leto.net>
Please report any bugs or feature requests to
bug-math-factoring at rt.cpan.org, or through the web interface at http://rt.cpan.org/NoAuth/ReportBug.html?Queue=Math::Factoring. I will be notified, and then you'll automatically be notified of progress on your bug as I make changes.
You can also submit patches or file a Github issue: https://github.com/leto/Math-Factoring
You can find documentation for this module with the perldoc command.
You can also look for information at:
Copyright 2009-2012 Jonathan "Duke" Leto, all rights reserved.
This program is free software; you can redistribute it and/or modify it under the same terms as Perl itself.
Returns the prime factors of $number as an array. Currently this falls back to trial division. The values in the array are plain Perl string variables, not Math::GMPz objects.
Return the factors of $number as an array using the Pollard-Rho algorithm.
Jonathan "Duke" Leto <firstname.lastname@example.org>
This software is copyright (c) 2012 by Leto Labs LLC.
This is free software; you can redistribute it and/or modify it under the same terms as the Perl 5 programming language system itself.