Let be two nonzero real numbers $ a,b $ such that $ |a|\neq |b| $ and let $ f:\mathbb{R}\longrightarrow\mathbb{R} $ be a function satisfying the functional relation $$ af(x)+bf(-x)=(x^3+x)^5+\sin^5 x . $$ Calculate $ \int_{-2019}^{2019}f(x)dx . $ [i]Constantin Rusu[/i]

For each positive integer $x$, let $\varphi(x)$ be the number of integers $1 \leq k \leq x$ that do not have prime factors in common with $x$. Determine all positive integers $n$ such that there are distinct positive integers $a_1,a_2, \ldots, a_n$ so that the set: $$S = \{a_1, a_2, \ldots, a_n, \varphi(a_1), \varphi(a_2), \ldots, \varphi(a_n)\}$$ Have exactly $2n$ consecutive integers (in some order).

A white equilateral triangle $T$ with side length $2022$ is divided into equilateral triangles with side $1$ (cells) by lines parallel to the sides of $T$. We'll call two cells $\textit{adjacent}$ if they have a common vertex. Ivan colours some of the cells in black. Without knowing which cells are black, Peter chooses a set $S$ of cells and Ivan tells him the parity of the number of black cells in $S$. After knowing this, Peter is able to determine the parity of the number of $\textit{adjacent}$ cells of different colours. Find all possible cardinalities of $S$ such that this is always possible independent of how Ivan chooses to colour the cells.

A tetrahedron is given. Determine whether it is possible to put some 10 consecutive positive integers at 4 vertices and at 6 midpoints of the edges so that the number at the midpoint of each edge is equal to the arithmetic mean of two numbers at the endpoints of this edge.

Let $n > 1$ be a given integer. Prove that infinitely many terms of the sequence $(a_k )_{k\ge 1}$, defined by \[a_k=\left\lfloor\frac{n^k}{k}\right\rfloor,\] are odd. (For a real number $x$, $\lfloor x\rfloor$ denotes the largest integer not exceeding $x$.) [i]Proposed by Hong Kong[/i]

A positive integer $n$ is [i]Mozart[/i] if the decimal representation of the sequence $1, 2, \ldots, n$ contains each digit an even number of times. Prove that: 1. All Mozart numbers are even. 2. There are infinitely many Mozart numbers.

Is it possible to write the numbers from $1$ to $100$ in the cells of a of a $10 \times 10$ square so that: 1. Each cell contains exactly one number; 2. Each number is written exactly once; 3. For any two cells that are symmetrical with respect to any of the perpendicular bisectors of sides of the original $10 \times 10$ square, the numbers in them must have the same parity. The figure below shows examples of such pairs of cells, in which the numbers must have the same parity. [img]https://i.ibb.co/b3P8t36/Kyiv-MO-2024-7-2.png[/img] [i]Proposed by Mykhailo Shtandenko[/i]

Let $n > 1$ be a given integer. Prove that infinitely many terms of the sequence $(a_k )_{k\ge 1}$, defined by \[a_k=\left\lfloor\frac{n^k}{k}\right\rfloor,\] are odd. (For a real number $x$, $\lfloor x\rfloor$ denotes the largest integer not exceeding $x$.) [i]Proposed by Hong Kong[/i]

The numbers from $1$ to $n^2$ are written in order in a grid of $n \times n$, one number in each square, in such a way that the first row contains the numbers from $1$ to $n$ from left to right; the second row contains the numbers $n + 1$ to $2n$ from left to right, and so on and so forth. An allowed move on the grid consists in choosing any two adjacent squares (i.e. two squares that share a side), and add (or subtract) the same integer to both of the numbers that appear on those squares. Find all values of $n$ for which it is possible to make every squares to display $0$ after making any number of moves as necessary and, for those cases in which it is possible, find the minimum number of moves that are necessary to do this.

Assume that $a$ and $b$ are natural numbers with $a \ge b$ so that $ \sqrt{a+\sqrt{a^2-b^2}}$ is a natural number. Show that $a$ and $b$ have the same parity.

Let $L_1=1$, $L_2=3$, and $L_{n+2}=L_{n+1}+L_n$ for $n\geq1$. How many terms in the sequence $L_1, L_2, L_3, \dots, L_{2023}$ are even? $\textbf{(A) }673\qquad\textbf{(B) }1011\qquad\textbf{(C) }675\qquad\textbf{(D) }1010\qquad\textbf{(E) }674$

Let $n > 1$ be a given integer. Prove that infinitely many terms of the sequence $(a_k )_{k\ge 1}$, defined by \[a_k=\left\lfloor\frac{n^k}{k}\right\rfloor,\] are odd. (For a real number $x$, $\lfloor x\rfloor$ denotes the largest integer not exceeding $x$.) [i]Proposed by Hong Kong[/i]

Consider the sequence of natural numbers $a_n$ defined as $a_0=4$ and $a_{n+1}=\frac{a_n(a_n-1)}{2}$ for each $n\geq 0$. Define a new sequence $b_n$ as follows: $b_n=0$ if $a_n$ is even, and $b_n=1$ if $a_n$ is odd. Prove that for each natural $m$, the sequence \[b_m, b_{m+1}, b_{m+2},b_{m+3}, \dots\] is not periodic.

Let $n$ be a positive odd integer , $a_1,a_2,\cdots,a_n$ be any permutation of the positive integers $1,2,\cdots,n$ . Prove that :$(a_1-1)(a^2_2-2)(a^3_3-3)\cdots (a^n_n-n)$ is an even number.

The numbers $1, 2, 3, \dots, 1024$ are written on a blackboard. They are divided into pairs. Then each pair is wiped off the board and non-negative difference of its numbers is written on the board instead. $512$ numbers obtained in this way are divided into pairs and so on. One number remains on the blackboard after ten such operations. Determine all its possible values. [i]Proposed by A. Golovanov[/i]

Let $a_j$, $b_j$, $c_j$ be integers for $1 \le j \le N$. Assume for each $j$, at least one of $a_j$, $b_j$, $c_j$ is odd. Show that there exists integers $r, s, t$ such that $ra_j+sb_j+tc_j$ is odd for at least $\tfrac{4N}{7}$ values of $j$, $1 \le j \le N$.

We have $2021$ colors and $2021$ chips of each color. We place the $2021^2$ chips in a row. We say that a chip $F$ is [i]bad[/i] if there is an odd number of chips that have a different color to $F$ both to the left and to the right of $F$. (a) Determine the minimum possible number of bad chips. (b) If we impose the additional condition that each chip must have at least one adjacent chip of the same color, determine the minimum possible number of bad chips.

Define a complexity of a set $a_1,a_2,\dots,$ consisting of 0 and 1 to be the smallest positive integer $k$ such that for some positive integers $\epsilon_1,\epsilon_2,\dots, \epsilon_k$ each number of the sequence $a_n$, $n>k$, has the same parity as $\epsilon_1 a_{n-1}+\epsilon_2 a_{n-2}+\dots+\epsilon_k a_{n-k}$. Sequence $a_1,a_2,\dots,$ has a complexity of $1000$. What is the complexity of sequence $1-a_1,1-a_2,\dots,$. [I]Proposed by A. Kirichenko[/i]

$\boxed{N1}$Let $n$ be a positive integer,$g(n)$ be the number of positive divisors of $n$ of the form $6k+1$ and $h(n)$ be the number of positive divisors of $n$ of the form $6k-1,$where $k$ is a nonnegative integer.Find all positive integers $n$ such that $g(n)$ and $h(n)$ have different parity.

$P$ is a convex polyhedron such that: [b](1)[/b] every vertex belongs to exactly $3$ faces. [b](1)[/b] For every natural number $n$, there are even number of faces with $n$ vertices. An ant walks along the edges of $P$ and forms a non-self-intersecting cycle, which divides the faces of this polyhedron into two sides, such that for every natural number $n$, the number of faces with $n$ vertices on each side are the same. (assume this is possible) Show that the number of times the ant turns left is the same as the number of times the ant turn right.

Let $n > 1$ be a given integer. Prove that infinitely many terms of the sequence $(a_k )_{k\ge 1}$, defined by \[a_k=\left\lfloor\frac{n^k}{k}\right\rfloor,\] are odd. (For a real number $x$, $\lfloor x\rfloor$ denotes the largest integer not exceeding $x$.) [i]Proposed by Hong Kong[/i]

Prove that the parity of each term of the sequence $ \left( \left\lfloor \left( \lfloor \sqrt q \rfloor +\sqrt{q} \right)^n \right\rfloor \right)_{n\ge 1} $ is opposite to the parity of its index, where $ q $ is a squarefree natural number.

Suppose $r \ge 2$ is an integer, and let $m_1, n_1, m_2, n_2, \dots, m_r, n_r$ be $2r$ integers such that $$\left|m_in_j-m_jn_i\right|=1$$ for any two integers $i$ and $j$ satisfying $1 \le i<j \le r$. Determine the maximum possible value of $r$. [i]Proposed by B Sury[/i]

Let $a, b$ be positive integers. Prove that if $a^b + b^a \equiv 3 \pmod{4}$, then either $a+1$ or $b+1$ can't be written as the sum of two integer squares. [i](Proposed by Orestis Lignos, Greece)[/i]

Let $n > 1$ be a given integer. Prove that infinitely many terms of the sequence $(a_k )_{k\ge 1}$, defined by \[a_k=\left\lfloor\frac{n^k}{k}\right\rfloor,\] are odd. (For a real number $x$, $\lfloor x\rfloor$ denotes the largest integer not exceeding $x$.) [i]Proposed by Hong Kong[/i]