How Limited-Bit Fractions Are Stored
With a limited number of bits, a computer can only store a fixed set of values along the number line — these are called approximations — not every possible fraction. When an input doesn't match one exactly, it's rounded to the nearest approximation, and the difference between the two is called rounding error.
With fewer approximations available, is rounding error usually larger?