Art of Problem Solving
AoPS Online
Math texts, online classes, and more
for students in grades 5-12.
Visit AoPS Online ‚
Books for Grades 5-12 Online Courses
Beast Academy
Engaging math books and online learning
for students ages 6-13.
Visit Beast Academy ‚
Books for Ages 6-13 Beast Academy Online
AoPS Academy
Small live classes for advanced math
and language arts learners in grades 2-12.
Visit AoPS Academy ‚
Find a Physical Campus Visit the Virtual Campus

Difference between revisions of "2016 AMC 10B Problems/Problem 25"

m (→‎Solution)
(→‎Solution)
Line 5: Line 5:
 
<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==
 
−
Since <math>x = \lfloor x \rfloor + \{ x \}</math>, we have
 
−
 
−
<cmath>f(x) = \sum_{k=2}^{10} (\lfloor k \lfloor x \rfloor +k \{ x \} \rfloor - k \lfloor x \rfloor)</cmath>
 
−
 
−
The function can then be simplified into
 
−
 
−
<cmath>f(x) = \sum_{k=2}^{10} ( k \lfloor x \rfloor + \lfloor k \{ x \} \rfloor - k \lfloor x \rfloor)</cmath>
 
−
 
−
which becomes
 
−
 
−
<cmath>f(x) = \sum_{k=2}^{10} \lfloor k \{ x \} \rfloor</cmath>
 
−
 
−
We can see that for each value of k, <math>\lfloor k \{ x \} \rfloor</math> can equal integers from 0 to k-1.
 
−
 
−
Clearly, the value of <math>\lfloor k \{ x \} \rfloor</math> changes only when x is equal to any of the fractions <math>\frac{1}{k}, \frac{2}{k} \dots \frac{k-1}{k}</math>.
 
−
 
−
So we want to count how many distinct fractions have the form <math>\frac{m}{n}</math> where <math>n \le 10</math>. We can find this easily by computing
 
−
<cmath>\sum_{k=2}^{10} \phi(k)</cmath>
 
−
where <math>\phi(k)</math> is the Euler Totient Function. Basically <math>\phi(k)</math> counts the number of fractions with <math>k</math> as its denominator (after simplification). This comes out to be <math>31</math>.
 
−
 
−
Because the value of <math>f(x)</math> is at least 0 and can increase 31 times, there are a total of <math>\fbox{\textbf{(A)}\ 32}</math> different possible values of <math>f(x)</math>.
 
  
 
==See Also==
 
==See Also==
 
{{AMC10 box|year=2016|ab=B|num-b=24|after=Last Problem}}
 
{{AMC10 box|year=2016|ab=B|num-b=24|after=Last Problem}}
 
{{MAA Notice}}
 
{{MAA Notice}}

Revision as of 07:10, 3 May 2017

Problem

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

$\textbf{(A)}\ 32\qquad\textbf{(B)}\ 36\qquad\textbf{(C)}\ 45\qquad\textbf{(D)}\ 46\qquad\textbf{(E)}\ \text{infinitely many}$


See Also

2016 AMC 10B (Problems • Answer Key • Resources)
Preceded by
Problem 24 		Followed by
Last Problem
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. AMC logo.png

Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=2016_AMC_10B_Problems/Problem_25&oldid=85526"