Difference between revisions of "2016 AMC 10B Problems/Problem 25"
(Created page with "==Problem== Let <math>f(x)=\sum_{k=2}^{10}(\lfloor kx \rfloor -k \lfloor x \rfloor)</math>, where <math>\lfloor r \rfloor</math> denotes the greatest integer less than or equ...") |
(→Problem) |
||
Line 4: | Line 4: | ||
<math>\textbf{(A)}\ 32\qquad\textbf{(B)}\ 36\qquad\textbf{(C)}\ 45\qquad\textbf{(D)}\ 46\qquad\textbf{(E)}\ \text{infinitely many}</math> | <math>\textbf{(A)}\ 32\qquad\textbf{(B)}\ 36\qquad\textbf{(C)}\ 45\qquad\textbf{(D)}\ 46\qquad\textbf{(E)}\ \text{infinitely many}</math> | ||
+ | |||
+ | |||
+ | ==Solution== | ||
+ | |||
+ | |||
+ | ==See Also== | ||
+ | {{AMC10 box|year=2016|ab=B|num-b=24}} | ||
+ | {{MAA Notice}} |
Revision as of 12:26, 21 February 2016
Problem
Let , where denotes the greatest integer less than or equal to . How many distinct values does assume for ?
Solution
See Also
2016 AMC 10B (Problems • Answer Key • Resources) | ||
Preceded by Problem 24 |
Followed by [[2016 AMC 10B Problems/Problem {{{num-a}}}|Problem {{{num-a}}}]] | |
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 • 16 • 17 • 18 • 19 • 20 • 21 • 22 • 23 • 24 • 25 | ||
All AMC 10 Problems and Solutions |
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.