"Steve Holden" <sholden@holdenweb.com> writes: > Next someone will suggest that we store rationals as a sequence of > coefficients of the prime factors. This would make primes really easy to > recognise (since they'd be a sequence of zeros followed by a one with a > single one as denominator). It would make the gcd really fast too, even for extremely large numbers. :-) -- Christopher A. Craig <list-python@ccraig.org> "It's the one thing I understand, I guess." Bill Gates, about BASIC
RetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4