Kobar and Borah are playing on a whiteboard with the following rules: They start with two distinct positive integers on the board. On each step, beginning with Kobar, each player takes turns changing the numbers on the board, either from $P$ and $Q$ to $2P-Q$ and $2Q-P$, or from $P$ and $Q$ to $5P-4Q$ and $5Q-4P$. The game ends if a player writes an integer that is not positive. That player is declared to lose, and the opponent is declared the winner. At the beginning of the game, the two numbers on the board are $2024$ and $A$. If it is known that Kobar does not lose on his first move, determine the largest possible value of $A$ so that Borah can win this game.

If the ratio $$\frac{17m+43n}{m-n}$$ is an integer where $m$ and $n$ positive integers, let's call $(m,n)$ is a special pair. How many numbers can be selected from $1,2,..., 2021$, any two of which do not form a special pair?

Let $x, y$ be distinct positive integers. Prove that the number $$\frac{(x+y)^2}{ x^3 + xy^2 - x^2y - y^3}$$ is not an integer

Let $P(x)$ be a polynomial with integer coefficients of degree $n \ge 3$. If $x_1,...,x_m$ ($n\ge m\ge3$) are different integers such that $P(x_1) = P(x_2) = ... = P(x_m) = 1$, prove that $P$ cannot have integer roots$.

$\textbf{N1.}$ Find all nonnegative integers $a,b,c$ such that \begin{align*} a^2+b^2+c^2-ab-bc-ca = a+b+c \end{align*} [i]Proposed by usjl[/i]

(a) Determine all pairs $(x, y)$ of (real) numbers with $0 < x < 1$ and $0 <y < 1$ for which $x + 3y$ and $3x + y$ are both integer. An example is $(x,y) =( \frac{8}{3}, \frac{7}{8}) $, because $ x+3y =\frac38 +\frac{21}{8} =\frac{24}{8} = 3$ and $ 3x+y = \frac98 + \frac78 =\frac{16}{8} = 2$. (b) Determine the integer $m > 2$ for which there are exactly $119$ pairs $(x,y)$ with $0 < x < 1$ and $0 < y < 1$ such that $x + my$ and $mx + y$ are integers. Remark: if $u \ne v,$ the pairs $(u, v)$ and $(v, u)$ are different.

Let $n \ge 2$ be an integer and $M= \{1,2,\ldots,n\}.$ For each $k \in \{1,2,\ldots,n-1\}$ we define $$x_k= \frac{1}{n+1} \sum_{\substack{A \subset M \\ |A|=k}} (\min A + \max A).$$ Prove that the numbers $x_k$ are integers and not all of them are divisible by $4.$ [hide=Notations]$|A|$ is the cardinal of $A$ $\min A$ is the smallest element in $A$ $\max A$ is the largest element in $A$[/hide]

In the beginning there are $100$ integers in a row on the blackboard. Kain and Abel then play the following game: A [i]move[/i] consists in Kain choosing a chain of consecutive numbers; the length of the chain can be any of the numbers $1,2,\dots,100$ and in particular it is allowed that Kain only chooses a single number. After Kain has chosen his chain of numbers, Abel has to decide whether he wants to add $1$ to each of the chosen numbers or instead subtract $1$ from of the numbers. After that the next move begins, and so on. If there are at least $98$ numbers on the blackboard that are divisible by $4$ after a move, then Kain has won. Prove that Kain can force a win in a finite number of moves.

Solve the equation $x^2+y^4+1=6^z$ in the set of integers.

Find the least positive integer $n$, such that there is a polynomial \[ P(x) = a_{2n}x^{2n}+a_{2n-1}x^{2n-1}+\dots+a_1x+a_0 \] with real coefficients that satisfies both of the following properties: - For $i=0,1,\dots,2n$ it is $2014 \leq a_i \leq 2015$. - There is a real number $\xi$ with $P(\xi)=0$.

For every positive integer $n$, let $p(n)$ denote the number of sets $\{x_1, x_2, \dots, x_k\}$ of integers with $x_1 > x_2 > \dots > x_k > 0$ and $n = x_1 + x_3 + x_5 + \dots$ (the right hand side here means the sum of all odd-indexed elements). As an example, $p(6) = 11$ because all satisfying sets are as follows: $$\{6\}, \{6, 5\}, \{6, 4\}, \{6, 3\}, \{6, 2\}, \{6, 1\}, \{5, 4, 1\}, \{5, 3, 1\}, \{5, 2, 1\}, \{4, 3, 2\}, \{4, 3, 2, 1\}.$$ Show that $p(n)$ equals to the number of partitions of $n$ for every positive integer $n$.

For a natural number $b$, let $N(b)$ denote the number of natural numbers $a$ for which the equation $x^2 + ax + b = 0$ has integer roots. What is the smallest value of $b$ for which $N(b) = 20$?

Given $\lambda^3 - 2\lambda^2- 1 = 0$ for some real $\lambda$ prove that $[\lambda[\lambda[\lambda n]]] - n$ is odd for any positive integer $n$ . (I Voronovich)

Let $a_1 = 1, a_2, a_3,...$: be a sequence of positive integers such that $$a_k < 1 + a_1 + a_2 +... + a_{k-1}$$ for all $k > 1$. Prove that every positive integer can be expressed as a sum of $a_i$s.

Let $n$ and $k$ be two positive integers. Prove that if $n$ is relatively prime with $30$, then there exist two integers $a$ and $b$, each relatively prime with $n$, such that $\frac{a^2 - b^2 + k}{n}$ is an integer. Malik Talbi

Determine all pairs $(a, b)$ of positive integers for which $\frac{a^2b+b}{ab^2+9}$ is an integer number.

Let $a$ and $b$ be positive integers such that $$\frac{5a^4+a^2}{b^4+3b^2+4}$$ is an integer. Prove that $a$ is not a prime number.

Let $a$ and $b$ be positive integers such that $\frac{5a^4 + a^2}{b^4 + 3b^2 + 4}$ is an integer. Show that $a$ is not prime.

Let $n \geq 2$ be an integer. Prove that if $$\frac{n^2+4^n+7^n}{n}$$ is an integer, then it is divisible by 11.

Find all integer solutions $(m,n)$ to $m^{n}=n^{m}.$

Define a sequence $<x_n>$ by $x_0 = 0$ and $$\large x_n = \left\{ \begin{array}{ll} x_{n-1} + \frac{3^r-1}{2} & if \,\,n = 3^{r-1}(3k + 1)\\ & \\ x_{n-1} - \frac{3^r+1}{2} & if \,\, n = 3^{r-1}(3k + 2)\\ \end{array} \right. $$ where $k, r$ are integers. Prove that every integer occurs exactly once in the sequence.

In a triangle $ \vartriangle ABC $ with sides integer numbers, it is known that the radius of the circumcircle circumscribed to $ \vartriangle ABC $ measures $ \dfrac {65} {8} $ centimeters and the area is $84$ cm². Determine the lengths of the sides of the triangle.

Determine all functions $f\colon\mathbb{Z}_{>0}\to\mathbb{Z}_{>0}$ such that, for all positive integers $a$ and $b$, \[ f^{bf(a)}(a+1)=(a+1)f(b). \]

Albrecht writes numbers on the points of the first quadrant with integer coordinates in the following way: If at least one of the coordinates of a point is 0, he writes 0; in all other cases the number written on point $(a, b)$ is one greater than the average of the numbers written on points $ (a+1 , b-1) $ and $ (a-1,b+1)$ . Which numbers could he write on point $(121, 212)$? Note: The elements of the first quadrant are points where both of the coordinates are non- negative.

The function is given $f(x) = \frac{2x^3 -6x^2 + 13x + 10}{2x^2 - 9x}$. Determine all positive integers $x$ for which $f(x)$ is an integer