|
|
|
| Problems? Is your data what you think it is? | |
| PerlMonks |
Re^2: Algorithm for cancelling common factors between two lists of multiplicandsby BrowserUk (Patriarch) |
| on Aug 09, 2005 at 01:25 UTC ( [id://482090]=note: print w/replies, xml ) | Need Help?? |
|
Try it. You'll find that doing combinatorial math with logs of factorials rapidly introduces large errors. For an example see Re^4: Fastest way to calculate hypergeometric distribution probabilities (i.e. BIG factorials)?. That's just one. Once you start adding them together the inaccuracies multiply. Examine what is said, not who speaks -- Silence betokens consent -- Love the truth but pardon error.
Lingua non convalesco, consenesco et abolesco. -- Rule 1 has a caveat! -- Who broke the cabal?
"Science is about questioning the status quo. Questioning authority".
The "good enough" maybe good enough for the now, and perfection maybe unobtainable, but that should not preclude us from striving for perfection, when time, circumstance or desire allow.
In Section
Seekers of Perl Wisdom
|
|
||||||||||||||||||||||