Skip to content

Floor and Ceiling Functions: all problems

Focus mode: every practice problem from the chapter, one after another.

0 / 14 solved

Problem 39.1.1

AMC 10

How many distinct values of xx satisfy ⌊x⌋2−3x+2=0\lfloor x \rfloor^2 - 3x + 2 = 0, where ⌊x⌋\lfloor x \rfloor denotes the largest integer less than or equal to xx?

Staircase y = ⌊x⌋² and y = 3x − 2 for −2 ≤ x ≤ 5: 4 crossings

━ y = ⌊x⌋²╌ y = 3x − 2
−2−1012345−10−50510152025x
x = 1.5: ⌊x⌋² = 1 · 3x − 2 = 2.5

Graph of y = ⌊x⌋², y = 3x − 2

Problem 39.1.2(additional)

AMC 10

The graph of

f(x)=∣⌊x⌋∣−∣⌊1−x⌋∣f(x) = |\lfloor x \rfloor| - |\lfloor 1 - x \rfloor|

is symmetric about which of the following? (Here ⌊x⌋\lfloor x \rfloor is the greatest integer not exceeding xx.)

Click a choice or type its letter (A–E).

Problem 39.1.3(additional)

AMC 10

This problem also appears in the book as 22.1.13.

For how many positive integers n≤1000n \le 1000 is

⌊998n⌋+⌊999n⌋+⌊1000n⌋\left\lfloor \frac{998}{n} \right\rfloor + \left\lfloor \frac{999}{n} \right\rfloor + \left\lfloor \frac{1000}{n} \right\rfloor

not divisible by 33? (Recall that ⌊x⌋\lfloor x \rfloor is the greatest integer less than or equal to xx.)

Problem 39.1.4(additional)

AMC 10

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 55 steps left). Suppose Dash takes 1919 fewer jumps than Cozy to reach the top of the staircase. Let ss denote the sum of all possible numbers of steps this staircase can have. What is the sum of the digits of ss?

Problem 39.1.5(additional)

AIME

Suppose rr is a real number for which

⌊r+19100⌋+⌊r+20100⌋+⌊r+21100⌋+⋯+⌊r+91100⌋=546.\left\lfloor r + \frac{19}{100} \right\rfloor + \left\lfloor r + \frac{20}{100} \right\rfloor + \left\lfloor r + \frac{21}{100} \right\rfloor + \cdots + \left\lfloor r + \frac{91}{100} \right\rfloor = 546.

Find ⌊100r⌋\lfloor 100r \rfloor. (For real xx, ⌊x⌋\lfloor x \rfloor is the greatest integer less than or equal to xx.)

Problem 39.1.6(additional)

AIME

How many positive integers NN less than 10001000 are there such that the equation x⌊x⌋=Nx^{\lfloor x \rfloor} = N has a solution for xx?

Problem 39.1.7(additional)

AIME

Given a nonnegative real number xx, let ⟨x⟩\langle x \rangle denote the fractional part of xx; that is, ⟨x⟩=x−⌊x⌋\langle x \rangle = x - \lfloor x \rfloor, where ⌊x⌋\lfloor x \rfloor denotes the greatest integer less than or equal to xx. Suppose that aa is positive, ⟨a−1⟩=⟨a2⟩\langle a^{-1} \rangle = \langle a^2 \rangle, and 2<a2<32 < a^2 < 3. Find the value of a12−144a−1a^{12} - 144a^{-1}.

Problem 39.1.8(additional)

AIME

This problem also appears in the book as 18.1.14.

A sample of 121121 integers is given, each between 11 and 10001000 inclusive, with repetitions allowed. The sample has a unique mode (most frequent value). Let DD be the difference between the mode and the arithmetic mean of the sample. What is the largest possible value of ⌊D⌋\lfloor D \rfloor? (For real xx, ⌊x⌋\lfloor x \rfloor is the greatest integer less than or equal to xx.)

Problem 39.1.9(additional)

AIME

Find the least positive integer kk for which the equation ⌊2002n⌋=k\left\lfloor \dfrac{2002}{n} \right\rfloor = k has no integer solutions for nn. (The notation ⌊x⌋\lfloor x \rfloor means the greatest integer less than or equal to xx.)

Problem 39.1.10(additional)

AIME

Find the number of positive integers nn less than 10001000 for which there exists a positive real number xx such that n=x⌊x⌋n = x\lfloor x \rfloor. Note: ⌊x⌋\lfloor x \rfloor is the greatest integer less than or equal to xx.

Problem 39.1.11(additional)

AIME

Given a real number xx, let ⌊x⌋\lfloor x \rfloor denote the greatest integer less than or equal to xx. For a certain integer kk, there are exactly 7070 positive integers n1,n2,…,n70n_1, n_2, \ldots, n_{70} such that

k=⌊n13⌋=⌊n23⌋=⋯=⌊n703⌋k = \lfloor \sqrt[3]{n_1} \rfloor = \lfloor \sqrt[3]{n_2} \rfloor = \cdots = \lfloor \sqrt[3]{n_{70}} \rfloor

and kk divides nin_i for all ii such that 1≤i≤701 \le i \le 70. Find the maximum value of nik\dfrac{n_i}{k} for 1≤i≤701 \le i \le 70.

Problem 39.1.12(additional)

AMC 12

This problem also appears in the book as 39.3.

How many positive integers nn satisfy

n+100070=⌊n⌋?\dfrac{n + 1000}{70} = \lfloor \sqrt{n} \rfloor?

(Recall that ⌊x⌋\lfloor x \rfloor is the greatest integer not exceeding xx.)

Problem 39.1.13(additional)

AIME

For a real number aa, let ⌊a⌋\lfloor a \rfloor denote the greatest integer less than or equal to aa. Let R\mathcal{R} denote the region in the coordinate plane consisting of points (x,y)(x, y) such that ⌊x⌋2+⌊y⌋2=25\lfloor x \rfloor^2 + \lfloor y \rfloor^2 = 25. The region R\mathcal{R} is completely contained in a disk of radius rr (a disk is the union of a circle and its interior). The minimum value of rr can be written as mn\frac{\sqrt{m}}{n}, where mm and nn are integers and mm is not divisible by the square of any prime. Find m+nm + n.

Problem 39.1.14(additional)

AIMEChallenge

Find the number of positive integers n≤600n \le 600 whose value can be uniquely determined when the values of ⌊n4⌋\left\lfloor \frac{n}{4} \right\rfloor, ⌊n5⌋\left\lfloor \frac{n}{5} \right\rfloor, and ⌊n6⌋\left\lfloor \frac{n}{6} \right\rfloor are given, where ⌊x⌋\lfloor x \rfloor denotes the greatest integer less than or equal to the real number xx.