A Set with Forbidden Sums

Problem

Let E={1,2,3,…,200}E = \{1, 2, 3, \dots, 200\} and let G={a1,a2,…,a100}G = \{a_1, a_2, \dots, a_{100}\} be a 100100-element subset of EE with the following two properties:

1. for all 1⩽i⩽j⩽1001 \leqslant i \leqslant j \leqslant 100, we have ai+aj≠201a_i + a_j \neq 201; 2. ∑i=1100ai=10080\displaystyle\sum_{i=1}^{100} a_i = 10080.

Prove that the number of odd numbers in GG is a multiple of 44, and that the sum of the squares of all elements of GG is a fixed constant.

Answer

Solution

Difficulty7/10
Topicscombinatorics, number theory, Counting, Modular Arithmetic

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.