2016 AMC 10B Problems/Problem 25
Let , where denotes the greatest integer less than or equal to . How many distinct values does assume for ?
Since , we have
The function can then be simplified into
We can see that for each value of , can equal integers from to .
Clearly, the value of changes only when is equal to any of the fractions .
So we want to count how many distinct fractions less than have the form where . Explanation for this is provided below. We can find this easily by computing
where is the Euler Totient Function. Basically counts the number of fractions with as its denominator (after simplification). This comes out to be .
Because the value of is at least and can increase times, there are a total of different possible values of .
Arrange all such fractions in increasing order and take a current to study. Let denote the previous fraction in the list and ( for each ) be the largest so that . Since , we clearly have all . Therefore, the change must be nonnegative.
But among all numerators coprime to so far, is the largest. Therefore, choosing as increases the value . Since the overall change in is positive as fractions increase, we deduce that all such fractions correspond to different values of the function.
so we have Clearly, the value of changes only when is equal to any of the fractions . To get all the fractions, Graphing this function gives us different fractions but on an average, in each of the intervals don’t work. This means there are a total of different possible values of .
|2016 AMC 10B (Problems • Answer Key • Resources)|
|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|