CMO 2017 Problem 1 Day 1 The sequences {un}\{u_{n}\}{un} and {vn}\{v_{n}\}{vn} are defined by u0=u1=1u_{0} =u_{1} =1u0=u1=1 , un=2un−1−3un−2u_{n}=2u_{n-1}-3u_{n-2}un=2un−1−3un−2 (n≥2)(n\geq2)(n≥2) , v0=a,v1=b,v2=cv_{0} =a, v_{1} =b , v_{2}=cv0=a,v1=b,v2=c , vn=vn−1−3vn−2+27vn−3v_{n}=v_{n-1}-3v_{n-2}+27v_{n-3}vn=vn−1−3vn−2+27vn−3 (n≥3)(n\geq3)(n≥3) . There exists a positive integer NNN such that when n>Nn> Nn>N , we have un∣vnu_{n}\mid v_{n}un∣vn . Prove that 3a=2b+c3a=2b+c3a=2b+c . 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. IL-GILLIS 2015 Problem 7DE-MO 2022 Problem 4CMO 2017 Problem 6 NextProblem 2 Locator cn-mo/2017/p1 · Tag JYDV8PX43X · Edit this page on GitHub · Keys: j next, k previous