olymmath

ISL 2000 A6

A nonempty set AA of real numbers is called a B3B_3 -set if the conditions a1,a2,a3,a4,a5,a6∈Aa_1, a_2, a_3, a_4, a_5, a_6 \in A and a1+a2+a3=a4+a5+a6a_1 + a_2 + a_3 = a_4 + a_5 + 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)=D(B),D(A) = D(B), where, for a set XX of real numbers, D(X)D(X) denotes the difference set {∣x−y∣∣x,y∈X}.\{|x-y|\mid x, y \in X \}. Prove that if AA is a B3B_3 -set, then A=B.A = B.

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 isl/2000/a6 · Tag 1TTA7CMNRW · Edit this page on GitHub · Keys: j next, k previous