$g(x):\mathbb{Z}\rightarrow\mathbb{Z}$ is a function that satisfies $$g(x)+g(y)=g(x+y)-xy.$$ If $g(23)=0$, what is the sum of all possible values of $g(35)$?

Let $ \{A_n\}_{n \in \mathbb{N}}$ be a sequence of measurable subsets of the real line which covers almost every point infinitely often. Prove, that there exists a set $ B \subset \mathbb{N}$ of zero density, such that $ \{A_n\}_{n \in B}$ also covers almost every point infinitely often. (The set $ B \subset \mathbb{N}$ is of zero density if $ \lim_{n \to \infty} \frac {\#\{B \cap \{0, \dots, n \minus{} 1\}\}}{n} \equal{} 0$.)

Define a sequence $(a_n)$ recursively by $a_1=0, a_2=2, a_3=3$ and $a_n=\max_{0<d<n} a_d \cdot a_{n-d}$ for $n \ge 4$. Determine the prime factorization of $a_{19702020}$.

Find all natural numbers $n\geq 3$ satisfying one can cut a convex $n$-gon into different triangles along some of the diagonals (None of these diagonals intersects others at any point other than vertices) and the number of diagonals are used at each vertex is even.

The infinite sequence $a_0,a _1, a_2, \dots$ of (not necessarily distinct) integers has the following properties: $0\le a_i \le i$ for all integers $i\ge 0$, and \[\binom{k}{a_0} + \binom{k}{a_1} + \dots + \binom{k}{a_k} = 2^k\] for all integers $k\ge 0$. Prove that all integers $N\ge 0$ occur in the sequence (that is, for all $N\ge 0$, there exists $i\ge 0$ with $a_i=N$).

Let $a_1\ge a_2\ge \ldots \ge a_n>0$ be $n$ reals. Prove the inequality \[a_1a_2\ldots a_{n-1}+(2a_2-a_1)(2a_3-a_2)\ldots (2a_n-a_{n-1})\ge 2a_2a_3\ldots a_n\]

Let $x$ and $y$ be positive integers. If ${x^{2^n}}-1$ is divisible by $2^ny+1$ for every positive integer $n$, prove that $x=1$.

Let $n$ be a positive integer. A pair of $n$-tuples $(a_1,\cdots{}, a_n)$ and $(b_1,\cdots{}, b_n)$ with integer entries is called an [i]exquisite pair[/i] if $$|a_1b_1+\cdots{}+a_nb_n|\le 1.$$ Determine the maximum number of distinct $n$-tuples with integer entries such that any two of them form an exquisite pair. [i]Pakawut Jiradilok and Warut Suksompong, Thailand[/i]

Let $n<k$ be two natural numbers and suppose that Sepehr has $n$ chemical elements , $2k$ grams from each , divided arbitrarily in $2k$ cups.Find the smallest number $b$ such that there is always possible for Sepehr to choose $b$ cups , containing at least $2$ grams from each element in total. [i]Proposed by Josef Tkadlec & Morteza Saghafian[/i]

A sequence of real numbers $ a_{0},\ a_{1},\ a_{2},\dots$ is defined by the formula \[ a_{i \plus{} 1} \equal{} \left\lfloor a_{i}\right\rfloor\cdot \left\langle a_{i}\right\rangle\qquad\text{for}\quad i\geq 0; \]here $a_0$ is an arbitrary real number, $\lfloor a_i\rfloor$ denotes the greatest integer not exceeding $a_i$, and $\left\langle a_i\right\rangle=a_i-\lfloor a_i\rfloor$. Prove that $a_i=a_{i+2}$ for $i$ sufficiently large. [i]Proposed by Harmel Nestra, Estionia[/i]

Let $\mathbb{Z}^+$ be the set of positive integers. Determine all functions $f : \mathbb{Z}^+\to\mathbb{Z}^+$ such that $a^2+f(a)f(b)$ is divisible by $f(a)+b$ for all positive integers $a,b$.

Find all polynomials $P$ with integer coefficients such that all the roots of $P^n(x)$ are integers. (here $P^n(x)$ means $P(P(...(P(x))...))$ where $P$ is repeated $n$ times)

Given the expression \[P_n(x) =\frac{1}{2^n}\left[(x +\sqrt{x^2 - 1})^n+(x-\sqrt{x^2 - 1})^n\right],\] prove: $(a) P_n(x)$ satisfies the identity \[P_n(x) - xP_{n-1}(x) + \frac{1}{4}P_{n-2}(x) \equiv 0.\] $(b) P_n(x)$ is a polynomial in $x$ of degree $n.$

In a dance party initially there are $20$ girls and $22$ boys in the pool and infinitely many more girls and boys waiting outside. In each round, a participant is picked uniformly at random; if a girl is picked, then she invites a boy from the pool to dance and then both of them elave the party after the dance; while if a boy is picked, then he invites a girl and a boy from the waiting line and dance together. The three of them all stay after the dance. The party is over when there are only (two) boys left in the pool. (a) What is the probability that the party never ends? (b) Now the organizer of this party decides to reverse the rule, namely that if a girl is picked, then she invites a boy and a girl from the waiting line to dance and the three stay after the dance; while if a boy is picked, he invites a girl from the pool to dance and both leave after the dance. Still the party is over when there are only (two) boys left in the pool. What is the expected number of rounds until the party ends?

A subset of the positive integers $S$ is said to be a \emph{configuration} if 200 $\notin S$ and for all nonnegative integers $x$, $x \in S$ if and only if both 2$x\in S$ and $\left \lfloor{\frac{x}{2}}\right \rfloor\in S$. Let the number of subsets of $\{1, 2, 3, \dots, 130\}$ that are equal to the intersection of $\{1, 2, 3, \dots, 130\}$ with some configuration $S$ equal $k$. Compute the remainder when $k$ is divided by 1810. [i]Proposed Hari Desikan (HariDesikan)[/i]