Maths Olympiad Prep

Library / Romanian Mathematical Olympiad /127 of 275

Romanian Mathematical Olympiad

Number theory Difficulty 5.7 AIME, harder Prove it Romania

Prove that 2015∈M2015 \in M and 2016∉M2016 \notin M, where
M={x1+2x2+3x3+⋯+2015x2015∣x1,x2,…,x2015∈{−2,3}}. M = \{ x_1 + 2x_2 + 3x_3 + \dots + 2015x_{2015} \mid x_1, x_2, \dots, x_{2015} \in \{-2, 3\} \}.

Solution

An integer nn belongs to MM if and only if there exists disjoint subsets AA, BB of the set S={1,2,…,2015}S = \{1, 2, \dots, 2015\}, with A∪B=SA \cup B = S, so that −2a+3b=n-2a + 3b = n, where aa is the sum of the elements of AA and bb is the sum of the elements of BB (the sum of the elements of the empty set being 00).

Then n=5b−2(a+b)n = 5b - 2(a+b) and, since a+b=1+2+⋯+2015a+b = 1+2+\dots+2015, it follows that
n=5b−2015⋅2016n = 5b - 2015 \cdot 2016.

This shows that nn is divisible by 55, hence 2016∉M2016 \notin M.

In order to prove that 2015∈M2015 \in M, it is enough to find B⊂{1,2,…,2015}B \subset \{1, 2, \dots, 2015\} with the sum of its elements b=15(2015⋅2016+2015)=403⋅2017b = \frac{1}{5}(2015 \cdot 2016 + 2015) = 403 \cdot 2017.

An example is when BB is the union of 403403 pairs of elements of SS with sum 20172017, for instance (2,2015)(2, 2015), (3,2014)(3, 2014), ..., (404,1613)(404, 1613).

So, taking x2=x3=⋯=x404=x1613=x1614=⋯=x2015=3x_2 = x_3 = \dots = x_{404} = x_{1613} = x_{1614} = \dots = x_{2015} = 3 and x1=x405=x406=⋯=x1612=−2x_1 = x_{405} = x_{406} = \dots = x_{1612} = -2, we get 2015∈M2015 \in M.

Want a route through all this instead of an archive? The track puts 2,604 problems in a working order, from Junior Challenge level to the IMO shortlist.

Source: MathNet, licensed CC-BY-4.0. Statement reproduced verbatim; metadata (topic, difficulty) added by this project.