2019 CIME I Problems/Problem 15
Revision as of 17:57, 4 October 2020 by Icematrix2 (talk | contribs)
Let be a sequence of functions going from
to
defined recursively by
and
for all
. Compute the greatest integer less than or equal to
.
Solution
Note that the function on the right is ’s sum function, so if
is multiplicative so is
. Now since
is multiplicative, it is not hard to see using induction that all
are multiplicative too.
Therefore we can just consider one prime and its exponent. Say . Note that
and
. Then
by the Hockey Stick Identity. We can continue this process (summing and using the hockey stick identity for each exponent) to obtain
.
Now and
thus our answer is
.
See also
2019 CIME I (Problems • Answer Key • Resources) | ||
Preceded by Problem 14 |
Followed by Last problem | |
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 | ||
All CIME Problems and Solutions |
The problems on this page are copyrighted by the MAC's Christmas Mathematics Competitions.