in reply to Re^4: Algorithm for cancelling common factors between two lists of multiplicands
in thread Algorithm for cancelling common factors between two lists of multiplicands

BrowserUk,
Once you have a division math problem of factorials that has been reduced by some factoring method (GCD or prime), it can be reduced even further by substraction. 
47! * 1091!
-----------
55! * 1001!

(1002 .. 1091)
--------------
(48   .. 55)

[download]
This is only a savings when the factorial is being calculated by multiplying all the terms and not by some other approximation method.

Cheers - L~R

  • Comment on Re^5: Algorithm for cancelling common factors between two lists of multiplicands
  • Download Code

In Section Seekers of Perl Wisdom