Maths Olympiad Prep

Library / /340 of 520

Number theory Difficulty 6.3 National olympiad Prove it

3. Under the conditions and notations of Question 2, prove:
(i) vh+1=(v0,v1)\left|v_{h+1}\right|=\left(v_{0}, v_{1}\right);
(ii) dv0d \mid v_{0} and dv1d \mid v_{1} if and only if dvh+1d \mid v_{h+1};
(iii) there exist integers x0,x1x_{0}, x_{1}, such that vh+1=x0v0+x1v1v_{h+1}=x_{0} v_{0}+x_{1} v_{1}.

Solution

None

Translate the text above into English, please retain the original text's line breaks and format, and output the translation result directly.

Note: The provided instruction is a meta-instruction and not part of the text to be translated. Since the text to be translated is "None", the translation is also "None". Here is the formatted output as requested:

None

Want a route through all this instead of an archive? The track puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.

Source: NuminaMath-1.5, licensed Apache-2.0. Statement and solution reproduced as published; topic and difficulty added by this site.