in reply to Re^3: Algorithm for cancelling common factors between two lists of multiplicands
in thread Algorithm for cancelling common factors between two lists of multiplicands
Sure. For the following 2x2:
| X | Y | ||
| A | 989 | 9,400 | 10,389 |
| B | 43,300 | 2.400 | 45,700 |
| 44,289 | 11,800 | 56,089 |
The formula comes out to
(44,289! 11,800!) (10,389! 45,700!) ----------------------------------- 56,089! 989! 9,400! 43,300! 11,800! 2,400!
Which infinite precision will calculate, but it will be quite slow. And remember, in order to determine if the result is significant, there are 11,000 more of these calculations to perform and these numbers are still relatively small. And, theoretically at least, the FET can be applied to more than a 2x2 matrix.
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