The finite set $M$ of real numbers is such that among any three of its elements there are two whose sum is in $M$. What is the maximum possible cardinality of $M$? Remark about the other problemsProblem 2 is UK National Round 2022 P2, Problem 3 is UK National Round 2022 P4, Problem 4 is Balkan MO 2021 Shortlist N2 (the one with Bertrand), Problem 5 is IMO Shortlist 2021 A1 and Problem 6 is USAMO 2002/1. Hence neither of these will be posted here.

Denote by $l(n)$ the largest prime divisor of $n$. Let $a_{n+1} = a_n + l(a_n)$ be a recursively defined sequence of integers with $a_1 = 2$. Determine all natural numbers $m$ such that there exists some $i \in \mathbb{N}$ with $a_i = m^2$. Proposed by Nikola Velov, North Macedonia

Let $n$ be a positive integer. Given is a subset $A$ of $\{0,1,...,5^n\}$ with $4n+2$ elements. Prove that there exist three elements $a<b<c$ from $A$ such that $c+2a>3b$. Proposed by Dominik Burek and Tomasz Ciesla, Poland

Let $S$ be a set with 2002 elements, and let $N$ be an integer with $0 \leq N \leq 2^{2002}$. Prove that it is possible to color every subset of $S$ either black or white so that the following conditions hold: (a) the union of any two white subsets is white; (b) the union of any two black subsets is black; (c) there are exactly $N$ white subsets.