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

Replies are listed 'Best First'.
Re^4: Algorithm for cancelling common factors between two lists of multiplicands by BrowserUk (Patriarch) on Aug 10, 2005 at 14:34 UTC
Of course our results will match in those rare cases in which the FET sum happens to contain only one term. Care to try and explain that? 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.	[reply] [d/l]
Re^5: Algorithm for cancelling common factors between two lists of multiplicands by tlm (Prior) on Aug 11, 2005 at 13:24 UTC
Care to try and explain that? Maybe Fisher's Exact Test will elucidate the matter. the lowliest monk	[reply]
Re^6: Algorithm for cancelling common factors between two lists of multiplicands by BrowserUk (Patriarch) on Aug 11, 2005 at 15:54 UTC
Much nicer. Falling over to using the approximation only when needed makes a lot of sense. BTW: You have a couple of artifacts left from the earlier caching scheme `my $max_arr; my @ln_fact; ... BEGIN { $max_arr = 10000; $#ln_fact = $max_arr - 1;` [download] 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.	[reply] [d/l]
Re^7: Algorithm for cancelling common factors between two lists of multiplicands by tlm (Prior) on Aug 11, 2005 at 17:32 UTC


Clear questions and runnable code get the best and fastest answer
	PerlMonks