2016 AMC 10B Problems/Problem 25: Difference between revisions
Shivakannan (talk | contribs) |
Shivakannan (talk | contribs) |
||
| Line 34: | Line 34: | ||
{{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 10:00, 27 March 2020
Problem
Let
, where
denotes the greatest integer less than or equal to
. How many distinct values does
assume for
?
Solution
Since
, we have
The function can then be simplified into
which becomes
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
. 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
.
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 | ||
These problems are copyrighted © by the Mathematical Association of America, as part of the American Mathematics Competitions. Error creating thumbnail: Unable to save thumbnail to destination