Difference between revisions of "Mock AIME 6 2006-2007 Problems/Problem 12"
Line 14: | Line 14: | ||
Then, <math>(A)(b_k)-a_k=(A)(A^k)-(A^{k+1}-1)=A^{k+1}-A^{k+1}+1=1</math> | Then, <math>(A)(b_k)-a_k=(A)(A^k)-(A^{k+1}-1)=A^{k+1}-A^{k+1}+1=1</math> | ||
− | + | <math>\sum_{k=2}^{A} ((A)(b_k)-a_k)=\sum_{k=2}^{A}1=A-1</math> | |
~Tomas Diaz. orders@tomasdiaz.com | ~Tomas Diaz. orders@tomasdiaz.com | ||
{{alternate solutions}} | {{alternate solutions}} |
Revision as of 20:15, 26 November 2023
Problem
Let be the largest positive rational solution to the equation for all integers . For each , let , where and are relatively prime positive integers. If what is the remainder when is divided by ?
Solution
Let
Solving: we note that the largest positive rational solution is given by:
Therefore , and
Then,
~Tomas Diaz. orders@tomasdiaz.com
Alternate solutions are always welcome. If you have a different, elegant solution to this problem, please add it to this page.