Steve Holden wrote:
[me about normalization]
> 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).
This makes of course pretty much sense if the only
operations you want are multiplication/division
which becomes very very cheap, while addition becomes
unaffordably expensive :-)
> but-it-might-slow-down-other-operations-a-bit-ly y'rs - steve
will-not-suggest-it--tried-all-of-these-decades-ago - chris
--
Christian Tismer :^) <mailto:tismer@tismer.com>
Mission Impossible 5oftware : Have a break! Take a ride on Python's
Johannes-Niemeyer-Weg 9a : *Starship* http://starship.python.net/
14109 Berlin : PGP key -> http://wwwkeys.pgp.net/
work +49 30 89 09 53 34 home +49 30 802 86 56 pager +49 173 24 18 776
PGP 0x57F3BF04 9064 F4E1 D754 C2FF 1619 305B C09C 5A3B 57F3 BF04
whom do you want to sponsor today? http://www.stackless.com/
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