MathDB
China Mathematical Olympiad 1986 problem5

Source: China Mathematical Olympiad 1986 problem5

January 18, 2014
combinatorics unsolvedcombinatorics

Problem Statement

Given a sequence 1,1,2,2,3,3,…,1986,19861,1,2,2,3,3,\ldots,1986,1986, determine, with proof, if we can rearrange the sequence so that for any integer 1≤k≤19861\le k \le 1986 there are exactly kk numbers between the two “kk”s.
Back to ProblemsView on AoPS