Home Competitions AUSTRIAN-POLISH 1994 Problem 2
AUSTRIAN-POLISH 1994 Problem 2
The sequences ( a n ) (a_n) ( a n ) and (c_n) are given by a 0 = 1 2 a_0 =\frac12 a 0 = 2 1 , c 0 = 4 c_0=4 c 0 = 4 , and for n ≥ 0 n \ge 0 n ≥ 0 , a n + 1 = 2 a n 1 + a n 2 a_{n+1}=\frac{2a_n}{1+a_n^2} a n + 1 = 1 + a n 2 2 a n , c n + 1 = c n 2 − 2 c n + 2 c_{n+1}=c_n^2-2c_n+2 c n + 1 = c n 2 − 2 c n + 2 Prove that for all n ≥ 1 n\ge 1 n ≥ 1 , a n = 2 c 0 c 1 . . . c n − 1 c n a_n=\frac{2c_0c_1...c_{n-1}}{c_n} a n = c n 2 c 0 c 1 ... c n − 1
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 austrian-polish/1994/p2 · Tag PDEM6MWGTR · Edit this page on GitHub · Keys: j next, k previous