Beefy Boxes and Bandwidth Generously Provided by pair Networks
Perl: the Markov chain saw
 
PerlMonks  

Re^5: Algorithm for cancelling common factors between two lists of multiplicands

by Limbic~Region (Chancellor)
on Aug 10, 2005 at 15:30 UTC ( #482624=note: print w/replies, xml ) Need Help??


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)
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

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://482624]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others surveying the Monastery: (7)
As of 2019-10-23 20:41 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    Notices?