$39$ students participated in a math competition. The exam consisted of $6$ problems and each problem was worth $1$ point for a correct solution and $0$ points for an incorrect solution. For any $3$ students, there is at most $1$ problem that was not solved by any of the three. Let $B$ be the sum of all of the scores of the $39$ students. Find the smallest possible value of $B$.

Given the positive integer $m \geq 2$, $n \geq 3$. Define the following set $$S = \left\{(a, b) | a \in \{1, 2, \cdots, m\}, b \in \{1, 2, \cdots, n\} \right\}.$$Let $A$ be a subset of $S$. If there does not exist positive integers $x_1, x_2, y_1, y_2, y_3$ such that $x_1 < x_2, y_1 < y_2 < y_3$ and $$(x_1, y_1), (x_1, y_2), (x_1, y_3), (x_2, y_2) \in A.$$Determine the largest possible number of elements in $A$.

Let $a$ and $S$ be the length of the side and the area of regular triangle inscribed in a circle of radius $1$. A closed broken line $A_1A_2...A_{51}A_1$ consisting of $51$ segments of the same length $a$ is placed inside the circle. Prove that the sum of areas of the $ 51$ triangles between the neighboring segments $$A_1A_2A_3, A_2A_3A_4,..., A_{49}A_{50}A_{51}, A_{50}A_{51}A_1, A_{51}A_1A_2$$ is not less than $3S$. (A. Berzinsh, Riga)

Let $m$ and $n$ be fixed positive integers. Tsvety and Freyja play a game on an infinite grid of unit square cells. Tsvety has secretly written a real number inside of each cell so that the sum of the numbers within every rectangle of size either $m$ by $n$ or $n$ by $m$ is zero. Freyja wants to learn all of these numbers. One by one, Freyja asks Tsvety about some cell in the grid, and Tsvety truthfully reveals what number is written in it. Freyja wins if, at any point, Freyja can simultaneously deduce the number written in every cell of the entire infinite grid (If this never occurs, Freyja has lost the game and Tsvety wins). In terms of $m$ and $n$, find the smallest number of questions that Freyja must ask to win, or show that no finite number of questions suffice. [i]Nikolai Beluhov[/i]

Let $ x,y,z$ be positive real numbers, show that $ \frac {xy}{z} \plus{} \frac {yz}{x} \plus{} \frac {zx}{y} > 2\sqrt [3]{x^3 \plus{} y^3 \plus{} z^3}.$

Define a "digitized number" as a ten-digit number $a_0a_1\ldots a_9$ such that for $k=0,1,\ldots, 9$, $a_k$ is equal to the number of times the digit $k$ occurs in the number. Find the sum of all digitized numbers.

A point $ P$ in the interior of triangle $ ABC$ satisfies \[ \angle BPC \minus{} \angle BAC \equal{} \angle CPA \minus{} \angle CBA \equal{} \angle APB \minus{} \angle ACB.\] Prove that \[ \bar{PA} \cdot \bar{BC} \equal{} \bar{PB} \cdot \bar{AC} \equal{} \bar{PC} \cdot \bar{AB}.\]

Let $n \ge 3$ points be given in the plane, no three of which lie on the same line. Determine whether it is always possible to draw an $n$-gon whose vertices are the given points and whose sides do not intersect. [i]Remark.[/i] The $n$-gon can be concave.

Find all natural numbers $n\ge1$ such that the implication $$(11\mid a^n+b^n)\implies(11\mid a\wedge11\mid b)$$holds for any two natural numbers $a$ and $b$.

Show that if $a,b$ are positive real numbers such that $a^{2000}+b^{2000}=a^{1998}+b^{1998}$ then $a^2+b^2 \le 2$.

[u]Set 6[/u] [b]p16.[/b] Let $x$ and $y$ be non-negative integers. We say point $(x, y)$ is square if $x^2 + y$ is a perfect square. Find the sum of the coordinates of all distinct square points which also satisfy $x^2 + y \le 64$. [b]p17.[/b] Two integers $a$ and $b$ are randomly chosen from the set $\{1, 2, 13, 17, 19, 87, 115, 121\}$, with $a > b$. What is the expected value of the number of factors of $ab$? [b]p18.[/b] Marnie the Magical Cello is jumping on nonnegative integers on number line. She starts at $0$ and jumps following two specific rules. For each jump she can either jump forward by $1$ or jump to the next multiple of $4$ (the next multiple must be strictly greater than the number she is currently on). How many ways are there for her to jump to $2022$? (Two ways are considered distinct only if the sequence of numbers she lands on is different.) PS. You should use hide for answers.

Let $F:\mathbb R^{\mathbb R}\to\mathbb R^{\mathbb R}$ be a function (from the set of real-valued functions to itself) such that $$F(F(f)\circ g+g)=f\circ F(g)+F(F(F(g)))$$ for all $f,g:\mathbb R\to\mathbb R$. Prove that there exists a function $\sigma:\mathbb R\to\mathbb R$ such that $$F(f)=\sigma\circ f\circ\sigma$$ for all $f:\mathbb R\to\mathbb R$.

The sequence ($a_n$) is defined by $a_1 = a_2 = 1$ and $a_{n+2 }= a_{n+1} +a_n +k$, where $k$ is a positive integer. Find the least $k$ for which $a_{1991}$ and $1991$ are not coprime.

Consider a function $f: \mathbb Z \to \mathbb Z$ such that for every integer $n \ge 0$, there are at most $0.001n^2$ pairs of integers $(x,y)$ for which $f(x+y) \neq f(x)+f(y)$ and $\max\{ \lvert x \rvert, \lvert y \rvert \} \le n$. Is it possible that for some integer $n \ge 0$, there are more than $n$ integers $a$ such that $f(a) \neq a \cdot f(1)$ and $\lvert a \rvert \le n$? [i]Proposed by David Yang[/i]

SEEMOUS 2016 COMPETITION PROBLEMS

Let $ f : [0, \plus{}\infty) \to \mathbb R$ be a differentiable function. Suppose that $ \left|f(x)\right| \le 5$ and $ f(x)f'(x) \ge \sin x$ for all $ x \ge 0$. Prove that there exists $ \lim_{x\to\plus{}\infty}f(x)$.