Care to try and explain that?
Maybe Fisher's Exact Test will elucidate the matter.
the lowliest monk
In reply to Re^5: Algorithm for cancelling common factors between two lists of multiplicands
by tlm
in thread Algorithm for cancelling common factors between two lists of multiplicands
by BrowserUk
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |