Find the maximal number of points, such that there exist a configuration of $2023$ lines on the plane, with each lines pass at least $2$ points.

Prove that the vertices of any planar graph can be colored with $3$ colors such that there is no monochromatic cycle.

Consider those functions $ f: \mathbb{N} \mapsto \mathbb{N}$ which satisfy the condition \[ f(m \plus{} n) \geq f(m) \plus{} f(f(n)) \minus{} 1 \] for all $ m,n \in \mathbb{N}.$ Find all possible values of $ f(2007).$ [i]Author: Nikolai Nikolov, Bulgaria[/i]

The sequence $ \{x_{n}\}$ is defined by $ x_{1} \equal{} 2,x_{2} \equal{} 12$, and $ x_{n \plus{} 2} \equal{} 6x_{n \plus{} 1} \minus{} x_{n}$, $ (n \equal{} 1,2,\ldots)$. Let $ p$ be an odd prime number, let $ q$ be a prime divisor of $ x_{p}$. Prove that if $ q\neq2,3,$ then $ q\geq 2p \minus{} 1$.

Find all $(m,n)$ in $\mathbb{N}^2$ such that $m\mid n^2+1$ and $n\mid m^2+1$.

8.8, 9.8, 11.8 a) 99 boxes contain apples and oranges. Prove that we can choose 50 boxes in such a way that they contain at least half of all apples and half of all oranges. b) 100 boxes contain apples and oranges. Prove that we can choose 34 boxes in such a way that they contain at least a third of all apples and a third of all oranges. c) 100 boxes contain apples, oranges and bananas. Prove that we can choose 51 boxes in such a way that they contain at least half of all apples, and half of all oranges and half of all bananas. ([i]I. Bogdanov, G. Chelnokov, E. Kulikov[/i])

Find all positive integers $n$ such that $4^n+6^n+9^n$ is a square. [i]David Yang, Alex Zhu.[/i]

A positive integer $N$ is called [i]balanced[/i], if $N=1$ or if $N$ can be written as a product of an even number of not necessarily distinct primes. Given positive integers $a$ and $b$, consider the polynomial $P$ defined by $P(x)=(x+a)(x+b)$. (a) Prove that there exist distinct positive integers $a$ and $b$ such that all the number $P(1)$, $P(2)$,$\ldots$, $P(50)$ are balanced. (b) Prove that if $P(n)$ is balanced for all positive integers $n$, then $a=b$. [i]Proposed by Jorge Tipe, Peru[/i]

Let $n \geq 2$ be a natural. Define $$X = \{ (a_1,a_2,\cdots,a_n) | a_k \in \{0,1,2,\cdots,k\}, k = 1,2,\cdots,n \}$$. For any two elements $s = (s_1,s_2,\cdots,s_n) \in X, t = (t_1,t_2,\cdots,t_n) \in X$, define $$s \vee t = (\max \{s_1,t_1\},\max \{s_2,t_2\}, \cdots , \max \{s_n,t_n\} )$$ $$s \wedge t = (\min \{s_1,t_1 \}, \min \{s_2,t_2,\}, \cdots, \min \{s_n,t_n\})$$ Find the largest possible size of a proper subset $A$ of $X$ such that for any $s,t \in A$, one has $s \vee t \in A, s \wedge t \in A$.

Prove that for all positive integers $n,m$, with $m$ odd, the following number is an integer \[ \frac 1{3^mn}\sum^m_{k=0} { 3m \choose 3k } (3n-1)^k. \]

Find the coefficient of $x^2$ after expansion and collecting the terms of the following expression (there are $k$ pairs of parentheses): $$((... (((x - 2)^2 - 2)^2 -2)^2 -... -2)^2 - 2)^2$$

The sequence $(a_{n})$ is defined by $a_1=1$ and $a_n=n(a_1+a_2+\cdots+a_{n-1})$ , $\forall n>1$. [b](a)[/b] Prove that for every even $n$, $a_{n}$ is divisible by $n!$. [b](b)[/b] Find all odd numbers $n$ for the which $a_{n}$ is divisible by $n!$.

Let $a_1=1$ and $a_{n+1}=2/(2+a_n)$ for all $n\geqslant 1$. Similarly, $b_1=1$ and $b_{n+1}=3/(3+b_n)$ for all $n\geqslant 1$. Which is greater between $a_{2022}$ and $b_{2022}$? [i]Proposed by P. Kozhevnikov[/i]

Let $n$ be a positive integer and let $S \subseteq \{0, 1\}^n$ be a set of binary strings of length $n$. Given an odd number $x_1, \dots, x_{2k + 1} \in S$ of binary strings (not necessarily distinct), their [i]majority[/i] is defined as the binary string $y \in \{0, 1\}^n$ for which the $i^{\text{th}}$ bit of $y$ is the most common bit among the $i^{\text{th}}$ bits of $x_1, \dots,x_{2k + 1}$. (For example, if $n = 4$ the majority of 0000, 0000, 1101, 1100, 0101 is 0100.) Suppose that for some positive integer $k$, $S$ has the property $P_k$ that the majority of any $2k + 1$ binary strings in $S$ (possibly with repetition) is also in $S$. Prove that $S$ has the same property $P_k$ for all positive integers $k$. [i]Proposed by Joshua Brakensiek[/i]

There were $n\ge2$ teams in a tournament. Each team played against every other team once without draws. A team gets 0 points for a loss and gets as many points for a win as its current number of losses. For which $n$ all the teams could end up with the same number of points?