Английская Википедия:Floor and ceiling functions

Содержание

Текст

Текст

Текст

Текст

Текст

Текст

Текст

Текст

Текст

In mathematics, the floor function (or greatest integer function) is the function that takes as input a real number Шаблон:Mvar, and gives as output the greatest integer less than or equal to Шаблон:Mvar, denoted Шаблон:Math or Шаблон:Math. Similarly, the ceiling function maps Шаблон:Mvar to the smallest integer greater than or equal to Шаблон:Math, denoted Шаблон:Math or Шаблон:Math.

For example, for floor: Шаблон:Math, Шаблон:Math, and for ceiling: Шаблон:Math, and Шаблон:Math.

Historically, the floor of Шаблон:Mvar has been–and still is–called the integral part or integer part of Шаблон:Mvar, often denoted Шаблон:Math (as well as a variety of other notations). However, the same term, integer part, is also used for truncation towards zero, which differs from the floor function for negative numbers.

For Шаблон:Mvar an integer, Шаблон:Math.

Although Шаблон:Math and Шаблон:Math produce graphs that appear exactly alike, they are not the same when the value of x is an exact integer. For example, when Шаблон:Mvar=2.0001; Шаблон:Math. However, if Шаблон:Mvar=2, then Шаблон:Math, while Шаблон:Math.

Examples

x	Floor Шаблон:Math	Ceiling Шаблон:Math	Fractional part Шаблон:Math
2	2	2	0
2.0001	2	3	0.0001
2.4	2	3	0.4
2.9	2	3	0.9
2.999	2	3	0.999
−2.7	−3	−2	0.3
−2	−2	−2	0

Notation

The integral part or integer part of a number (Шаблон:Lang in the original) was first defined in 1798 by Adrien-Marie Legendre in his proof of the Legendre's formula.

Carl Friedrich Gauss introduced the square bracket notation Шаблон:Math in his third proof of quadratic reciprocity (1808). This remained the standard in mathematics until Kenneth E. Iverson introduced, in his 1962 book A Programming Language, the names "floor" and "ceiling" and the corresponding notations Шаблон:Math and Шаблон:Math. (Iverson used square brackets for a different purpose, the Iverson bracket notation.) Both notations are now used in mathematics, although Iverson's notation will be followed in this article.

In some sources, boldface or double brackets Шаблон:Math are used for floor, and reversed brackets Шаблон:Math or Шаблон:Math for ceiling.

The fractional part is the sawtooth function, denoted by Шаблон:Math for real Шаблон:Mvar and defined by the formula

Шаблон:Math

For all x,

Шаблон:Math.

These characters are provided in Unicode:

• Шаблон:Unichar
• Шаблон:Unichar
• Шаблон:Unichar
• Шаблон:Unichar

In the LaTeX typesetting system, these symbols can be specified with the Шаблон:Mono and Шаблон:Mono commands in math mode, and extended in size using Шаблон:Mono and Шаблон:Mono as needed.

Some authors define Шаблон:Math as the round-toward-zero functionШаблон:Citation needed, so Шаблон:Math and Шаблон:Math, and call it the "integer part".

Definition and properties

Given real numbers x and y, integers m and n and the set of integers <math>\mathbb{Z}</math>, floor and ceiling may be defined by the equations

<math> \lfloor x \rfloor=\max \{m\in\mathbb{Z}\mid m\le x\},</math>

<math> \lceil x \rceil=\min \{n\in\mathbb{Z}\mid n\ge x\}.</math>

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

<math>x-1<m\le x \le n <x+1.</math>

where <math>\lfloor x \rfloor = m</math> and <math>\lceil x \rceil = n</math> may also be taken as the definition of floor and ceiling.

Equivalences

These formulas can be used to simplify expressions involving floors and ceilings.

<math>

\begin{alignat}{3} \lfloor x \rfloor &= m \ \ &&\mbox{ if and only if } &m &\le x < m+1,\\ \lceil x \rceil &= n &&\mbox{ if and only if } &\ \ n -1 &< x \le n,\\

\lfloor x \rfloor &= m &&\mbox{ if and only if } &x-1 &< m \le x,\\ \lceil x \rceil &= n &&\mbox{ if and only if } &x &\le n < x+1. \end{alignat} </math>

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.

<math>

\begin{align} x<n &\;\;\mbox{ if and only if } &\lfloor x \rfloor &< n, \\ n<x &\;\;\mbox{ if and only if } &n &< \lceil x \rceil, \\ x\le n &\;\;\mbox{ if and only if } &\lceil x \rceil &\le n, \\ n\le x &\;\;\mbox{ if and only if } &n &\le \lfloor x \rfloor. \end{align} </math>

These formulas show how adding an integer Шаблон:Mvar to the arguments affects the functions:

<math>

\begin{align} \lfloor x+n \rfloor &= \lfloor x \rfloor+n,\\ \lceil x+n \rceil &= \lceil x \rceil+n,\\ \{ x+n \} &= \{ x \}. \end{align} </math>

The above are never true if Шаблон:Mvar is not an integer; however, for every Шаблон:Mvar and Шаблон:Mvar, the following inequalities hold:

<math>\begin{align}

\lfloor x \rfloor + \lfloor y \rfloor &\leq \lfloor x + y \rfloor \leq \lfloor x \rfloor + \lfloor y \rfloor + 1,\\[3mu] \lceil x \rceil + \lceil y \rceil -1 &\leq \lceil x + y \rceil \leq \lceil x \rceil + \lceil y \rceil. \end{align}</math>

Monotonicity

Both floor and ceiling functions are monotonically non-decreasing functions:

<math>

\begin{align} x_{1} \le x_{2} &\Rightarrow \lfloor x_{1} \rfloor \le \lfloor x_{2} \rfloor, \\ x_{1} \le x_{2} &\Rightarrow \lceil x_{1} \rceil \le \lceil x_{2} \rceil. \end{align} </math>

Relations among the functions

It is clear from the definitions that

<math>\lfloor x \rfloor \le \lceil x \rceil,</math>   with equality if and only if x is an integer, i.e.

<math>\lceil x \rceil - \lfloor x \rfloor = \begin{cases}

0&\mbox{ if } x\in \mathbb{Z}\\ 1&\mbox{ if } x\not\in \mathbb{Z} \end{cases}</math>

In fact, for integers n, both floor and ceiling functions are the identity:

<math>\lfloor n \rfloor = \lceil n \rceil = n.</math>

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

<math> \begin{align}

\lfloor x \rfloor +\lceil -x \rceil &= 0 \\ -\lfloor x \rfloor &= \lceil -x \rceil \\ -\lceil x \rceil &= \lfloor -x \rfloor \end{align} </math>

and:

<math>\lfloor x \rfloor + \lfloor -x \rfloor = \begin{cases}

0&\text{if } x\in \mathbb{Z}\\ -1&\text{if } x\not\in \mathbb{Z}, \end{cases}</math>

<math>\lceil x \rceil + \lceil -x \rceil = \begin{cases}

0&\text{if } x\in \mathbb{Z}\\ 1&\text{if } x\not\in \mathbb{Z}. \end{cases}</math>

Negating the argument complements the fractional part:

<math>\{ x \} + \{ -x \} = \begin{cases}

0&\text{if } x\in \mathbb{Z}\\ 1&\text{if } x\not\in \mathbb{Z}. \end{cases}</math>

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

<math>

\begin{align} \big\lfloor \lfloor x \rfloor \big\rfloor &= \lfloor x \rfloor, \\ \big\lceil \lceil x \rceil \big\rceil &= \lceil x \rceil, \\ \big\{ \{ x \} \big\} &= \{ x \}. \end{align} </math>

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

<math>

\begin{align} \big\lfloor \lceil x \rceil \big\rfloor &= \lceil x \rceil, \\ \big\lceil \lfloor x \rfloor \big\rceil &= \lfloor x \rfloor \end{align} </math> due to the identity property for integers.

Quotients

If m and n are integers and n ≠ 0,

<math>0 \le \left\{ \frac{m}{n} \right\} \le 1-\frac{1}{|n|}.</math>

If n is a positive integer

<math>\left\lfloor\frac{x+m}{n}\right\rfloor = \left\lfloor\frac{\lfloor x\rfloor +m}{n}\right\rfloor,

</math>

<math>\left\lceil\frac{x+m}{n}\right\rceil = \left\lceil\frac{\lceil x\rceil +m}{n}\right\rceil.

</math>

If m is positive

<math>n=\left\lceil\frac{n\vphantom1}{m}\right\rceil + \left\lceil\frac{n-1}{m}\right\rceil +\dots+\left\lceil\frac{n-m+1}{m}\right\rceil,

</math>

<math>n=\left\lfloor\frac{n\vphantom1}{m}\right\rfloor + \left\lfloor\frac{n+1}{m}\right\rfloor +\dots+\left\lfloor\frac{n+m-1}{m}\right\rfloor.

</math>

For m = 2 these imply

<math>n= \left\lfloor \frac{n\vphantom1}{2}\right \rfloor + \left\lceil\frac{n\vphantom1}{2}\right \rceil.</math>

More generally, for positive m (See Hermite's identity)

<math>\lceil mx \rceil =\left\lceil x\right\rceil + \left\lceil x-\frac{1}{m}\right\rceil +\dots+\left\lceil x-\frac{m-1}{m}\right\rceil,

</math>

<math>\lfloor mx \rfloor=\left\lfloor x\right\rfloor + \left\lfloor x+\frac{1}{m}\right\rfloor +\dots+\left\lfloor x+\frac{m-1}{m}\right\rfloor.

</math>

The following can be used to convert floors to ceilings and vice versa (m positive)

<math>\left\lceil \frac{n\vphantom1}{m} \right\rceil = \left\lfloor \frac{n+m-1}{m} \right\rfloor = \left\lfloor \frac{n - 1}{m} \right\rfloor + 1, </math>

<math>\left\lfloor \frac{n\vphantom1}{m} \right\rfloor = \left\lceil \frac{n-m+1}{m} \right\rceil = \left\lceil \frac{n + 1}{m} \right\rceil - 1, </math>

For all m and n strictly positive integers:

<math>\sum_{k = 1}^{n - 1} \left\lfloor \frac{k m}{n} \right\rfloor = \frac{(m - 1)(n - 1)+\gcd(m,n)-1}2,</math>

which, for positive and coprime m and n, reduces to

<math>\sum_{k=1}^{n-1} \left\lfloor \frac{km}{n} \right\rfloor = \tfrac{1}{2}(m - 1)(n - 1) ,</math>

and similarly for the ceiling and fractional part functions (still for positive and coprime m and n),

<math>\sum_{k=1}^{n-1} \left\lceil \frac{km}{n} \right\rceil = \tfrac{1}{2}(m + 1)(n - 1),</math>

<math>\sum_{k=1}^{n-1} \left\{ \frac{km}{n} \right\} = \tfrac{1}{2}(n - 1).</math>

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

<math>\left\lfloor \frac{m\vphantom1}{n} \right \rfloor + \left\lfloor \frac{2m}{n} \right \rfloor + \dots + \left\lfloor \frac{(n-1)m}{n} \right \rfloor =

\left\lfloor \frac{n\vphantom1}{m} \right \rfloor + \left\lfloor \frac{2n}{m} \right \rfloor + \dots + \left\lfloor \frac{(m-1)n}{m} \right \rfloor. </math>

More generally, if m and n are positive,

<math>\begin{align}

&\left\lfloor \frac{x\vphantom1}{n} \right \rfloor + \left\lfloor \frac{m+x}{n} \right \rfloor + \left\lfloor \frac{2m+x}{n} \right \rfloor + \dots + \left\lfloor \frac{(n-1)m+x}{n} \right \rfloor\\[5mu] = &\left\lfloor \frac{x\vphantom1}{m} \right \rfloor + \left\lfloor \frac{n+x}{m} \right \rfloor + \left\lfloor \frac{2n+x}{m} \right \rfloor + \cdots + \left\lfloor \frac{(m-1)n+x}{m} \right \rfloor. \end{align} </math>

This is sometimes called a reciprocity law.

Division by positive integers gives rise to an interesting and sometimes useful property. Assuming <math>m,n >0</math>,

<math> m \leq \left\lfloor \frac{x}{n} \right \rfloor \iff n \leq \left\lfloor \frac{x}{m} \right \rfloor \iff n \leq \frac{ \lfloor x \rfloor }{m}. </math>

Similarly,

<math> m \geq \left\lceil \frac{x}{n} \right \rceil \iff n \geq \left\lceil \frac{x}{m} \right \rceil \iff n \geq \frac{ \lceil x \rceil }{m}. </math>

Indeed,

<math> m \leq \left\lfloor \frac{x}{n} \right \rfloor \implies m \leq \frac{x}{n} \implies n \leq \frac{x}{m}

\implies n \leq \left \lfloor \frac{x}{m}\right \rfloor \implies \ldots \implies m \leq \left\lfloor \frac{x}{n} \right \rfloor,</math> keeping in mind that <math display=inline> \lfloor x/n \rfloor = \bigl\lfloor \lfloor x \rfloor / n \bigr\rfloor.</math> The second equivalence involving the ceiling function can be proved similarly.

Nested divisions

For positive integer n, and arbitrary real numbers m,x:

<math> \left\lfloor \frac{\lfloor x/m\rfloor}{n} \right\rfloor = \left\lfloor \frac{x}{mn} \right\rfloor </math>

<math> \left\lceil \frac{\lceil x/m\rceil}{n} \right\rceil = \left\lceil \frac{x}{mn} \right\rceil. </math>

Continuity and series expansions

None of the functions discussed in this article are continuous, but all are piecewise linear: the functions <math>\lfloor x \rfloor</math>, <math>\lceil x \rceil</math>, and <math>\{ x\}</math> have discontinuities at the integers.

<math>\lfloor x \rfloor</math>  is upper semi-continuous and  <math>\lceil x \rceil</math>  and <math>\{ x\}</math>  are lower semi-continuous.

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. The fractional part function has Fourier series expansion

<math>\{x\}= \frac{1}{2} - \frac{1}{\pi} \sum_{k=1}^\infty

\frac{\sin(2 \pi k x)} {k} </math> for Шаблон:Mvar not an integer.

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 floor(x) = x − {x} gives

<math>\lfloor x\rfloor = x - \frac{1}{2} + \frac{1}{\pi} \sum_{k=1}^\infty \frac{\sin(2 \pi k x)}{k}</math>

for Шаблон:Mvar not an integer.

Applications

Mod operator

For an integer x and a positive integer y, the modulo operation, denoted by x mod y, gives the value of the remainder when x is divided by y. This definition can be extended to real x and y, y ≠ 0, by the formula

<math>x \bmod y = x-y\left\lfloor \frac{x}{y}\right\rfloor.</math>

Then it follows from the definition of floor function that this extended operation satisfies many natural properties. Notably, x mod y is always between 0 and y, i.e.,

if y is positive,

<math>0 \le x \bmod y <y,</math>

and if y is negative,

<math>0 \ge x \bmod y >y.</math>

Quadratic reciprocity

Gauss's third proof of quadratic reciprocity, as modified by Eisenstein, has two basic steps.

Let p and q be distinct positive odd prime numbers, and let <math>m = \tfrac12(p - 1),</math> <math>n = \tfrac12(q - 1).</math>

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

<math>\begin{align}

\left(\frac{q}{p}\right) &= (-1)^{\left\lfloor\frac{q}{p}\right\rfloor + \left\lfloor\frac{2q}{p}\right\rfloor +

  \dots + \left\lfloor\frac{mq}{p}\right\rfloor }, \\[5mu]

\left(\frac{p}{q}\right) &= (-1)^{\left\lfloor\frac{p}{q}\right\rfloor + \left\lfloor\frac{2p}{q}\right\rfloor +

  \dots + \left\lfloor\frac{np}{q}\right\rfloor }.

\end{align}</math>

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

<math>\left\lfloor\frac{q}{p}\right\rfloor +\left\lfloor\frac{2q}{p}\right\rfloor +\dots +\left\lfloor\frac{mq}{p}\right\rfloor

+\left\lfloor\frac{p}{q}\right\rfloor +\left\lfloor\frac{2p}{q}\right\rfloor +\dots +\left\lfloor\frac{np}{q}\right\rfloor

= mn. </math>

Combining these formulas gives quadratic reciprocity in the form

<math>\left(\frac{p}{q}\right) \left(\frac{q}{p}\right) = (-1)^{mn}=(-1)^{\frac{p-1}{2}\frac{q-1}{2}}.</math>

There are formulas that use floor to express the quadratic character of small numbers mod odd primes p:

<math>\begin{align}

\left(\frac{2}{p}\right) &= (-1)^{\left\lfloor\frac{p+1}{4}\right\rfloor}, \\[5mu] \left(\frac{3}{p}\right) &= (-1)^{\left\lfloor\frac{p+1}{6}\right\rfloor}. \end{align}</math>

Rounding

For an arbitrary real number <math>x</math>, rounding <math>x</math> to the nearest integer with tie breaking towards positive infinity is given by <math>\text{rpi}(x)=\left\lfloor x+\tfrac{1}{2}\right\rfloor = \left\lceil \tfrac12\lfloor 2x \rfloor \right\rceil</math>; rounding towards negative infinity is given as <math>\text{rni}(x)=\left\lceil x-\tfrac{1}{2}\right\rceil = \left\lfloor \tfrac12 \lceil 2x \rceil \right\rfloor</math>.

If tie-breaking is away from 0, then the rounding function is <math>\text{ri}(x) = \sgn(x)\left\lfloor|x|+\tfrac{1}{2}\right\rfloor</math> (see sign function), and rounding towards even can be expressed with the more cumbersome <math>\lfloor x\rceil=\left\lfloor x+\tfrac{1}{2}\right\rfloor+\bigl\lceil\tfrac14(2x-1)\bigr\rceil-\bigl\lfloor\tfrac14(2x-1)\bigr\rfloor-1</math>, which is the above expression for rounding towards positive infinity <math>\text{rpi}(x)</math> minus an integrality indicator for <math>\tfrac14(2x-1)</math>.

Rounding a real number <math>x</math> to the nearest integer value forms a very basic type of quantizer – a uniform one. A typical (mid-tread) uniform quantizer with a quantization step size equal to some value <math>\Delta</math> can be expressed as

<math>Q(x) = \Delta \cdot \left\lfloor \frac{x}{\Delta} + \frac{1}{2} \right\rfloor</math>,

Number of digits

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

<math>\lfloor \log_{b}{k} \rfloor + 1 = \lceil \log_{b}{(k+1)} \rceil .</math>

Number of strings without repeated characters

The number of possible strings of arbitrary length that doesn't use any character twice is given byШаблон:Better source needed

<math>(n)_0 + \cdots + (n)_n = \lfloor e n! \rfloor</math>

where:

• Шаблон:Math > 0 is the number of letters in the alphabet (e.g., 26 in English)
• the falling factorial <math>(n)_k = n(n-1)\cdots(n-k+1)</math> denotes the number of strings of length Шаблон:Math that don't use any character twice.
• Шаблон:Math! denotes the factorial of Шаблон:Math
• Шаблон:Math = 2.718... is Euler's number

For Шаблон:Math = 26, this comes out to 1096259850353149530222034277.

Factors of factorials

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 a version of Legendre's formula

<math>\left\lfloor\frac{n}{p}\right\rfloor + \left\lfloor\frac{n}{p^2}\right\rfloor + \left\lfloor\frac{n}{p^3}\right\rfloor + \dots = \frac{n-\sum_{k}a_k}{p-1}</math>

where <math display="inline">n = \sum_{k}a_kp^k</math> is the way of writing n in base p. This is a finite sum, since the floors are zero when p^k > n.

Beatty sequence

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.

Euler's constant (γ)

There are formulas for Euler's constant γ = 0.57721 56649 ... that involve the floor and ceiling, e.g.

<math>\gamma =\int_1^\infty\left({1\over\lfloor x\rfloor}-{1\over x}\right)\,dx,</math>

<math>\gamma = \lim_{n \to \infty} \frac{1}{n} \sum_{k=1}^n \left( \left \lceil \frac{n}{k} \right \rceil - \frac{n}{k} \right),</math>

and

<math>

\gamma = \sum_{k=2}^\infty (-1)^k \frac{ \left \lfloor \log_2 k \right \rfloor}{k}
 = \tfrac12-\tfrac13
 + 2\left(\tfrac14 - \tfrac15 + \tfrac16 - \tfrac17\right)
 + 3\left(\tfrac18 - \cdots - \tfrac1{15}\right) + \cdots

</math>

Riemann zeta function (ζ)

The fractional part function also shows up in integral representations of the Riemann zeta function. It is straightforward to prove (using integration by parts) that if <math>\varphi(x)</math> is any function with a continuous derivative in the closed interval [a, b],

<math>\sum_{a<n\le b}\varphi(n) =

\int_a^b\varphi(x) \, dx + \int_a^b\left(\{x\}-\tfrac12\right)\varphi'(x) \, dx + \left(\{a\}-\tfrac12\right)\varphi(a) - \left(\{b\}-\tfrac12\right)\varphi(b). </math>

Letting <math>\varphi(n) = n^{-s}</math> for real part of s greater than 1 and letting a and b be integers, and letting b approach infinity gives

<math>\zeta(s) = s\int_1^\infty\frac{\frac12-\{x\}}{x^{s+1}}\,dx + \frac{1}{s-1} + \frac 1 2.</math>

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.

For s = σ + it in the critical strip 0 < σ < 1,

<math>\zeta(s)=s\int_{-\infty}^\infty e^{-\sigma\omega}(\lfloor e^\omega\rfloor - e^\omega)e^{-it\omega}\,d\omega.</math>

In 1947 van der Pol used this representation to construct an analogue computer for finding roots of the zeta function.

Formulas for prime numbers

The floor function appears in several formulas characterizing prime numbers. For example, since <math display=inline>\bigl\lfloor\frac{n}{m} \bigr\rfloor -\bigl\lfloor\frac{n-1}{m}\bigr\rfloor</math> is equal to 1 if m divides n, and to 0 otherwise, it follows that a positive integer n is a prime if and only if

<math>\sum_{m=1}^\infty \left(\biggl\lfloor\frac{n}{m}\biggr\rfloor-\biggl\lfloor\frac{n-1}{m}\biggr\rfloor\right) = 2.</math>

One may also give formulas for producing the prime numbers. For example, let p_n be the n-th prime, and for any integer r > 1, define the real number α by the sum

<math>\alpha = \sum_{m=1}^\infty p_m r^{-m^2}.</math>

Then

<math>p_n = \left\lfloor r^{n^2}\alpha \right\rfloor - r^{2n-1}\left\lfloor r^{(n-1)^2}\alpha\right\rfloor.</math>

A similar result is that there is a number θ = 1.3064... (Mills' constant) with the property that

<math>\left\lfloor \theta^3 \right\rfloor, \left\lfloor \theta^9 \right\rfloor, \left\lfloor \theta^{27} \right\rfloor, \dots</math>

are all prime.

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

<math>\left\lfloor 2^\omega\right\rfloor, \left\lfloor 2^{2^\omega} \right\rfloor, \left\lfloor 2^{2^{2^\omega}} \right\rfloor, \dots</math>

are all prime.

Let Шаблон:Pi(x) be the number of primes less than or equal to x. It is a straightforward deduction from Wilson's theorem that

<math>\pi(n) = \sum_{j=2}^n\Biggl\lfloor\frac{(j-1)!+1}{j} - \left\lfloor\frac{(j-1)!}{j}\right\rfloor\Biggr\rfloor.</math>

Also, if n ≥ 2,

<math>\pi(n) = \sum_{j=2}^n \Biggl\lfloor 1\, \bigg/\ {\sum_{k=2}^j\left\lfloor\left\lfloor\frac{j}{k}\right\rfloor\frac{k}{j} \right\rfloor} \Biggr\rfloor.</math>

None of the formulas in this section are of any practical use.

Solved problems

Ramanujan submitted these problems to the Journal of the Indian Mathematical Society.

If n is a positive integer, prove that

1. <math>\left\lfloor\tfrac{n}{3}\right\rfloor + \left\lfloor\tfrac{n+2}{6}\right\rfloor + \left\lfloor\tfrac{n+4}{6}\right\rfloor = \left\lfloor\tfrac{n}{2}\right\rfloor + \left\lfloor\tfrac{n+3}{6}\right\rfloor,</math>
2. <math>\left\lfloor\tfrac12 + \sqrt{n+\tfrac12}\right\rfloor = \left\lfloor\tfrac12 + \sqrt{n+\tfrac14}\right\rfloor,</math>
3. <math>\left\lfloor\sqrt{n}+ \sqrt{n+1}\right\rfloor = \left\lfloor \sqrt{4n+2}\right\rfloor.</math>

Some generalizations to the above floor function identities have been proven.

Unsolved problem

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

Are there any positive integers k ≥ 6 such that

<math>3^k-2^k\Bigl\lfloor \bigl(\tfrac 3 2\bigr)^k \Bigr\rfloor > 2^k-\Bigl\lfloor \bigl(\tfrac 3 2\bigr)^k \Bigr\rfloor -2 \ ?</math>

Mahler has proved there can only be a finite number of such k; none are known.

Computer implementations

Файл:Int function.svg

Int function from floating-point conversion in C

In most programming languages, the simplest method to convert a floating point number to an integer does not do floor or ceiling, but truncation. The reason for this is historical, as the first machines used ones' complement and truncation was simpler to implement (floor is simpler in two's complement). FORTRAN was defined to require this behavior and thus almost all processors implement conversion this way. Some consider this to be an unfortunate historical design decision that has led to bugs handling negative offsets and graphics on the negative side of the origin.Шаблон:Cn

A bit-wise right-shift of a signed integer <math>x</math> by <math>n</math> is the same as <math>\left\lfloor x / 2^n \right\rfloor</math>. Division by a power of 2 is often written as a right-shift, not for optimization as might be assumed, but because the floor of negative results is required. Assuming such shifts are "premature optimization" and replacing them with division can break software.Шаблон:Cn

Many programming languages (including C, C++, C#, Java, PHP, R, and Python) provide standard functions for floor and ceiling, usually called floor and ceil, or less commonly ceiling. The language APL uses ⌊x for floor. The J Programming Language, a follow-on to APL that is designed to use standard keyboard symbols, uses <. for floor and >. for ceiling. ALGOL usesentier for floor.

In Microsoft Excel the funtion INT rounds down rather than toward zero, while FLOOR rounds toward zero, the opposite of what "int" and "floor" do in other languages. Since 2010 FLOOR has been changed to error if the number is negative. The OpenDocument file format, as used by OpenOffice.org, Libreoffice and others, INT and FLOOR both do floor, and FLOOR has a third argument to reproduce Excel's earlier behavior.

See also

• Bracket (mathematics)
• Integer-valued function
• Step function
• Modulo operation

References

• Шаблон:Citation
• Шаблон:Citation
• Шаблон:Citation
• Шаблон:Citation
• Nicholas J. Higham, Handbook of writing for the mathematical sciences, SIAM. Шаблон:ISBN, p. 25
• ISO/IEC. ISO/IEC 9899::1999(E): Programming languages — C (2nd ed), 1999; Section 6.3.1.4, p. 43.
• Шаблон:Citation
• Шаблон:Citation
• Шаблон:Citation
• Шаблон:Citation
• Michael Sullivan. Precalculus, 8th edition, p. 86
• Шаблон:Citation

External links

• Шаблон:Springer
• Š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
• Шаблон:MathWorld
• Шаблон:MathWorld