Found problems: 700
Initially, $10$ ones are written on a blackboard. Grisha and Gleb are playing game, by taking turns; Grisha goes first. On one move Grisha squares some $5$ numbers on the board. On his move, Gleb picks a few (perhaps none) numbers on the board and increases each of them by $1$. If in $10,000$ moves on the board a number divisible by $2023$ appears, Gleb wins, otherwise Grisha wins. Which of the players has a winning strategy?
Find all prime numbers $a,b,c$ and positive integers $k$ satisfying the equation \[a^2+b^2+16c^2 = 9k^2 + 1.\]
Proposed by Moldova
Let $p$ be an odd prime number and $M$ a set derived from $\frac{p^2 + 1}{2}$ square numbers.
Investigate whether $p$ elements can be selected from this set whose arithmetic mean is an integer.
(Walther Janous)
Two coprime positive integers $ a, b $ are given. Integer sequence $ \{ a_n \}, \{b_n \} $ satisties
\[ (a+b \sqrt2 )^{2n} = a_n + b_n \sqrt2 \]
Find all prime numbers $ p $ such that there exist positive integer $ n \le p $ satisfying $ p | b_n $.
$200$ natural numbers are written in a row. For any two adjacent numbers of the row, the right one is either $9$ times greater than the left one, $2$ times smaller than the left one. Can the sum of all these 200 numbers be equal to $24^{2022}$?
Every point with integer coordinates in the plane is the center of a disk with radius $1/1000$.
(1) Prove that there exists an equilateral triangle whose vertices lie in different discs.
(2) Prove that every equilateral triangle with vertices in different discs has side-length greater than $96$.
[i]Radu Gologan, Romania[/i]
[hide="Remark"]
The "> 96" in [b](b)[/b] can be strengthened to "> 124". By the way, part [b](a)[/b] of this problem is the place where I used [url=http://mathlinks.ro/viewtopic.php?t=5537]the well-known "Dedekind" theorem[/url].
[/hide]
For a prime $p$, let $\mathbb{F}_p$ denote the integers modulo $p$, and let $\mathbb{F}_p[x]$ be the set of polynomials with coefficients in $\mathbb{F}_p$. Find all $p$ for which there exists a quartic polynomial $P(x) \in \mathbb{F}_p[x]$ such that for all integers $k$, there exists some integer $\ell$ such that $P(\ell) \equiv k \pmod p$. (Note that there are $p^4(p-1)$ quartic polynomials in $\mathbb{F}_p[x]$ in total.)
[i]Aprameya Tripathy[/i]
For which value of $A$, does the equation $3m^2n = n^3 + A$ have a solution in natural numbers?
$
\textbf{(A)}\ 301
\qquad\textbf{(B)}\ 403
\qquad\textbf{(C)}\ 415
\qquad\textbf{(D)}\ 427
\qquad\textbf{(E)}\ 481
$
Find all pairs of integers $(m,n)$ such that $m^6 = n^{n+1} + n -1$.
Let $p$ be a prime number. Prove that there exists a prime number $q$ such that for every integer $n$, the number $n^p-p$ is not divisible by $q$.
Let $d$ be any positive integer not equal to $2, 5$ or $13$. Show that one can find distinct $a,b$ in the set $\{2,5,13,d\}$ such that $ab-1$ is not a perfect square.
Let $p$ be a prime number. Prove that there exists a prime number $q$ such that for every integer $n$, the number $n^p-p$ is not divisible by $q$.
For each positive integer $n$, let $k(n)$ be the number of ones in the binary representation of $2023 \cdot n$. What is the minimum value of $k(n)$?
Show that for all integers $a \ge 1$,$ \lfloor \sqrt{a}+\sqrt{a+1}+\sqrt{a+2}\rfloor = \lfloor \sqrt{9a+8}\rfloor$
Let $\mathbb{N}$ be the set of all positive integers. Find all functions $f\colon \mathbb{N}\to \mathbb{N}$ such that $mf(m)+(f(f(m))+n)^2$ divides $4m^4+n^2f(f(n))^2$ for all positive integers $m$ and $n$.
Let $p$ be a prime. Suppose the mean of the nonzero quadratic residues mod $p$ is less than $\frac{p}{2}$. Show that the median of the nonzero quadratic residues mod $p$ is less than $\frac{p}{2}$.
Find all primes $p$ and $q$ such that $3p^{q-1}+1$ divides $11^p+17^p$
Proposed by Stanislav Dimitrov,Bulgaria
Every point with integer coordinates in the plane is the center of a disk with radius $1/1000$.
(1) Prove that there exists an equilateral triangle whose vertices lie in different discs.
(2) Prove that every equilateral triangle with vertices in different discs has side-length greater than $96$.
[i]Radu Gologan, Romania[/i]
[hide="Remark"]
The "> 96" in [b](b)[/b] can be strengthened to "> 124". By the way, part [b](a)[/b] of this problem is the place where I used [url=http://mathlinks.ro/viewtopic.php?t=5537]the well-known "Dedekind" theorem[/url].
[/hide]
Let $n$ be a positive integer. Show that if p is prime dividing $5^{4n}-5^{3n}+5^{2n}-5^{n}+1$, then $p\equiv 1 \;(\bmod\; 4)$.
For a prime $p$, let $\mathbb{F}_p$ denote the integers modulo $p$, and let $\mathbb{F}_p[x]$ be the set of polynomials with coefficients in $\mathbb{F}_p$. Find all $p$ for which there exists a quartic polynomial $P(x) \in \mathbb{F}_p[x]$ such that for all integers $k$, there exists some integer $\ell$ such that $P(\ell) \equiv k \pmod p$. (Note that there are $p^4(p-1)$ quartic polynomials in $\mathbb{F}_p[x]$ in total.)
[i]Aprameya Tripathy[/i]
For any odd prime $p$ and any integer $n,$ let $d_p (n) \in \{ 0,1, \dots, p-1 \}$ denote the remainder when $n$ is divided by $p.$ We say that $(a_0, a_1, a_2, \dots)$ is a [i]p-sequence[/i], if $a_0$ is a positive integer coprime to $p,$ and $a_{n+1} =a_n + d_p (a_n)$ for $n \geqslant 0.$
(a) Do there exist infinitely many primes $p$ for which there exist $p$-sequences $(a_0, a_1, a_2, \dots)$ and $(b_0, b_1, b_2, \dots)$ such that $a_n >b_n$ for infinitely many $n,$ and $b_n > a_n$ for infinitely many $n?$
(b) Do there exist infinitely many primes $p$ for which there exist $p$-sequences $(a_0, a_1, a_2, \dots)$ and $(b_0, b_1, b_2, \dots)$ such that $a_0 <b_0,$ but $a_n >b_n$ for all $n \geqslant 1?$
[I]United Kingdom[/i]
Find all positive integers $m$ that have some multiple of the form $x^2+5y^2+2024$, with $x$ and $y$ integers.
Prove that $5^n-3^n$ is not divisible by $2^n+65$ for any positive integer $n$.
Let $m > 1$ be an integer. A sequence $a_1, a_2, a_3, \ldots$ is defined by $a_1 = a_2 = 1$, $a_3 = 4$, and for all $n \ge 4$, $$a_n = m(a_{n - 1} + a_{n - 2}) - a_{n - 3}.$$
Determine all integers $m$ such that every term of the sequence is a square.
Finding all quads of integers $(a, b, c, p)$ where $p \ge 5$ is prime number such that the remainders of the numbers $am^3 + bm^2 + cm$, $m = 0, 1, . . . , p - 1$, upon division of $p$ are two by two different..