olymmath

IR-TST 2018 Problem 12

  • Test 2

a1,a2,…,ana_1,a_2,\ldots,a_n is a sequence of positive integers that has at least 2n3+1\frac {2n}{3}+1 distinct numbers and each positive integer has occurred at most three times in it. Prove that there exists a permutation b1,b2,…,bnb_1,b_2,\ldots,b_n of aia_i 's such that all the nn sums bi+bi+1b_i+b_{i+1} are distinct ( 1≤i≤n1\le i\le n , bn+1≡b1b_{n+1}\equiv b_1 )

Proposed by Mohsen Jamali

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 ir-tst/2018/p12 · Tag 4JBFXQ2Z8W · Edit this page on GitHub · Keys: j next, k previous