|
|
|
| Perl Monk, Perl Meditation | |
| PerlMonks |
Re^2: Algorithm for cancelling common factors between two lists of multiplicandsby BrowserUk (Patriarch) |
| on Aug 09, 2005 at 13:41 UTC ( [id://482209]=note: print w/replies, xml ) | Need Help?? |
|
There's big and big. Factoring values of a few thousand or even a thousand million isn't so hard. Cryptography uses numbers much, much bigger than these. 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
|
|
||||||||||||||||||||||