Abstract
A positive integer n is represented in the binary, or base 2, system by writing
where each coefficient in the sum, or binary digit, or bit, b i is either 0 or 1. The representation given by (1.1.1) would require a minimum of k + 1 bits for its storage. That is, the wordlength must be at least k + 1.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Copyright information
© 1994 Macmillan Publishers Limited
About this chapter
Cite this chapter
Turner, P.R. (1994). Number Representation, Arithmetic and Errors. In: Numerical Analysis. Macmillan College Work Out Series. Palgrave, London. https://doi.org/10.1007/978-1-349-13108-2_1
Download citation
DOI: https://doi.org/10.1007/978-1-349-13108-2_1
Publisher Name: Palgrave, London
Print ISBN: 978-0-333-58665-5
Online ISBN: 978-1-349-13108-2
eBook Packages: EngineeringEngineering (R0)