in reply to Re^9: Algorithm for cancelling common factors between two lists of multiplicands
in thread Algorithm for cancelling common factors between two lists of multiplicands
Hmm 1%1?
C:\ghc\ghc-6.4\code>ghc --make FET.hs -o FET.exe Chasing modules from: FET.hs Compiling FishersExactTest ( ./FishersExactTest.hs, ./FishersExactTest +.o ) Compiling Main ( FET.hs, FET.o ) Linking ... C:\ghc\ghc-6.4\code>FET 989 9400 43400 2400 ^Z 1%1 C:\ghc\ghc-6.4\code>echo 989 9400 43400 2400 | FET 1%1
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