Distinct Pairwise Sums

Problem

For a set A={a1,a2,,an}A = \{a_1, a_2, \dots, a_n\} of positive reals (n2n \geqslant 2), define

A+A={ai+ajai,ajA, ij}.A + A = \{a_i + a_j \mid a_i, a_j \in A,\ i \neq j\}.

If A+AA + A has exactly n(n1)2\dfrac{n(n-1)}{2} elements, we say AA has property Ω\Omega.

1. Determine whether A1={1,2,4}A_1 = \{1, 2, 4\} and A2={1,2,4,5}A_2 = \{1, 2, 4, 5\} have property Ω\Omega. 2. Suppose B={1,3,p,q}B = \{1, 3, p, q\} (with p,qNp, q \in \mathbb{N} and 3<p<q3 < p < q) has property Ω\Omega, and the elements of B+BB + B can be arranged into an arithmetic sequence. Find pp and qq. 3. Suppose AA has property Ω\Omega and the elements of A+AA + A can be arranged into an arithmetic sequence. Is there a maximum possible number of elements of AA? If so, find it; if not, explain why.

Answer

Solution

Difficulty7/10
Topicscombinatorics, Arithmetic Progression, Set Theory, Casework, Symmetry

Whiteboard

Your sketch is saved only in this browser. To share it, export your drawing as an image (whiteboard menu → Export as → PNG), then upload that image in the comments below.

Discussion

Ask questions, share alternate solutions, and use LaTeX freely.

0 comments
Log in to join the discussion.

No comments yet.