2016 AMC 10B Problem 25

Attempt Problem 25 of the 2016 AMC 10B below, then check your answer against the professionally curated solution from LIVE by Po-Shen Loh. You can also try the full timed exam, view all 2016 AMC 10B solutions, or check the answer key.

All problems are used with official legal permission of the Mathematical Association of America (MAA).

25.

Let f(x)=k=210(kxkx),f(x)=\sum_{k=2}^{10}(\lfloor kx \rfloor -k \lfloor x \rfloor), where r\lfloor r \rfloor denotes the greatest integer less than or equal to r.r. How many distinct values does f(x)f(x) assume for x0?x \ge 0?

 32 \ 32

 36 \ 36

 45 \ 45

 46 \ 46

 infinitely many \ \text{infinitely many}

Answer: A
Concepts:floor and ceiling functionsEuler’s Totient Function
Difficulty rating: 2440
Solution:

Write x=x+tx=\lfloor x\rfloor+t, where 0t<10\le t\lt1. Then kxkx=kt,\lfloor kx\rfloor-k\lfloor x\rfloor=\lfloor kt\rfloor, so f(x)f(x) depends only on the fractional part tt.

The value of ff changes only when tt crosses a fraction i/ki/k, where 2k102\le k\le10 and 1i<k1\le i\lt k. The number of distinct such fractions in (0,1)(0,1) is φ(2)+φ(3)++φ(10)=1+2+2+4+2+6+4+6+4=31. \begin{aligned} &\varphi(2)+\varphi(3) \\ &\quad {}+\cdots+\varphi(10) \\ &=1+2+2+4+2 \\ &\quad {}+6+4+6+4 \\ &=31. \end{aligned}

Including the initial value before the first breakpoint, ff assumes 31+1=3231+1=32 distinct values.

Thus, the correct answer is A.

← Problem 24#24
Full Exam

Problem 25 in Other Years