Home Competitions US-TST 2010 Problem 5
Define the sequence a 1 , a 2 , a 3 , … a_1, a_2, a_3, \ldots a 1 , a 2 , a 3 , … by a 1 = 1 a_1 = 1 a 1 = 1 and, for n > 1 n > 1 n > 1 ,
a n = a ⌊ n / 2 ⌋ + a ⌊ n / 3 ⌋ + … + a ⌊ n / n ⌋ + 1. a_n = a_{\lfloor n/2 \rfloor} + a_{\lfloor n/3 \rfloor} + \ldots + a_{\lfloor n/n \rfloor} + 1. a n = a ⌊ n /2 ⌋ + a ⌊ n /3 ⌋ + … + a ⌊ n / n ⌋ + 1.
Prove that there are infinitely many n n n such that a n ≡ n ( m o d 2 2010 ) a_n \equiv n \pmod{2^{2010}} a n ≡ n ( mod 2 2010 ) .
Dataset text AI-MO AoPS . Quoted with source.
Solutions
No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.
Add a solution
Similar problems
These problems have the most words in common with this statement.
Locator us-tst/2010/p5 · Tag 4Z9N2P95G0 · Edit this page on GitHub · Keys: j next, k previous