Definition 39.0.1 · Floor, Ceiling, and Fractional Part Functions
For example, , and . Careful with negatives: and , because .
Round down, round up, keep what is left: turn floors into inequalities, split x into integer and fractional parts, and count where a line meets a staircase.
In this section you will be able to use ⌊x⌋, ⌈x⌉ and {x}: turn a floor into an inequality, split x into its two parts, and count crossings on a graph.
How many positive integers make ? On one side is a straight line. On the other is a staircase. Count where they meet.
The floor rounds down, the ceiling rounds up, and is what is left over. So , always.
Look: a floor is an integer and an inequality at the same time. If , then is an integer and . Almost every problem in this chapter starts there.
When that gets messy, draw it. A floor graph is a staircase, and solutions are the places where your other curve crosses a step.
For example, , and . Careful with negatives: and , because .
Most floor and ceiling problems can be solved using these techniques.
How many of the first positive integers can be expressed in the form
where is a real number, and denotes the greatest integer less than or equal to ?
Call the sum . Adding to adds to the four floors. So what is ?
Let denote the greatest integer less than or equal to . How many real numbers satisfy the equation ?
Move the floor term across and use . What does the equation become?
How many positive integers satisfy
(Recall that is the greatest integer not exceeding .)
The right side is an integer. So is an integer . Write in terms of .
How many distinct values of satisfy , where denotes the largest integer less than or equal to ?
The graph of
is symmetric about which of the following? (Here is the greatest integer not exceeding .)
Cozy the Cat and Dash the Dog are going up a staircase with a certain number of steps. However, instead of walking up the steps one at a time, both Cozy and Dash jump. Cozy goes two steps up with each jump (though if necessary, he will just jump the last step). Dash goes five steps up with each jump (though if necessary, he will just jump the last steps if there are fewer than steps left). Suppose Dash takes fewer jumps than Cozy to reach the top of the staircase. Let denote the sum of all possible numbers of steps this staircase can have. What is the sum of the digits of ?
This problem also appears in the book as 22.1.13.
For how many positive integers is
not divisible by ? (Recall that is the greatest integer less than or equal to .)
Suppose is a real number for which
Find . (For real , is the greatest integer less than or equal to .)
How many positive integers less than are there such that the equation has a solution for ?
Given a nonnegative real number , let denote the fractional part of ; that is, , where denotes the greatest integer less than or equal to . Suppose that is positive, , and . Find the value of .
Find the least positive integer for which the equation has no integer solutions for . (The notation means the greatest integer less than or equal to .)
Find the number of positive integers less than for which there exists a positive real number such that . Note: is the greatest integer less than or equal to .
For a real number , let denote the greatest integer less than or equal to . Let denote the region in the coordinate plane consisting of points such that . The region is completely contained in a disk of radius (a disk is the union of a circle and its interior). The minimum value of can be written as , where and are integers and is not divisible by the square of any prime. Find .
In this section you will be able to mix floors with averages, cube roots and counting arguments.
These last four hide a floor inside something else: a mean and a mode, a cube root, a familiar staircase, and three floors that together pin down a number. Every problem has three hints if you get stuck.
Want every problem from this chapter on one page? Open the problem set.
This problem also appears in the book as 18.1.14.
A sample of integers is given, each between and inclusive, with repetitions allowed. The sample has a unique mode (most frequent value). Let be the difference between the mode and the arithmetic mean of the sample. What is the largest possible value of ? (For real , is the greatest integer less than or equal to .)
Given a real number , let denote the greatest integer less than or equal to . For a certain integer , there are exactly positive integers such that
and divides for all such that . Find the maximum value of for .
This problem also appears in the book as 39.3.
How many positive integers satisfy
(Recall that is the greatest integer not exceeding .)
Find the number of positive integers whose value can be uniquely determined when the values of , , and are given, where denotes the greatest integer less than or equal to the real number .