Home Competitions KöMaL 2016 B4766
The sequence a 1 , a 2 , … a_{1}, a_{2}, \dots a 1 , a 2 , … is defined by the following recursion: a 1 = 1 a_{1}=1 a 1 = 1 , a 2 = 5 a_{2}=5 a 2 = 5 , a 3 = 15 a_{3}=15 a 3 = 15 , and in the case of n ≥ 4 n\ge 4 n ≥ 4 , a n = n 2 + a n − 1 + a n − 2 − a n − 3 a_{n}=n^{2}+a_{n-1}+a_{n-2}-a_{n-3} a n = n 2 + a n − 1 + a n − 2 − a n − 3 . a ) a) a ) Calculate the sum a 1 + a 2 + a 3 + ⋯ + a 2015 a_{1}+a_{2}+a_{3}+\dots +a_{2015} a 1 + a 2 + a 3 + ⋯ + a 2015 . b ) b) b ) Prove that 1 a 1 + 1 a 2 + 1 a 3 + ⋯ + 1 a 2015 < 4 3 \frac{1}{a_{1}}+\frac{1}{a_{2}}+\frac{1}{a_{3}}+ \dots +\frac{1}{a_{2015}}<\frac{4}{3} a 1 1 + a 2 1 + a 3 1 + ⋯ + a 2015 1 < 3 4 .
Official text KöMaL . 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 hu-komal/2016/b4766 · Tag 321G5ABQJ0 · Edit this page on GitHub · Keys: j next, k previous