Q: What is finite precision arithmetic?

Write your answer...

Submit

Still have questions?

Continue Learning about Math & Arithmetic

They are sets with a finite number of elements. For example the days of the week, or the 12 months of the year. Modular arithmetic is based on finite sets.

It is a finite number.It is a finite number.It is a finite number.It is a finite number.

There are a finite number of apartments. Finite numbers may be large or small. There are a finite number of states. The number of molds in my fridge is not exactly finite.

Coal is a finite resource on Earth.The finite resources will eventually run out.

I would guess that is because it has a finite number of different states. (It is also known as a finite-state machine.)

Related questions

GNU Multiple Precision Arithmetic Library was created in 1991.

They are sets with a finite number of elements. For example the days of the week, or the 12 months of the year. Modular arithmetic is based on finite sets.

The 'bc' command is a simple binary calculator (hence the name bc). It can do simple math and uses arbitrary precision arithmetic. You can designate the scaling, precision, and other values to use in math calculations. Arbitrary precision arithmetic allows you to exceed the hardware precision of the system you are on, by scaling to any number of significant digits that you may require.

Roger G. Hale has written: 'An investigation into the effects of using limited precision integer arithmetic in digital modems'

There are different guidelines depending on the arithmetic operation being used.

Visual Basic for applications

AnswerWe use BCD in processors that control industrial machines for one.It is also a good tool for arbitrary precision arithmetic; you can represent very long digit sequences that wouldn't fit in native arithmetic containers on computer systems.

Stephen S. Shatz has written: 'Profinite groups, arithmetic, and geometry' -- subject(s): Algebraic number theory, Finite groups, Homology theory

The advantages of integer arithmetic over floating point arithmetic is the absence of rounding errors. Rounding errors are an intrinsic aspect of floating point arithmetic, with the result that two or more floating point values cannot be compared for equality or inequality (or with other relational operators), as the exact same original value may be presented slightly differently by two or more floating point variables. Integer arithmetic does not show this symptom, and allows for simple and reliable comparison of numbers. However, the disadvantage of integer arithmetic is the limited value range. While scaled arithmetic (also known as fixed point arithmetic) allows for integer-based computation with a finite number of decimals, the total value range of a floating point variable is much larger. For example, a signed 32-bit integer variable can take values in the range -231..+231-1 (-2147483648..+2147483647), an IEEE 754 single precision floating point variable covers a value range of +/- 3.4028234 * 1038 in the same 32 bits.

In ordinary arithmetic, the resulting value will be from an infinite set of values but in case modular arithmetic, resulting value will be from a finite set of values.Open in Google Docs ViewerOpen link in new tabOpen link in new windowOpen link in new incognito windowDownload fileCopy link addressEdit PDF File on PDFescape.come.g. in ordinary arithmetic, the sum of two integers, the result will be an integer in the range {..., -3, -2, -1, 0, 1, 2, 3, ...}for modular arithmetic, the sum of two integerslike (a+b)mod n will be in the range {0, 1, 2, ... n-1}

It is a finite number.It is a finite number.It is a finite number.It is a finite number.

prove that every subset of a finite set is a finite set?