MathDB
Prove that if A is a B_3-set, then A = B

Source: IMO Shortlist 2000, A6

August 10, 2008
algebranumber theoryCombinatorial Number TheorySequenceIMO Shortlist

Problem Statement

A nonempty set A A of real numbers is called a B3 B_3-set if the conditions a1,a2,a3,a4,a5,a6A a_1, a_2, a_3, a_4, a_5, a_6 \in A and a_1 \plus{} a_2 \plus{} a_3 \equal{} a_4 \plus{} a_5 \plus{} a_6 imply that the sequences (a1,a2,a3) (a_1, a_2, a_3) and (a4,a5,a6) (a_4, a_5, a_6) are identical up to a permutation. Let A={a0=0<a1<a2<}A = \{a_0 = 0 < a_1 < a_2 < \cdots \}, B={b0=0<b1<b2<}B = \{b_0 = 0 < b_1 < b_2 < \cdots \} be infinite sequences of real numbers with D(A) \equal{} D(B), where, for a set X X of real numbers, D(X) D(X) denotes the difference set \{|x\minus{}y|\mid x, y \in X \}. Prove that if A A is a B3 B_3-set, then A \equal{} B.