Talk:2005 USAMO Problems/Problem 5: Difference between revisions
Created page with "It says that <math>f(i)</math> is increasing by at most <math>1</math> for each change in <math>i</math>, but I don't think that's the case (<math>b_i</math> can increase by m..." |
No edit summary |
||
| Line 1: | Line 1: | ||
It says that <math>f(i)</math> is increasing by at most <math>1</math> for each change in <math>i</math>, but I don't think that's the case (<math>b_i</math> can increase by more than <math>2</math>). The claim that <math>f(i)</math> has to be <math>0</math> at some point is correct, but only because of discrete continuity. Would someone confirm this? I don't trust myself to make edits to this solution. | It says that <math>f(i)</math> is increasing by at most <math>1</math> for each change in <math>i</math>, but I don't think that's the case (<math>b_i</math> can increase by more than <math>2</math>). The claim that <math>f(i)</math> has to be <math>0</math> at some point is correct, but only because of discrete continuity. Would someone confirm this? I don't trust myself to make edits to this solution. | ||
-pisgood | |||
Latest revision as of 03:18, 25 March 2019
It says that 
is increasing by at most 
for each change in 
, but I don't think that's the case (
can increase by more than 
). The claim that has to be 
at some point is correct, but only because of discrete continuity. Would someone confirm this? I don't trust myself to make edits to this solution.
-pisgood
