olymmath

CN-TST 2012 Problem 10

  • Test 2

Given an integer n≥2n\ge 2 . Prove that there only exist a finite number of n-tuples of positive integers (a1,a2,…,an)(a_1,a_2,\ldots,a_n) which simultaneously satisfy the following three conditions:

  • a1>a2>…>ana_1>a_2>\ldots>a_n ;
  • gcd⁡(a1,a2,…,an)=1\gcd (a_1,a_2,\ldots,a_n)=1 ;
  • a1=∑i=1ngcd⁡(ai,ai+1)a_1=\sum_{i=1}^{n}\gcd (a_i,a_{i+1}) ,where an+1=a1a_{n+1}=a_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 cn-tst/2012/p10 · Tag ZD3BGZ8TJM · Edit this page on GitHub · Keys: j next, k previous