From Wikipedia, the free encyclopedia - View original article

For other uses, see Floor (disambiguation) and Ceiling (disambiguation).

In mathematics and computer science, the **floor** and **ceiling** functions map a real number to the largest previous or the smallest following integer, respectively. More precisely, floor(*x*) = is the largest integer not greater than *x* and ceiling(*x*) = is the smallest integer not less than *x*.^{[1]}

Carl Friedrich Gauss introduced the square bracket notation for the floor function in his third proof of quadratic reciprocity (1808).^{[2]} This remained the standard^{[3]} in mathematics until Kenneth E. Iverson introduced the names "floor" and "ceiling" and the corresponding notations and in his 1962 book *A Programming Language*.^{[4]}^{[5]} Both notations are now used in mathematics;^{[6]} this article follows Iverson.

The floor function is also called the **greatest integer** or **entier** (French for "integer") function, and its value at *x* is called the **integral part** or **integer part** of *x*; for negative values of *x* the latter terms are sometimes instead taken to be the value of the *ceiling* function, i.e., the value of *x* rounded to an integer towards 0. The language APL uses `⌊x`

; other computer languages commonly use notations like `entier(x)`

(Algol), `INT(x)`

(BASIC), or `floor(x)`

(C, C++, R, and Python).^{[7]} In mathematics, it can also be written with boldface or double brackets .^{[8]}

The ceiling function is usually denoted by `ceil(x)`

or `ceiling(x)`

in non-APL computer languages that have a notation for this function. The J Programming Language, a follow on to APL that is designed to use standard keyboard symbols, uses `>.`

for ceiling and `<.`

for floor.^{[9]} In mathematics, there is another notation with reversed boldface or double brackets or just using normal reversed brackets ]*x*[.^{[10]}

The **fractional part** sawtooth function, denoted by for real *x*, is defined by the formula^{[11]}

For all *x*,

Sample value x | Floor | Ceiling | Fractional part |
---|---|---|---|

12/5 = 2.4 | 2 | 3 | 2/5 = 0.4 |

2.7 | 2 | 3 | 0.7 |

−2.7 | −3 | −2 | 0.3 |

−2 | −2 | −2 | 0 |

The floor and ceiling function are usually typeset with left and right square brackets where the upper (for floor function) or lower (for ceiling function) horizontal bars are missing, and, e.g., in the LaTeX typesetting system these symbols can be specified with the \lfloor, \rfloor, \lceil and \rceil commands in math mode. HTML 4.0 uses the same names: *⌊*, *⌋*, *⌈*, and *⌉*. Unicode contains codepoints for these symbols at `U+2308`

–`U+230B`

: ⌈*x*⌉, ⌊*x*⌋.

In the following formulas, *x* and *y* are real numbers, *k*, *m*, and *n* are integers, and is the set of integers (positive, negative, and zero).

Floor and ceiling may be defined by the set equations

Since there is exactly one integer in a half-open interval of length one, for any real *x* there are unique integers *m* and *n* satisfying

Then and may also be taken as the definition of floor and ceiling.

These formulas can be used to simplify expressions involving floors and ceilings.^{[12]}

**Failed to parse(unknown function '\begin'): {\begin{aligned}\lfloor x\rfloor =m&\;\;{\mbox{ if and only if }}&m&\leq x<m+1,\\\lceil x\rceil =n&\;\;{\mbox{ if and only if }}&n-1&<x\leq n,\\\lfloor x\rfloor =m&\;\;{\mbox{ if and only if }}&x-1&<m\leq x,\\\lceil x\rceil =n&\;\;{\mbox{ if and only if }}&x&\leq n<x+1.\end{aligned}}**

In the language of order theory, the floor function is a residuated mapping, that is, part of a Galois connection: it is the upper adjoint of the function that embeds the integers into the reals.

**Failed to parse(unknown function '\begin'): {\begin{aligned}x<n&\;\;{\mbox{ if and only if }}&\lfloor x\rfloor &<n,\\n<x&\;\;{\mbox{ if and only if }}&n&<\lceil x\rceil ,\\x\leq n&\;\;{\mbox{ if and only if }}&\lceil x\rceil &\leq n,\\n\leq x&\;\;{\mbox{ if and only if }}&n&\leq \lfloor x\rfloor .\end{aligned}}**

These formulas show how adding integers to the arguments affect the functions:

**Failed to parse(unknown function '\begin'): {\begin{aligned}\lfloor x+n\rfloor &=\lfloor x\rfloor +n,\\\lceil x+n\rceil &=\lceil x\rceil +n,\\\{x+n\}&=\{x\}.\end{aligned}}**

The above are not necessarily true if *n* is not an integer; however:

**Failed to parse(unknown function '\begin'): {\begin{aligned}&\lfloor x\rfloor +\lfloor y\rfloor &\leq \;\lfloor x+y\rfloor \;&\leq \;\lfloor x\rfloor +\lfloor y\rfloor +1,\\&\lceil x\rceil +\lceil y\rceil -1&\leq \;\lceil x+y\rceil \;&\leq \;\lceil x\rceil +\lceil y\rceil .\end{aligned}}**

It is clear from the definitions that

- with equality if and only if
*x*is an integer, i.e.

In fact, since for integers *n*:

Negating the argument switches floor and ceiling and changes the sign:

and:

Negating the argument complements the fractional part:

The floor, ceiling, and fractional part functions are idempotent:

The result of nested floor or ceiling functions is the innermost function:

For fixed *y*, *x* mod *y* is idempotent:

Also, from the definitions,

If *m* and *n* are integers and *n* ≠ 0,

If *n* is positive^{[13]}

If *m* is positive^{[14]}

For *m* = 2 these imply

More generally,^{[15]} for positive *m* (See Hermite's identity)

The following can be used to convert floors to ceilings and vice-versa (*m* positive)^{[16]}

If *m* and *n* are positive and coprime, then

Since the right-hand side is symmetrical in *m* and *n*, this implies that

More generally, if *m* and *n* are positive,

This is sometimes called a reciprocity law.^{[17]}

For positive integers *m*,*n*, and arbitrary real number *x*:

None of the functions discussed in this article are continuous, but all are piecewise linear. and are piecewise constant functions, with discontinuites at the integers. also has discontinuites at the integers, and as a function of *x* for fixed *y* is discontinuous at multiples of *y*.

is upper semi-continuous and and are lower semi-continuous. *x* mod *y* is lower semicontinuous for positive *y* and upper semi-continuous for negative *y*.

Since none of the functions discussed in this article are continuous, none of them have a power series expansion. Since floor and ceiling are not periodic, they do not have uniformly convergent Fourier series expansions.

*x* mod *y* for fixed *y* has the Fourier series expansion^{[18]}

in particular {*x*} = *x* mod 1 is given by

At points of discontinuity, a Fourier series converges to a value that is the average of its limits on the left and the right, unlike the floor, ceiling and fractional part functions: for *y* fixed and *x* a multiple of *y* the Fourier series given converges to *y*/2, rather than to *x* mod *y* = 0. At points of continuity the series converges to the true value.

Using the formula {x} = x − floor(x), floor(x) = x − {x} gives

The **mod operator**, denoted by *x* mod *y* for real *x* and *y*, *y* ≠ 0, can be defined by the formula

*x* mod *y* is always between 0 and *y*; i.e.

if *y* is positive,

and if *y* is negative,

If *x* is an integer and *y* is a positive integer,

*x* mod *y* for a fixed *y* is a **sawtooth function**.

Gauss's third proof of quadratic reciprocity, as modified by Eisenstein, has two basic steps.^{[19]}^{[20]}

Let *p* and *q* be distinct positive odd prime numbers, and let

First, Gauss's lemma is used to show that the Legendre symbols are given by

and

The second step is to use a geometric argument to show that

Combining these formulas gives quadratic reciprocity in the form

There are formulas that use floor to express the quadratic character of small numbers mod odd primes *p*:^{[21]}

The ordinary rounding of the positive number *x* to the nearest integer can be expressed as The ordinary rounding of the negative number *x* to the nearest integer can be expressed as

The truncation of a nonnegative number is given by The truncation of a nonpositive number is given by .

The truncation of any real number can be given by: , where sgn(x) is the sign function.

The number of digits in base *b* of a positive integer *k* is

with the right side of the equation also holding true for .

Let *n* be a positive integer and *p* a positive prime number. The exponent of the highest power of *p* that divides *n*! is given by the formula^{[22]}

where is the way of writing *n* in base *p*. Note that this is a finite sum, since the floors are zero when *p*^{k} > *n*.

The Beatty sequence shows how every positive irrational number gives rise to a partition of the natural numbers into two sequences via the floor function.^{[23]}

There are formulas for Euler's constant γ = 0.57721 56649 ... that involve the floor and ceiling, e.g.^{[24]}

and

The fractional part function also shows up in integral representations of the Riemann zeta function. It is straightforward to prove (using integration by parts)^{[25]} that if φ(*x*) is any function with a continuous derivative in the closed interval [*a*, *b*],

Letting φ(*n*) = *n*^{−s} for real part of *s* greater than 1 and letting *a* and *b* be integers, and letting *b* approach infinity gives

This formula is valid for all *s* with real part greater than −1, (except *s* = 1, where there is a pole) and combined with the Fourier expansion for {*x*} can be used to extend the zeta function to the entire complex plane and to prove its functional equation.^{[26]}

For *s* = σ + *i t* in the critical strip (i.e. 0 < σ < 1),

In 1947 van der Pol used this representation to construct an analogue computer for finding roots of the zeta function.^{[27]}

*n* is a prime if and only if^{[28]}

Let *r* > 1 be an integer, *p*_{n} be the *n*^{th} prime, and define

Then^{[29]}

There is a number θ = 1.3064... (Mills' constant) with the property that

are all prime.^{[30]}

There is also a number ω = 1.9287800... with the property that

are all prime.^{[30]}

π(*x*) is the number of primes less than or equal to *x*. It is a straightforward deduction from Wilson's theorem that^{[31]}

Also, if *n* ≥ 2,^{[32]}

None of the formulas in this section is of any practical use.^{[33]}^{[34]}

Ramanujan submitted this problem to the *Journal of the Indian Mathematical Society*.^{[35]}

If *n* is a positive integer, prove that

(i)

(ii)

(iii)

The study of Waring's problem has led to an unsolved problem:

Are there any positive integers *k*, *k* ≥ 6, such that^{[36]}

Mahler^{[37]} has proved there can only be a finite number of such *k*; none are known.

Many programming languages (including C, C++,^{[38]}^{[39]} PHP,^{[40]}^{[41]} and Python^{[42]}) provide standard functions for floor and ceiling.

This article needs additional citations for verification. (August 2008) |

Most spreadsheet programs support some form of a `ceiling`

function. Although the details differ between programs, most implementations support a second parameter—a multiple of which the given number is to be rounded to. For example, `ceiling(2, 3)`

rounds 2 up to the nearest multiple of 3, giving 3. The definition of what "round up" means, however, differs from program to program.

Until Excel 2010, Microsoft Excel's `ceiling`

function was incorrect for negative arguments; ceiling(-4.5) was -5. . This has followed through to the Office Open XML file format. The correct ceiling function can be implemented using "`-INT(-`

". Excel 2010 now follows the standard definition.*value*)^{[43]}

The OpenDocument file format, as used by OpenOffice.org and others, follows the mathematical definition of ceiling for its `ceiling`

function, with an optional parameter for Excel compatibility. For example, `CEILING(-4.5)`

returns −4.

- Nearest integer function
- Truncation, a similar function
- Step function

**^**Graham, Knuth, & Patashnik, Ch. 3.1**^**Lemmermeyer, pp. 10, 23.**^**e.g. Cassels, Hardy & Wright, and Ribenboim use Gauss's notation, Graham, Knuth & Patashnik, and Crandall & Pomerance use Iverson's.**^**Iverson, p. 12.**^**Higham, p. 25.**^**See the Wolfram MathWorld article.**^**Sullivan, p. 86.**^**Mathwords: Floor Function.**^**"Vocabulary".*J Language*. Retrieved 6 September 2011.**^**Mathwords: Ceiling Function**^**Graham, Knuth, & Patashnik, p. 70.**^**Graham, Knuth, & Patashink, Ch. 3**^**Graham, Knuth, & Patashnik, p. 73**^**Graham, Knuth, & Patashnik, p. 85**^**Graham, Knuth, & Patashnik, p. 85 and Ex. 3.15**^**Graham, Knuth, & Patashnik, Ex. 3.12**^**Graham, Knuth, & Patashnik, p. 94**^**Titchmarsh, p. 15, Eq. 2.1.7**^**Lemmermeyer, § 1.4, Ex. 1.32–1.33**^**Hardy & Wright, §§ 6.11–6.13**^**Lemmermeyer, p. 25**^**Hardy & Wright, Th. 416**^**Graham, Knuth, & Patashnik, pp. 77–78**^**These formulas are from the Wikipedia article Euler's constant, which has many more.**^**Titchmarsh, p. 13**^**Titchmarsh, pp.14–15**^**Crandall & Pomerance, p. 391**^**Crandall & Pomerance, Ex. 1.3, p. 46**^**Hardy & Wright, § 22.3- ^
^{a}^{b}Ribenboim, p. 186 **^**Ribenboim, p. 181**^**Crandall & Pomerance, Ex. 1.4, p. 46**^**Ribenboim, p.180 says that "Despite the nil practical value of the formulas ... [they] may have some relevance to logicians who wish to understand clearly how various parts of arithmetic may be deduced from different axiomatzations ... "**^**Hardy & Wright, pp.344—345 "Any one of these formulas (or any similar one) would attain a different status if the exact value of the number α ... could be expressed independently of the primes. There seems no likelihood of this, but it cannot be ruled out as entirely impossible."**^**Ramanujan, Question 723,*Papers*p. 332**^**Hardy & Wright, p. 337**^**Mahler, K.*On the fractional parts of the powers of a rational number II*, 1957, Mathematika,**4**, pages 122-124**^**"C++ reference of`floor`

function". Retrieved 5 December 2010.**^**"C++ reference of`ceil`

function". Retrieved 5 December 2010.**^**"PHP manual for`ceil`

function". Retrieved 18 July 2013.**^**"PHP manual for`floor`

function". Retrieved 18 July 2013.**^**"Python manual for`math`

module". Retrieved 18 July 2013.**^**But the online help provided in 2010 does not reflect this behavior.

- J.W.S. Cassels (1957),
*An introduction to Diophantine approximation*, Cambridge Tracts in Mathematics and Mathematical Physics**45**, Cambridge University Press - Crandall, Richard; Pomerance, Carl (2001),
*Prime Numbers: A Computational Perspective*, New York: Springer, ISBN 0-387-94777-9 - Graham, Ronald L.; Knuth, Donald E.; Patashnik, Oren (1994),
*Concrete Mathematics*, Reading Ma.: Addison-Wesley, ISBN 0-201-55802-5 - Hardy, G. H.; Wright, E. M. (1980),
*An Introduction to the Theory of Numbers (Fifth edition)*, Oxford: Oxford University Press, ISBN 978-0-19-853171-5 - Nicholas J. Higham,
*Handbook of writing for the mathematical sciences*, SIAM. ISBN 0-89871-420-6, p. 25 - ISO/IEC.
*ISO/IEC 9899::1999(E): Programming languages — C*(2nd ed), 1999; Section 6.3.1.4, p. 43. - Iverson, Kenneth E. (1962),
*A Programming Language*, Wiley - Lemmermeyer, Franz (2000),
*Reciprocity Laws: from Euler to Eisenstein*, Berlin: Springer, ISBN 3-540-66957-4 - Ramanujan, Srinivasa (2000),
*Collected Papers*, Providence RI: AMS / Chelsea, ISBN 978-0-8218-2076-6 - Ribenboim, Paulo (1996),
*The New Book of Prime Number Records*, New York: Springer, ISBN 0-387-94457-5 - Michael Sullivan.
*Precalculus*, 8th edition, p. 86 - Titchmarsh, Edward Charles; Heath-Brown, David Rodney ("Roger") (1986),
*The Theory of the Riemann Zeta-function*(2nd ed.), Oxford: Oxford U. P., ISBN 0-19-853369-1

Wikimedia Commons has media related to .Floor and ceiling functions |

- Hazewinkel, Michiel, ed. (2001), "Floor function",
*Encyclopedia of Mathematics*, Springer, ISBN 978-1-55608-010-4 - Štefan Porubský, "Integer rounding functions",
*Interactive Information Portal for Algorithmic Mathematics*, Institute of Computer Science of the Czech Academy of Sciences, Prague, Czech Republic, retrieved 24 October 2008 - Weisstein, Eric W., "Floor Function",
*MathWorld*. - Weisstein, Eric W., "Ceiling Function",
*MathWorld*.