[PEPr] Comment on Math::Euclideans Algorithm for GCFs

Jesus M. Castagnetto (http://pear.php.net/user/jmcastagnetto) has commented on the proposal for Math::Euclideans Algorithm for GCFs. Comment: Hmm, a package with only one function? As there is no explanation on what other Euclidean algorithms will be implemented, if it is just the gcf, I would seriously question the utility of such package. In particular having that the Greatest Common Factor (aka Greatest Common Denominator or Greatest Common Divisor), is already implemented in PHP: http://www.php.net/manual/en/function.gmp-gcd.php Even if we would like to have an implementation that did not depends on GMP, there are algorithms that converge faster, e.g. Knuth's: http://mathforum.org/library/drmath/view/51893.html More info on GCD at: http://mathworld.wolfram.com/GreatestCommonDivisor.html Bottomline: as it stands I see no reason to have this in PEAR. If it were implementing more algorithms in known efficient ways I'll definitely would change my opinion. Proposal information: http://pear.php.net/pepr/pepr-proposal-show.php?id=19 -- Sent by PEPr, the automatic proposal system at http://pear.php.net