Difference between revisions of "2013 AIME II Problems/Problem 14"
m (→Generalized Solution) |
|||
Line 29: | Line 29: | ||
So the sum is <math>5+3\times(6+...+31)+32\times 2=1512</math>, so the answer is <math>\boxed{512}</math>. | So the sum is <math>5+3\times(6+...+31)+32\times 2=1512</math>, so the answer is <math>\boxed{512}</math>. | ||
+ | By: Kris17 | ||
+ | ===The Intuition=== | ||
+ | First, let's see what happens if we remove a restriction. Let's define <math>G(x)</math> as | ||
+ | |||
+ | <math>G(x):=\max_{\substack{1\le k}} f(n, k)</math> | ||
+ | |||
+ | Now, if you set <math>k</math> as any number greater than <math>n</math>, you get n, obviously the maximum possible. That's too much freedom; let's restrict it a bit. Hence <math>H(x)</math> is defined as | ||
+ | |||
+ | <math>H(x):=\max_{\substack{1\le k\le n}} f(n, k)</math> | ||
+ | |||
+ | Now, after some thought, we find that if we set <math>k=\lfoor frac{n}{2} \rfloor+1</math> we get a remainder of <math>\lfloor frac{n-1}{2} \rfloor</math>, the max possible. Once we have gotten this far, it is easy to see that the original equation, | ||
+ | |||
+ | <math>F(n) = \max_{\substack{1\le k\le \frac{n}{2}}} f(n, k)</math> | ||
+ | |||
+ | has a solution with <math>k=\lfoor frac{n}{3} \rfloor+1</math>. | ||
+ | |||
+ | <math>W^5</math>~Rowechen | ||
===The Proof=== | ===The Proof=== | ||
The solution presented above does not prove why <math>F(x)</math> is found by dividing <math>x</math> by <math>3</math>. Indeed, that is the case, as rigorously shown below. | The solution presented above does not prove why <math>F(x)</math> is found by dividing <math>x</math> by <math>3</math>. Indeed, that is the case, as rigorously shown below. |
Revision as of 15:39, 29 August 2017
Contents
Problem 14
For positive integers and , let be the remainder when is divided by , and for let . Find the remainder when is divided by .
Solution
Easy solution without strict proof
We can find that
Observing these and we can find that the reminders are in groups of three continuous integers, considering this is true, and we get
So the sum is , so the answer is . By: Kris17
The Intuition
First, let's see what happens if we remove a restriction. Let's define as
Now, if you set as any number greater than , you get n, obviously the maximum possible. That's too much freedom; let's restrict it a bit. Hence is defined as
Now, after some thought, we find that if we set $k=\lfoor frac{n}{2} \rfloor+1$ (Error compiling LaTeX. ! Undefined control sequence.) we get a remainder of , the max possible. Once we have gotten this far, it is easy to see that the original equation,
has a solution with $k=\lfoor frac{n}{3} \rfloor+1$ (Error compiling LaTeX. ! Undefined control sequence.).
~Rowechen
The Proof
The solution presented above does not prove why is found by dividing by . Indeed, that is the case, as rigorously shown below.
Consider the case where . We shall prove that . For all , where . This is because and . Also, as n increases, decreases. Thus, for all . Consider all and . Also, . Thus, for for .
Similar proofs apply for and . The reader should feel free to derive these proofs himself.
Generalized Solution
Highest remainder when is divided by is obtained for and the remainder thus obtained is .
This is the second highest remainder when is divided by and the highest remainder occurs when is divided by = for odd and = for even .
Using the lemma above:
So the answer is
Proof of Lemma: It is similar to stated above.
Kris17
See Also
2013 AIME II (Problems • Answer Key • Resources) | ||
Preceded by Problem 13 |
Followed by Problem 15 | |
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.