Two positive real numbers $\alpha, \beta$ satisfies that for any positive integers $k_1,k_2$, it holds that $\lfloor k_1 \alpha \rfloor \neq \lfloor k_2 \beta \rfloor$, where $\lfloor x \rfloor$ denotes the largest integer less than or equal to $x$. Prove that there exist positive integers $m_1,m_2$ such that $\frac{m_1}{\alpha}+\frac{m_2}{\beta}=1$.

Find the smallest $\lambda \in \mathbb{R}$ such that for all $n \in \mathbb{N}_+$, there exists $x_1, x_2, \ldots, x_n$ satisfying $n = x_1 x_2 \ldots x_{2023}$, where $x_i$ is either a prime or a positive integer not exceeding $n^\lambda$ for all $i \in \left\{ 1,2, \ldots, 2023 \right\}$. [i]Proposed by Yinghua Ai[/i]

Denote by $d(n)$ the number of distinct positive divisors of a positive integer $n$ (including $1$ and $n$). Let $a>1$ and $n>0$ be integers such that $a^n+1$ is a prime. Prove that $d(a^n-1)\ge n$.

[b]p1.[/b] Triangle $ABC$ has side lengths $AB = 3^2$ and $BC = 4^2$. Given that $\angle ABC$ is a right angle, determine the length of $AC$. [b]p2.[/b] Suppose $m$ and $n$ are integers such that $m^2+n^2 = 65$. Find the largest possible value of $m-n$. [b]p3.[/b] Six middle school students are sitting in a circle, facing inwards, and doing math problems. There is a stack of nine math problems. A random student picks up the stack and, beginning with himself and proceeding clockwise around the circle, gives one problem to each student in order until the pile is exhausted. Aditya falls asleep and is therefore not the student who picks up the pile, although he still receives problem(s) in turn. If every other student is equally likely to have picked up the stack of problems and Vishwesh is sitting directly to Aditya’s left, what is the probability that Vishwesh receives exactly two problems? [b]p4.[/b] Paul bakes a pizza in $15$ minutes if he places it $2$ feet from the fire. The time the pizza takes to bake is directly proportional to the distance it is from the fire and the rate at which the pizza bakes is constant whenever the distance isn’t changed. Paul puts a pizza $2$ feet from the fire at $10:30$. Later, he makes another pizza, puts it $2$ feet away from the fire, and moves the first pizza to a distance of $3$ feet away from the fire instantly. If both pizzas finish baking at the same time, at what time are they both done? [b]p5.[/b] You have $n$ coins that are each worth a distinct, positive integer amount of cents. To hitch a ride with Charon, you must pay some unspecified integer amount between $10$ and $20$ cents inclusive, and Charon wants exact change paid with exactly two coins. What is the least possible value of $n$ such that you can be certain of appeasing Charon? [b]p6.[/b] Let $a, b$, and $c$ be positive integers such that $gcd(a, b)$, $gcd(b, c)$ and $gcd(c, a)$ are all greater than $1$, but $gcd(a, b, c) = 1$. Find the minimum possible value of $a + b + c$. [b]p7.[/b] Let $ABC$ be a triangle inscribed in a circle with $AB = 7$, $AC = 9$, and $BC = 8$. Suppose $D$ is the midpoint of minor arc $BC$ and that $X$ is the intersection of $\overline{AD}$ and $\overline{BC}$. Find the length of $\overline{BX}$. [b]p8.[/b] What are the last two digits of the simplified value of $1! + 3! + 5! + · · · + 2009! + 2011!$ ? [b]p9.[/b] How many terms are in the simplified expansion of $(L + M + T)^{10}$ ? [b]p10.[/b] Ben draws a circle of radius five at the origin, and draws a circle with radius $5$ centered at $(15, 0)$. What are all possible slopes for a line tangent to both of the circles? PS. You had better use hide for answers.

$2 \ 000 \ 000$ points with integer coordinates are marked on the numeric axis. Segments of lengths $97$, $100$ and $103$ with ends at these points are considered. What is the largest number of such segments?

Let $a, b, c$ be natural numbers such that $a+b+c = 2pq(p^{30}+q^{30}), p > q$ being two given positive integers. $(a)$ Prove that $k = a^3 + b^3 + c^3$ is not a prime number. $(b)$ Prove that if $a\cdot b\cdot c$ is maximum, then $1984$ divides $k$.

Find the smallest natural number $n$ for which there exists a natural number $x$ such that $$(x+1)^3 + (x + 2)^3 + (x + 3)^3 + (x + 4)^3 = (x + n)^3.$$

Find the greatest positive integer $n$ such that there exist positive integers $a_1, a_2, ..., a_n$ for which the following holds $a_{k+2} = \dfrac{(a_{k+1}+a_k)(a_{k+1}+1)}{a_k}$ for all $1 \le k \le n-2$. [i]Proposed by Mykhailo Shtandenko and Oleksii Masalitin[/i]

Let $ n>4$ be a positive integer such that $ n$ is composite (not a prime) and divides $ \varphi (n) \sigma (n) \plus{}1$, where $ \varphi (n)$ is the Euler's totient function of $ n$ and $ \sigma (n)$ is the sum of the positive divisors of $ n$. Prove that $ n$ has at least three distinct prime factors.

Find the number of positive integers that are equal to or equal to 1000 that have exactly 6 divisors that are perfect squares

Let $k \geq 2$ and $n_1, n_2, . . . , n_k \geq 1$ natural numbers having the property $n_2 | 2^{n_1} - 1, n_3 | 2^{n_2} -1 , \cdots, n_k | 2^{n_k-1}-1$, and $n_1 | 2^{n_k} - 1$. Show that $n_1 = n_2 = \cdots = n_k = 1.$

How many five digit numbers are divisible by $3$ and contain the digit $6$?

Let $n\ge2$ be an integer. Prove that if $k^2+k+n$ is prime for all integers $k$ such that $0\le k\le\sqrt{n\over3}$, then $k^2+k+n$ is prime for all integers $k$ such that $0\le k\le n-2$.[i](IMO Problem 6)[/i] [b][i]Original Formulation[/i][/b] Let $f(x) = x^2 + x + p$, $p \in \mathbb N.$ Prove that if the numbers $f(0), f(1), \cdots , f(\sqrt{p\over 3} )$ are primes, then all the numbers $f(0), f(1), \cdots , f(p - 2)$ are primes. [i]Proposed by Soviet Union. [/i]

Compute the sum of all positive integers $a\leq 26$ for which there exist integers $b$ and $c$ such that $a+23b+15c-2$ and $2a+5b+14c-8$ are both multiples of $26$.

Find all pairs of natural numbers $(p, n)$ with $p$ prime such that $p^6+p^5+n^3+n=n^5+n^2$.

Does there exist a natural number $n \geq 2$ such that: a) $\frac{2^{n-1}+1}{n}$ is a natural number? b) $\frac{2^{2n-1}-1}{n}$ is a prime number?

There is a set of control weights, each of them weighs a non-integer number of grams. Any integer weight from $1$ g to $40$ g can be balanced by some of these weights (the control weights are on one balance pan, and the measured weight on the other pan).What is the least possible number of the control weights? [i](Alexandr Shapovalov)[/i]

The integers from $1$ to $999999$ are partitioned into two groups: the first group consists of those integers for which the closest perfect square is odd, whereas the second group consists of those for which the closest perfect square is even. In which group is the sum of the elements greater?

Find all pairs $(a,b)$ of non-negative integers such that: $$2017^a=b^6-32b+1$$ [i]proposed by Walther Janous[/i]

A number from $1$ to $144$ is guessed. You are allowed to select a subset of the set of numbers from $ 1$ to $144$ and ask whether the guessed number belongs to it. For the answer “yes” you have to pay $2$ rubles, for the answer “no” - $1$ ruble. What is the smallest amount of money needed to surely guess that?

Solve the equation \[(a^{2},b^{2})+(a,bc)+(b,ac)+(c,ab)=199.\] in positive integers. (Here $(x,y)$ denotes the greatest common divisor of $x$ and $y$.) [i]Proposed by S. Berlov[/i]

Find all positive integers n with the following property: For every positive divisor $d$ of $n$, $d+1$ divides $n+1$.

Determine all functions $f: \mathbb {N} \to \mathbb {N}$ such that $n!\hspace{1mm} +\hspace{1mm} f(m)!\hspace{1mm} |\hspace{1mm} f(n)!\hspace{1mm} +\hspace{1mm} f(m!)$, for all $m$, $n$ $\in$ $\mathbb{N}$.

If $\sqrt{\log_bn}=\log_b\sqrt n$ and $b\log_bn=\log_bbn,$ then the value of $n$ is equal to $\frac jk,$ where $j$ and $k$ are relatively prime. What is $j+k$?

Given a finite sequence of integers $a_{1},$ $a_{2},$ $...,$ $a_{n}$ for $n\geq 2.$ Show that there exists a subsequence $a_{k_{1}},$ $a_{k_{2}},$ $...,$ $a_{k_{m}},$ where $1\leq k_{1}\leq k_{2}\leq...\leq k_{m}\leq n,$ such that the number $a_{k_{1}}^{2}+a_{k_{2}}^{2}+...+a_{k_{m}}^{2}$ is divisible by $n.$ [b]Note by Darij:[/b] Of course, the $1\leq k_{1}\leq k_{2}\leq ...\leq k_{m}\leq n$ should be understood as $1\leq k_{1}<k_{2}<...<k_{m}\leq n;$ else, we could take $m=n$ and $k_{1}=k_{2}=...=k_{m},$ so that the number $a_{k_{1}}^{2}+a_{k_{2}}^{2}+...+a_{k_{m}}^{2}=n^{2}a_{k_{1}}^{2}$ will surely be divisible by $n.$