Home Competitions RU-ALLRUSSIAN 1982 Problem 2
RU-ALLRUSSIAN 1982 Problem 2
The sequence a n \mathbf{a}_{\mathrm{n}} a n a 1 = 1 \mathbf{a}_{1} = 1 a 1 = 1 a 2 = 2 \mathbf{a}_{2} = 2 a 2 = 2 a n + 2 = a n + 1 + a n \mathbf{a}_{\mathrm{n} + 2} = \mathbf{a}_{\mathrm{n} + 1} + \mathbf{a}_{\mathrm{n}} a n + 2 = a n + 1 + a n b n \mathbf{b}_{\mathrm{n}} b n b 1 = 2 \mathbf{b}_{1} = 2 b 1 = 2 b 2 = 1 \mathbf{b}_{2} = 1 b 2 = 1 b n + 2 = b n + 1 + b n \mathbf{b}_{\mathrm{n} + 2} = \mathbf{b}_{\mathrm{n} + 1} + \mathbf{b}_{\mathrm{n}} b n + 2 = b n + 1 + b n
Dataset text NuminaMath olympiads . Quoted with source.
Show the answer
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 ru-allrussian/1982/p2 · Tag W0ZR4G8PBW · Edit this page on GitHub · Keys: j next, k previous