In mathematics and computer science , truncation is limiting the number of digits right of the decimal point .
3-398: Truncation of positive real numbers can be done using the floor function . Given a number x ∈ R + {\displaystyle x\in \mathbb {R} _{+}} to be truncated and n ∈ N 0 {\displaystyle n\in \mathbb {N} _{0}} , the number of elements to be kept behind the decimal point, the truncated value of x
6-464: Is However, for negative numbers truncation does not round in the same direction as the floor function: truncation always rounds toward zero, the floor {\displaystyle \operatorname {floor} } function rounds towards negative infinity. For a given number x ∈ R − {\displaystyle x\in \mathbb {R} _{-}} , the function ceil {\displaystyle \operatorname {ceil} }
9-429: Is used instead With computers, truncation can occur when a decimal number is typecast as an integer ; it is truncated to zero decimal digits because integers cannot store non-integer real numbers . An analogue of truncation can be applied to polynomials . In this case, the truncation of a polynomial P to degree n can be defined as the sum of all terms of P of degree n or less. Polynomial truncations arise in
#145854