There are $2025$ positive integers $a_1, a_2, \cdots, a_{2025}$ are placed around a circle. For any $k = 1, 2, \cdots, 2025$, $a_k \mid a_{k-1} + a_{k+1}$ where indices are considered modulo $n$. Prove that there exists a positive integer $N$ such that satisfies the following condition. [list] [*] [b](Condition)[/b] For any positive integer $n > N$, when $a_1 = n^n$, $a_1, a_2, \cdots, a_{2025}$ are all multiples of $n$. [/list]

Let $ q_{0}, q_{1}, \cdots$ be a sequence of integers such that a) for any $ m > n$, $ m \minus{} n$ is a factor of $ q_{m} \minus{} q_{n}$, b) item $ |q_n| \le n^{10}$ for all integers $ n \ge 0$. Show that there exists a polynomial $ Q(x)$ satisfying $ q_{n} \equal{} Q(n)$ for all $ n$.

Let $N = 15! = 15\cdot 14\cdot 13 ... 3\cdot 2\cdot 1$. Prove that $N$ can be written as a product of nine different integers all between $16$ and $30$ inclusive.

Let $p(n) = n^4-6n^2-160$. If $a_n$ is the least odd prime dividing $q(n) = |p(n-30) \cdot p(n+30)|$, find $\sum_{n=1}^{2017} a_n$. ($a_n = 3$ if $q(n) = 0$.)

Determine all pairs $(a,b)$ of non-negative integers, such that $a^b+b$ divides $a^{2b}+2b$. (Remark: $0^0=1$.)

A positive integer $m$ is alpine if $m$ divides $2^{2n+1} + 1$ for some positive integer $n$. Show that the product of two alpine numbers is alpine.

Let $p$ be a prime number and $a, k$ be positive integers such that $p^a<k<2p^a$. Prove that there exists a positive integer $n$ such that \[n<p^{2a}, C_n^k\equiv n\equiv k\pmod {p^a}.\]

Find set of positive integers divisible with $8$ which sum of digits is $7$ and product is $6$

For how many ordered pairs of positive integers $(a, b)$ such that $a \le 50$ is it true that $x^2 - ax + b$ has integer roots?

Find all pairs of prime natural numbers $(p, q)$ for which the value of the expression $\frac{p}{q}+\frac{p+1}{q+1}$ is an integer.

Is there a natural number $ n > 10^{1000}$ which is not divisible by 10 and which satisfies: in its decimal representation one can exchange two distinct non-zero digits such that the set of prime divisors does not change.

For any $h = 2^{r}$ ($r$ is a non-negative integer), find all $k \in \mathbb{N}$ which satisfy the following condition: There exists an odd natural number $m > 1$ and $n \in \mathbb{N}$, such that $k \mid m^{h} - 1, m \mid n^{\frac{m^{h}-1}{k}} + 1$.

Determine all positive integers $n$ such that $\frac{a^2+n^2}{b^2-n^2}$ is a positive integer for some $a,b\in \mathbb{N}$. $Turkey$

Prove that there exists infinitely many positive integers $n$ such that $n, n+1$, and $n+2$ can be written as the sum of two perfect squares.

Does there exist two infinite positive integer sets $S,T$, such that any positive integer $n$ can be uniquely expressed in the form $$n=s_1t_1+s_2t_2+\ldots+s_kt_k$$ ,where $k$ is a positive integer dependent on $n$, $s_1<\ldots<s_k$ are elements of $S$, $t_1,\ldots, t_k$ are elements of $T$?

For a positive integer $a$, $a'$ is the integer obtained by the following method: the decimal writing of $a'$ is the inverse of the decimal writing of $a$ (the decimal writing of $a'$ can begin by zeros, but not the one of $a$); for instance if $a=2370$, $a'=0732$, that is $732$. Let $a_{1}$ be a positive integer, and $(a_{n})_{n \geq 1}$ the sequence defined by $a_{1}$ and the following formula for $n \geq 1$: \[a_{n+1}=a_{n}+a'_{n}. \] Can $a_{7}$ be prime?

Find all pairs of positive integers $(m,n)$, for which $$(m^n-n)^m=n!+m$$ [i]D. Volkovets[/i]

Let $p\ge5$ be a prime and let $r$ be the number of ways of placing $p$ checkers on a $p\times p$ checkerboard so that not all checkers are in the same row (but they may all be in the same column). Show that $r$ is divisible by $p^5$. Here, we assume that all the checkers are identical.

Let $n$ be a natural number. We define sequences $\langle a_i\rangle$ and $\langle b_i\rangle$ of integers as follows. We let $a_0=1$ and $b_0=n$. For $i>0$, we let $$\left( a_i,b_i\right)=\begin{cases} \left(2a_{i-1}+1,b_{i-1}-a_{i-1}-1\right) & \text{if } a_{i-1}<b_{i-1},\\ \left( a_{i-1}-b_{i-1}-1,2b_{i-1}+1\right) & \text{if } a_{i-1}>b_{i-1},\\ \left(a_{i-1},b_{i-1}\right) & \text{if } a_{i-1}=b_{i-1}.\end{cases}$$ Given that $a_k=b_k$ for some natural number $k$, prove that $n+3$ is a power of two.

Create $2024$ by $2024$ grid of integers numbered from $1$ to $2024^2$ such that the integer in row $n$ and column $k$ is $2024(n-1)+k$. Let the sum of the numbers in the grid be $S$. Arthur picks 2024 numbers such that their sum is $\dfrac{S}{2024}$. Prove that in every case, using the remaining numbers, Bob can create 2023 sets of 2024 numbers with equal numbers. For clarification, All numbers can only be used once

The natural numbers $m$ and $k$ satisfy the equality $$1001 \cdot 1002 \cdot ... \cdot 2010 \cdot 2011 = 2^m (2k + 1)$$. Find the number $m$.

Find all natural numbers $m$ having exactly three prime divisors $p,q,r$, such that $$p-1\mid m; \quad qr-1 \mid m; \quad q-1 \nmid m; \quad r-1 \nmid m; \quad 3 \nmid q+r.$$

[b]p1.[/b] Solve the equation $x^2 - x - cos y+1.25 =0$. [b]p2.[/b] Solve the inequality: $\left| \frac{x - 2}{x - 3}\right| \le x$ [b]p3.[/b] Bilbo and Dwalin are seated at a round table of radius $R$. Bilbo places a coin of radius $r$ at the center of the table, then Dwalin places a second coin as near to the table’s center as possible without overlapping the first coin. The process continues with additional coins being placed as near as possible to the center of the table and in contact with as many coins as possible without overlap. The person who places the last coin entirely on the table (no overhang) wins the game. Assume that $R/r$ is an integer. (a) Who wins, Bilbo or Dawalin? Please justify your answer. (b) How many coins are on the table when the game ends? [b]p4.[/b] In the center of a square field is an orc. Four elf guards are on the vertices of that square. The orc can run in the field, the elves only along the sides of the square. Elves run $\$1.5$ times faster than the orc. The orc can kill one elf but cannot fight two of them at the same time. Prove that elves can keep the orc from escaping from the field. [b]p5.[/b] Nine straight roads cross the Mirkwood which is shaped like a square, with an area of $120$ square miles. Each road intersects two opposite sides of the square and divides the Mirkwood into two quadrilaterals of areas $40$ and $80$ square miles. Prove that there exists a point in the Mirkwood which is an intersection of at least three roads. PS. You should use hide for answers.

Prove that there exists infinitely many positive integers $n$ such that $n^2+1$ has a prime divisor greater than $2n+\sqrt{5n+2011}$.

$\mathbb{Z}[x]$ represents the set of all polynomials with integer coefficients. Find all functions $f:\mathbb{Z}[x]\rightarrow \mathbb{Z}[x]$ such that for any 2 polynomials $P,Q$ with integer coefficients and integer $r$, the following statement is true. \[P(r)\mid Q(r) \iff f(P)(r)\mid f(Q)(r).\] (We define $a|b$ if and only if $b=za$ for some integer $z$. In particular, $0|0$.) [i]Proposed by the4seasons.[/i]