How this instrument works
The ceiling of a number is the smallest integer that is not smaller than it, written ⌈x⌉ — a bracket with a flat top, borrowed from the floor bracket ⌊x⌋ turned upside down. Kenneth Iverson introduced both symbols in 1962 for the programming language APL, and the notation steadily replaced clumsier phrasings such as 'the least integer not less than x' once mathematicians outside computing adopted it decades later.
This is not rounding to the nearest whole number; the output only ever moves upward, or stays put when the input is already an integer. 4.001 climbs all the way to 5, the same landing spot as 4.9, because ordinary rounding weighs distance while this rule weighs only whether a whole number sits at or above the input. An exact integer, like 5 itself, is left untouched — it is already its own answer.
Plotted on a line the result is a staircase: flat across every interval running from one integer (exclusive) up to the next (inclusive), then an instant rise of exactly 1 the moment the input crosses past a whole number. That makes the function continuous from the left and discontinuous from the right at every integer — the mirror of the floor function, whose flat stretches run the other way and which jumps precisely at the integer instead of just past it. One identity ties the pair together: ⌈x⌉ = −⌊−x⌋, flip the sign, floor it, flip again, and the answer is unchanged.
- Enter any real number — positive, negative, a decimal, or a whole number — into the Number field.
- Read Ceiling: it reports the smallest integer greater than or equal to your entry.
- Try a value just above a whole number, such as 4.001, and watch the result jump to the next integer instead of staying close by.
- Enter a negative decimal, such as −4.2, and confirm the result moves toward zero rather than away from it.
Worked example — 4.2 rounded up
Set Number to 4.2 and read Ceiling: it returns 5. The figure 4.2 sits inside the range running from 4 (exclusive) up to 5 (inclusive), and the smallest whole number inside or at the top edge of that range is 5 — so the answer climbs to the next whole number rather than settling for 4, the nearer one under ordinary rounding.
The identity ⌈x⌉ = −⌊−x⌋ checks the same figure a second way without touching the ceiling bracket directly: −4.2 floors down to −5, the greatest whole number at or below −4.2, and negating that gives 5 again — matching what the sheet already shows for 4.2, arrived at by an entirely different route.
Questions
What does the ceiling function actually do?
It returns the smallest integer that is greater than or equal to the number entered — always rounding upward, never to whichever whole number is nearest. 4.2 becomes 5, 4.9 becomes 5, and even 4.001 becomes 5, because all three sit between 4 and 5 and the rule is fixed at the top edge of that gap.
How is this different from ordinary rounding?
Ordinary rounding picks whichever whole number is closer, so 4.2 would fall to 4. This rule ignores distance and only asks whether an integer sits at or above the input, so 4.2, 4.5, and 4.99 all resolve to 5. Only an input that is already whole, like 5 itself, comes back unchanged.
Why does −4.2 come out to −4 instead of −5?
Because the rule always moves toward positive infinity, and for a negative number that direction points toward zero, not away from it. −4 is greater than −4.2 and is the smallest integer that clears it, while −5 is smaller than −4.2 and fails that test. The magnitude actually shrinks even though the value increases.
How does this relate to the floor function?
They are mirror images through zero: ⌈x⌉ = −⌊−x⌋. Floor moves down to the integer at or below the input; ceiling moves up to the one at or above it. For any non-integer the two answers differ by exactly 1, and for an exact integer both return that same integer with no adjustment at all.
Does an integer input just return itself?
Yes. If x is already whole, the smallest integer greater than or equal to x is x itself, so entering 5 returns 5 with nothing to round. This is the one case where the two neighboring functions, floor and ceiling, agree exactly — every other input leaves them a step apart.
Where does the ⌈x⌉ bracket notation come from?
Kenneth Iverson introduced the bracket pair in 1962 while designing the programming language APL, choosing a flat top to suggest a literal ceiling capping the value from above. Mathematicians outside computing adopted it over the following decades, and it steadily replaced older, wordier phrasings like 'the least integer not less than x.'