Difference between revisions of "2014 AIME II Problems/Problem 7"
m (→Solution 1) 
Slackroadia (talk  contribs) (→Solution 1) 
(One intermediate revision by the same user not shown)  
(No difference)

Latest revision as of 19:13, 2 December 2017
Contents
Problem
Let . Find the sum of all positive integers for which
Solution 1
First, let's split it into two cases to get rid of the absolute value sign
Now we simplify using productsum logarithmic identites:
Note that the exponent is either if is odd or if is even.
Writing out the first terms we have
This product clearly telescopes (i.e. most terms cancel) and equals either or . But the resulting term after telescoping depends on parity (odd/evenness), so we split it two cases, one where is odd and another where is even.
For odd , it telescopes to where is clearly .
For even , it telescopes to where is the only possible value. Thus the answer is
Solution 2
Note that is when is odd and when is even. Also note that for all . Therefore Because of this, is a telescoping series of logs, and we have Setting each of the above quantities to and and solving for , we get possible values of and so our desired answer is
See also
2014 AIME II (Problems • Answer Key • Resources)  
Preceded by Problem 6 
Followed by Problem 8  
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15  
All AIME Problems and Solutions 
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.