Sums Within the Set

Problem

A set of numbers A={a1,a2,,an}A = \{a_1, a_2, \dots, a_n\} with 1=a1<a2<<an1 = a_1 < a_2 < \cdots < a_n and n2n \geqslant 2 has property PP if for every kk with 2kn2 \leqslant k \leqslant n there exist i,ji, j with 1ijn1 \leqslant i \leqslant j \leqslant n such that ak=ai+aja_k = a_i + a_j.

1. Determine whether {1,3,5}\{1, 3, 5\} and {1,2,3,6}\{1, 2, 3, 6\} have property PP, with justification. 2. Let Sn=a1+a2++anS_n = a_1 + a_2 + \cdots + a_n. Prove that 2an1Sn2a_n - 1 \leqslant S_n. 3. If an=36a_n = 36, find the minimum possible sum of all elements of AA.

Answer

Solution

Difficulty7/10
Topicscombinatorics, number theory, Set Theory, Estimation, Casework

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.