A set of distinct positive integers is called singular if, for each of its elements, after crossing out that element, the remaining ones can be grouped into two sets with no common elements such that the sum of the elements in the two groups is the same. Find the smallest positive integer $n>1$ such that there exists a singular set $A$ with $n$ items.
2019 Argentina National Olympiad
Level 3
Day 1
Let $n\geq1$ be an integer. We have two sequences, each of $n$ positive real numbers $a_1,a_2,\ldots ,a_n$ and $b_1,b_2,\ldots ,b_n$ such that $a_1+a_2+\ldots +a_n=1$ and $ b_1+b_2+\ldots +b_n=1$. Find the smallest possible value that the sum can take $$\frac{a_1^2}{a_1+b_1}+\frac{a_2^2}{a_2+b_2}+\ldots +\frac{a_n^2}{a_n +b_n}.$$
In triangle $ABC$ it is known that $\angle ACB = 2\angle ABC$. Furthermore $P$ is an interior point of the triangle $ABC$ such that $AP = AC$ and $PB = PC$. Prove that $\angle BAC = 3 \angle BAP$.
Day 2
If we have a set $M$ of $2019$ real numbers such that for every even $a$, $b$ of numbers of $M$ it is verified that $a^2+b \sqrt2$ is a rational number. Show that for all $a$ of $M$, $a\sqrt2$ is a rational number.
There is an arithmetic progression of $7$ terms in which all the terms are different prime numbers. Determine the smallest possible value of the last term of such a progression. Clarification: In an arithmetic progression of difference $d$ each term is equal to the previous one plus $d$.
The natural numbers from $1$ up to $300$ are evenly located around a circle. We say that such an ordering is alternate if each number is less than its two neighbors or is greater than its two neighbors. We will call a pair of neighboring numbers a good pair if, by removing that pair from the circumference, the remaining numbers form an alternate ordering. Determine the least possible number of good pairs in which there can be an alternate ordering of the numbers from $1$ at $300$ inclusive.