Path: ...!eternal-september.org!feeder3.eternal-september.org!news.eternal-september.org!eternal-september.org!.POSTED!not-for-mail From: Lawrence D'Oliveiro Newsgroups: alt.folklore.computers,comp.os.linux.misc Subject: Re: evolution of bytes, The joy of FORTRAN Date: Mon, 3 Mar 2025 23:41:46 -0000 (UTC) Organization: A noiseless patient Spider Lines: 13 Message-ID: References: <175819294.762482901.217276.peter_flass-yahoo.com@news.eternal-september.org> <1675186097.762702067.383557.peter_flass-yahoo.com@news.eternal-september.org> MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit Injection-Date: Tue, 04 Mar 2025 00:41:46 +0100 (CET) Injection-Info: dont-email.me; posting-host="83dcacc84fb0cb4992fb8d775ffb25d6"; logging-data="1609424"; mail-complaints-to="abuse@eternal-september.org"; posting-account="U2FsdGVkX18D09YiBuiDbh4iYYAQCko0" User-Agent: Pan/0.162 (Pokrosvk) Cancel-Lock: sha1:rFH/VuHwAtXQ1Sb0XzRFkyC1BEc= Bytes: 1983 On Mon, 3 Mar 2025 06:54:31 -0700, Peter Flass wrote: > Some fractions that are exact in decimal are only approximate in binary. Base-ten has two prime divisors: 2 and 5. Base-two has only 2. So any fraction that has a denominator that is the product of any integer powers of those divisors can be represented exactly, while others cannot. The need to represent 1/3 exactly is also quite common. That’s why I think the smallest place-system base that can cope with a reasonable range of fractions is 30 -- it has 2, 3 and 5 as prime divisors, and so can cope with fraction denominators made up arbitrary products and integer powers of all of those.