![]() |
|
go ahead... be a heretic | |
PerlMonks |
Re^3: Algorithm for cancelling common factors between two lists of multiplicandsby jimX11 (Friar) |
on Aug 09, 2005 at 01:07 UTC ( #482082=note: print w/replies, xml ) | Need Help?? |
The original problem, framed in terms of arrays, is to reduce a fraction. The equation above is less general. The less general problem can be restated as reduce a fraction where the numerator and denominator are both the product of factorials. An example of the original problem is to reduce
An example of the factorial problem is to reduce
Do I understand correctly, are you are interested in the factorial type of problem?
In Section
Seekers of Perl Wisdom
|
|