Let $a$ denote the positive real root of the polynomial $x^2 -3x-2$. Compute the remainder when $\lfloor a^{1000}\rfloor $ is divided by the prime number $997$. Here, $\lfloor r\rfloor$ denotes the greatest integer less than $r$.

Natural numbers are written in the cells of of a $2014\times2014$ regular square grid such that every number is the average of the numbers in the adjacent cells. Describe and prove how the number distribution in the grid can be.

For every natural $n$ let $a_n=20\dots 018$ with $n$ ceros, for example, $a_1=2018, a_3=200018, a_7=2000000018$. Prove that there are infinity values of $n$ such that $2018$ divides $a_n$

Find all positive integer(s) $n$ such that $n^2+32n+8$ is a perfect square.

Find digits $x, y, z$ such that the equality \[\sqrt{\underbrace{\overline{xx\cdots x}}_{2n \text{ times}}-\underbrace{\overline{yy\cdots y}}_{n \text{ times}}}=\underbrace{\overline{zz\cdots z}}_{n \text{ times}}\] holds for at least two values of $n \in \mathbb N$, and in that case find all $n$ for which this equality is true.

Let $a,b$ and $c$ be positive integers such that $a!+b+c,b!+c+a$ and $c!+a+b$ are prime numbers. Show that $\frac{a+b+c+1}{2}$ is also a prime number.

$x_{1},x_{2},\dots,x_{n}$ are real number such that for each $i$, the set $\{x_{1},x_{2},\dots,x_{n}\}\backslash \{x_{i}\}$ could be partitioned into two sets that sum of elements of first set is equal to the sum of the elements of the other. Prove that all of $x_{i}$'s are zero. [hide="Hint"]It is a number theory problem.[/hide]

For how many ordered pairs of positive integers $ (m,n)$, $ m \cdot n$ divides $ 2008 \cdot 2009 \cdot 2010$ ? $\textbf{(A)}\ 2\cdot3^7\cdot 5 \qquad\textbf{(B)}\ 2^5\cdot3\cdot 5 \qquad\textbf{(C)}\ 2^5\cdot3^7\cdot 5 \qquad\textbf{(D)}\ 2^3\cdot3^5\cdot 5^2 \qquad\textbf{(E)}\ \text{None}$

Determine all possible digits $z$ for which $\underbrace{9...9}_{100}z\underbrace{0...0}_{100}9$ is a square number.

Tanya chose a natural number $X\le100$, and Sasha is trying to guess this number. He can select two natural numbers $M$ and $N$ less than $100$ and ask about $\gcd(X+M,N)$. Show that Sasha can determine Tanya's number with at most seven questions.

Is it possible to fill the cells of a table of size $2019\times2019$ with pairwise distinct positive integers in such a way that in each rectangle of size $1\times2$ or $2\times1$ the larger number is divisible by the smaller one, and the ratio of the largest number in the table to the smallest one is at most $2019^4?$

Determine the number of positive integers $a$, so that there exist nonnegative integers $x_0,x_1,\ldots,x_{2001}$ which satisfy the equation \[ \displaystyle a^{x_0} = \sum_{i=1}^{2001} a^{x_i} \]

For $r> 0$ denote by $B_r$ the set of points at distance at most $r$ length units from the origin. If $P_r$ is the set of the points in $B_r$ whit integer coordinates, show that the equation $$xy^3z + 2x^3z^3-3x^5y = 0$$ has an odd number of solutions $(x, y, z)$ in $P_r$.

[u]Round 1[/u] [b]p1.[/b] What is $2 + 22 + 1 + 3 - 31 - 3$? [b]p2.[/b] Let $ABCD$ be a rhombus. Given $AB = 5$, $AC = 8$, and $BD = 6$, what is the perimeter of the rhombus? [b]p3.[/b] There are $2$ hats on a table. The first hat has $3$ red marbles and 1 blue marble. The second hat has $2$ red marbles and $4$ blue marbles. Jordan picks one of the hats randomly, and then randomly chooses a marble from that hat. What is the probability that she chooses a blue marble? [u]Round 2[/u] [b]p4.[/b] There are twelve students seated around a circular table. Each of them has a slip of paper that they may choose to pass to either their clockwise or counterclockwise neighbor. After each person has transferred their slip of paper once, the teacher observes that no two students exchanged papers. In how many ways could the students have transferred their slips of paper? [b]p5.[/b] Chad wants to test David's mathematical ability by having him perform a series of arithmetic operations at lightning-speed. He starts with the number of cubic centimeters of silicon in his 3D printer, which is $109$. He has David perform all of the following operations in series each second: $\bullet$ Double the number $\bullet$ Subtract $4$ from the number $\bullet$ Divide the number by $4$ $\bullet$ Subtract $5$ from the number $\bullet$ Double the number $\bullet$ Subtract $4$ from the number Chad instructs David to shout out after three seconds the result of three rounds of calculations. However, David computes too slowly and fails to give an answer in three seconds. What number should David have said to Chad? [b]p6.[/b] Points $D, E$, and $F$ lie on sides $BC$, $CA$, and $AB$ of triangle $ABC$, respectively, such that the following length conditions are true: $CD = AE = BF = 2$ and $BD = CE = AF = 4$. What is the area of triangle $ABC$? [u]Round 3[/u] [b]p7.[/b] In the $2, 3, 5, 7$ game, players count the positive integers, starting with $1$ and increasing, which do not contain the digits $2, 3, 5$, and $7$, and also are not divisible by the numbers $2, 3, 5$, and $7$. What is the fifth number counted? [b]p8.[/b] If A is a real number for which $19 \cdot A = \frac{2014!}{1! \cdot 2! \cdot 2013!}$ , what is $A$? Note: The expression $k!$ denotes the product $k \cdot (k - 1) \cdot ...\cdot 2 \cdot 1$. [b]p9.[/b] What is the smallest number that can be written as both $x^3 + y^2$ and $z^3 + w^2$ for positive integers $x, y, z,$ and $w$ with $x \ne z$? [u]Round 4[/u] [i]Each of the three problems in this round depends on the answer to one of the other problems. There is only one set of correct answers to these problems; however, each problem will be scored independently, regardless of whether the answers to the other problems are correct. In addition, it is given that the answer to each of the following problems is a positive integer less than or equal to the problem number. [/i] [b]p10.[/b] Let $B$ be the answer to problem $11$ and let $C$ be the answer to problem $12$. What is the sum of a side length of a square with perimeter $B$ and a side length of a square with area $C$? [b]p11.[/b] Let $A$ be the answer to problem $10$ and let $C$ be the answer to problem $12$. What is $(C - 1)(A + 1) - (C + 1)(A - 1)$? [b]p12.[/b] Let $A$ be the answer to problem $10$ and let $B$ be the answer to problem $11$. Let $x$ denote the positive difference between $A$ and $B$. What is the sum of the digits of the positive integer $9x$? PS. You should use hide for answers. Rounds 5-8 have been posted [url=https://artofproblemsolving.com/community/c3h2915810p26040675]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Prove that the equation $4^x +6^x =9^x$ has no rational solutions.

A rational number $ x$ is called [i]good[/i] if it satisfies: $ x\equal{}\frac{p}{q}>1$ with $ p$, $ q$ being positive integers, $ \gcd (p,q)\equal{}1$ and there exists constant numbers $ \alpha$, $ N$ such that for any integer $ n\geq N$, \[ |\{x^n\}\minus{}\alpha|\leq\dfrac{1}{2(p\plus{}q)}\] Find all the good numbers.

Let $m$ be a positive integer and $x_0, y_0$ integers such that $x_0, y_0$ are relatively prime, $y_0$ divides $x_0^2+m$, and $x_0$ divides $y_0^2+m$. Prove that there exist positive integers $x$ and $y$ such that $x$ and $y$ are relatively prime, $y$ divides $x^2 + m$, $x$ divides $y^2 + m$, and $x + y \leq m+ 1.$

Find all triples $(a, b, c)$ of positive integers such that $a \leq b$ and \[a!+b!=c^4+2024\] [i]Proposed by Otgonbayar Uuye.[/i]

Let $ n$ be a given positive integer. Find the smallest positive integer $ u_n$ such that for any positive integer $ d$, in any $ u_n$ consecutive odd positive integers, the number of them that can be divided by $ d$ is not smaller than the number of odd integers among $ 1, 3, 5, \ldots, 2n \minus{} 1$ that can be divided by $ d$.

Let a, b, and c be nonzero integers. Show that there exists an integer k such that $$gcd\left(a+kb, c\right) = gcd\left(a, b, c\right)$$

Two sets of positive integers $A, B$ are called [i]connected [/i] if they are not empty and for all $a \in A, b \in B$, number $ab + 1$ is a perfect square. i) Given $A =\{1, 2,3, 4\}$. Prove that there does not exist any set $B$ such that $A, B$ are connected. ii) Suppose that $A, B$ are connected with $|A|,|B| \ge 2$. For any $a_1 > a_2 \in A$ and $b_1 > b_2 \in B$, prove that $a_1b_1 > 13a_2b_2$.

$100$ schoolchildren took part in the Mathematical Olympiad. $4$ tasks were proposed. The first problem was solved by $90$ people, the second by $80$, the third by $70$ and the fourth by $60$. However, no one solved all the problems. Students who solved both the third and fourth questions received an award. How many students were awarded?

Use each of the digits 1,2,3,4,5,6,7,8,9 exactly twice to form distinct prime numbers whose sum is as small as possible. What must this minimal sum be? (Note: The five smallest primes are 2,3,5,7, and 11)

For polynomials $P(x) = a_nx^n + \cdots + a_0$, let $f(P) = a_n\cdots a_0$ be the product of the coefficients of $P$. The polynomials $P_1,P_2,P_3,Q$ satisfy $P_1(x) = (x-a)(x-b)$, $P_2(x) = (x-a)(x-c)$, $P_3(x) = (x-b)(x-c)$, $Q(x) = (x-a)(x-b)(x-c)$ for some complex numbers $a,b,c$. Given $f(Q) = 8$, $f(P_1) + f(P_2) + f(P_3) = 10$, and $abc>0$, find the value of $f(P_1)f(P_2)f(P_3)$. [i]Proposed by Justin Hsieh[/i]

Denote by $F_n$ the $n^{\text{th}}$ Fibonacci number $(F_1=F_2=1)$.Prove that if $a,b,c$ are positive integers such that $a| F_b,b|F_c,c|F_a$,then either $5$ divides each of $a,b,c$ or $12$ divides each of $a,b,c$.