Floor and Ceiling Function

Floor and ceiling functions
From Wikipedia, the free encyclopedia
For other uses, see Floor (disambiguation) and Ceiling (disambiguation).

Floor and ceiling functions
Floor function
Ceiling function
In mathematics and computer science, the floor and ceiling functions map a real number to the
largest previous or the smallest followinginteger, respectively. More precisely, floor(x) =
is the
largest integer not greater than x and ceiling(x) =
[1]
is the smallest integer not less than x.
Contents
[hide]
1 Notation
o
1.1 Examples
1.2 Typesetting
2 Definition and properties

o
2.1 Equivalences
2.2 Relations among the functions
2.3 Quotients
2.4 Nested divisions
2.5 Continuity
2.6 Series expansions
3 Applications
o
3.1 Mod operator
3.2 Quadratic reciprocity
3.3 Rounding
3.4 Truncation
3.5 Number of digits
3.6 Factors of factorials
3.7 Beatty sequence
3.8 Euler's constant ()
3.9 Riemann function ()
3.10 Formulas for prime numbers
3.11 Solved problem
3.12 Unsolved problem
4 Computer implementations
4.1 Spreadsheet software
5 See also
6 Notes
7 References
8 External links
Notation[edit]
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
his 1962 book A Programming Language.
[4][5]
and
in
Both notations are now used in mathematics; this

[6]
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,
Examples[edit]
Sample value x
Floor
Ceiling
Fractional part
12/5 = 2.4
2/5 = 0.4
2.9
0.9
2.7
0.3
Typesetting[edit]
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:&lfloor;, &rfloor;, &lceil;, and &rceil;. Unicode contains codepoints for these symbols
at U+2308 U+230B : x, x.
Definition and properties[edit]

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.
Equivalences[edit]
These formulas can be used to simplify expressions involving floors and
ceilings.[12]
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.
These formulas show how adding integers to the arguments affect the
functions:
The above are not necessarily true if n is not an integer; however:
Relations among the functions[edit]

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,
Quotients[edit
]
If m and n are
integers and n
0,
If n is
positive[13]
If m i
s
positi
ve[14]
Fo
r
m
=
2
th
es
e
im
ply
More
genera
lly,[15] fo
r
positiv
e m (S
ee Her
mite's
identity
)
The following
can be used to
convert floors
to ceilings and
vice-versa
(m positive)[16]
If m and n are p
and coprime, the
Since the right-h
symmetrical in m
this implies that
More generally,
positive,
This is sometime
a reciprocity law
Nested divis
For positive inte
arbitrary real nu
Continuity[ed
None of the func
article are contin

linear.
and
functions, with d
integers.
al
integers, and
of x for fixed y is
of y.
is upper se
and
are lo
continuous. x m
semicontinuous
semi-continuous
Series expan
Since none of th
this article are c
have a power se
and ceiling are n
have uniformly c
series expansion
x mod y for fixed

expansion[18]
in particular {x} =
At points of disc
to a value that is
and the right, un
part functions: fo
Fourier series gi
to x mod y = 0. A
converges to the
Using the formu

gives
Application

Floor and Ceiling Function

Uploaded by

Copyright:

Available Formats

Floor and Ceiling Function

Uploaded by

Document Information

Original Description:

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Floor and Ceiling Function

Uploaded by

Copyright:

Available Formats

Floor and ceiling functions

From Wikipedia, the free encyclopedia

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

largest integer not greater than x and ceiling(x) =

is the smallest integer not less than x.

2 Definition and properties

2.2 Relations among the functions

2.4 Nested divisions

2.6 Series expansions

3.1 Mod operator

3.2 Quadratic reciprocity

3.5 Number of digits

3.6 Factors of factorials

3.7 Beatty sequence

3.8 Euler's constant ()

3.9 Riemann function ()

3.10 Formulas for prime numbers

3.11 Solved problem

3.12 Unsolved problem

for the floor function in his third

Both notations are now used in mathematics; this

article follows Iverson.

The ceiling function is usually denoted by ceil(x) or ceiling(x) in non-APL computer

normal reversed brackets ]x[.[10]

for real x, is defined by the formula[11]

Definition and properties[edit]

set of integers (positive, negative, and zero).

may also be taken as the definition of floor

In the language of order theory, the floor function is a residuated mapping,

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

Relations among the functions[edit]

In fact, since for integers n:

Negating the argument switches floor and ceiling

Negating the argument complements

The floor, ceiling, and fractional

The result of nested floor or

For fixed y, x mod y is

Also, from the

and coprime, the

Since the right-h

For positive inte

None of the func

article are contin

this article are c

and ceiling are n

x mod y for fixed

and the right, un

Using the formu

You might also like

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.