Let $n{}$ and $m$ be positive integers, $n>m>1$. Let $n{}$ divided by $m$ have partial quotient $q$ and remainder $r$ (so that $n = qm + r$, where $r\in\{0,1,...,m-1\}$). Let $n-1$ divided by $m$ have partial quotient $q^{'}$ and remainder $r^{'}$. a) It appears that $q+q^{'} =r +r^{'} = 99$. Find all possible values of $n{}$. b) Prove that if $q+q^{'} =r +r^{'}$, then $2n$ is a perfect square.

Let $M$ denote the set of $m\times n$ matrices with entries in the set $\{0,1,2,3,4\}$ such that in each row and each column the sum of elements is divisible by $5$. Find the cardinality of set $M$.

[u]Round 5[/u] [b]5.1.[/b] A triangle has lengths such that one side is $12$ less than the sum of the other two sides, the semi-perimeter of the triangle is $21$, and the largest and smallest sides have a difference of $2$. Find the area of this triangle. [b]5.2.[/b] A rhombus has side length $85$ and diagonals of integer lengths. What is the sum of all possible areas of the rhombus? [b]5.3.[/b] A drink from YAKSHAY’S SHAKE SHOP is served in a container that consists of a cup, shaped like an upside-down truncated cone, and a semi-spherical lid. The ratio of the radius of the bottom of the cup to the radius of the lid is $\frac23$ , the volume of the combined cup and lid is $296\pi$, and the height of the cup is half of the height of the entire drink container. What is the volume of the liquid in the cup if it is filled up to half of the height of the entire drink container? [u]Round 6[/u] [i]Each answer in the next set of three problems is required to solve a different problem within the same set. There is one correct solution to all three problems; however, you will receive points for any correct answer regardless whether other answers are correct.[/i] [b]6.1.[/b] Let the answer to problem $2$ be $b$. There are b people in a room, each of which is either a truth-teller or a liar. Person $1$ claims “Person $2$ is a liar,” Person $2$ claims “Person $3$ is a liar,” and so on until Person $b$ claims “Person $1$ is a liar.” How many people are truth-tellers? [b]6.2.[/b] Let the answer to problem $3$ be $c$. What is twice the area of a triangle with coordinates $(0, 0)$, $(c, 3)$ and $(7, c)$ ? [b]6.3.[/b] Let the answer to problem $ 1$ be $a$. Compute the smaller zero to the polynomial $x^2 - ax + 189$ which has $2$ integer roots. [u]Round 7[/u] [b]7.1. [/b]Sir Isaac Neeton is sitting under a kiwi tree when a kiwi falls on his head. He then discovers Neeton’s First Law of Kiwi Motion, which states: [i]Every minute, either $\left\lfloor \frac{1000}{d} \right\rfloor$ or $\left\lceil \frac{1000}{d} \right\rceil$ kiwis fall on Neeton’s head, where d is Neeton’s distance from the tree in centimeters.[/i] Over the next minute, $n$ kiwis fall on Neeton’s head. Let $S$ be the set of all possible values of Neeton’s distance from the tree. Let m and M be numbers such that $m < x < M$ for all elements $x$ in $S$. If the least possible value of $M - m$ is $\frac{2000}{16899}$ centimeters, what is the value of $n$? Note that $\lfloor x \rfloor$ is the greatest integer less than or equal to $x$, and $\lceil x \rceil$ is the least integer greater than or equal to $x$. [b]7.2.[/b] Nithin is playing chess. If one queen is randomly placed on an $ 8 \times 8$ chessboard, what is the expected number of squares that will be attacked including the square that the queen is placed on? (A square is under attack if the queen can legally move there in one move, and a queen can legally move any number of squares diagonally, horizontally or vertically.) [b]7.3.[/b] Nithin is writing binary strings, where each character is either a $0$ or a $1$. How many binary strings of length $12$ can he write down such that $0000$ and $1111$ do not appear? [u]Round 8[/u] [b]8.[/b] What is the period of the fraction $1/2018$? (The period of a fraction is the length of the repeated portion of its decimal representation.) Your answer will be scored according to the following formula, where $X$ is the correct answer and $I$ is your input. $$max \left\{ 0, \left\lceil min \left\{13 - \frac{|I-X|}{0.1 |I|}, 13 - \frac{|I-X|}{0.1 |I-2X|} \right\} \right\rceil \right\}$$ PS. You should use hide for answers. Rounds 1-4 have been posted [url=https://artofproblemsolving.com/community/c3h2765571p24215461]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Show that $n!=a^{n-1}+b^{n-1}+c^{n-1}$ has only finitely many solutions in positive integers. [i]Proposed by Dorlir Ahmeti, Albania[/i]

A function $f:\mathbb N\to\mathbb N$, where $\mathbb N$ is the set of positive integers, satisfies the following condition: for any positive integers $m$ and $n$ ($m>n$) the number $f(m)-f(n)$ is divisible by $m-n$. Is the function $f$ necessarily a polynomial? (In other words, is it true that for any such function there exists a polynomial $p(x)$ with real coefficients such that $f(n)=p(n)$ for all positive integers $n$?) [i](Folklore)[/i]

Let $a,x,y$ be positive integer such that $a>100,x>100,y>100$ and $y^2-1=a^2(x^2-1)$ . Find the minimum value of $\frac{a}{x}$.

The sequence $ \{ a_n \} _ { n \ge 0 } $ is defined by $ a_0 = 2 , a_1 = 4 $ and \[ a_{n+1} = \frac{a_n a_{n-1}}{2} + a_n + a_{n-1} \] for all positive integers $ n $. Determine all prime numbers $ p $ for which there exists a positive integer $ m $ such that $ p $ divides the number $ a_m - 1 $.

Find all odd integers $k$ for which there exists a positive integer $m$ satisfying the equation $k + (k + 5) + (k + 10) + ... + (k + 5(m - 1)) = 1372$.

Prove that any integer has a multiple consisting of all ten digits $\{0,1,2,3,4,5,6,7,8,9\}$. \\ [i]Note: Any digit can be repeated any number of times[/i]

The four-digit number written on the board can be replaced by another, adding one to its two adjacent digits, if neither of these digits is not equal to $9$; or, subtracting one from the adjacent two digits, if none of them is equal to $0$. Is it possible using such operations from does the number $1234$ get the number $2002$?

Find all positive integers $l$ for which the equation \[ a^3+b^3+ab=(lab+1)(a+b) \] has a solution over positive integers $a,b$.

Find the greatest positive integer $N$ with the following property: there exist integers $x_1, . . . , x_N$ such that $x^2_i - x_ix_j$ is not divisible by $1111$ for any $i\ne j.$

Given $n \geq 3$ pairwise different prime numbers $p_1, p_2, ....,p_n$. Given, that for any $k \in \{ 1,2,....,n \}$ residue by division of $ \prod_{i \neq k} p_i$ by $p_k$ equals one number $r$. Prove, that $r \leq n-2 $.

Let $(a_n )_{n\ge 1}$ be a sequence of integers that satisfies \[a_n = a_{n-1} -\text{min}(a_{n-2} , a_{n-3} )\] for all $n \ge 4$. Prove that for every positive integer $k$, there is an $n$ such that $a_n$ is divisible by $3^k$ .

Prove that the rectangle $m\times n$ table can be filled with exact squares so, that the sums in the rows and the sums in the columns will be exact squares also.

A polynomial $P(x)$ is called [i]nice[/i] if $P(0) = 1$ and the nonzero coefficients of $P(x)$ alternate between $1$ and $-1$ when written in order. Suppose that $P(x)$ is nice, and let $m$ and $n$ be two relatively prime positive integers. Show that \[Q(x) = P(x^n) \cdot \frac{(x^{mn} - 1)(x-1)}{(x^m-1)(x^n-1)}\] is nice as well.

Let $a$ be a positive integer, $a<100$, and $a^3+23$ is a multiple of $24$. Then, the number of such $a$ is $\text{(A)}4\qquad\text{(B)}5\qquad\text{(C)}9\qquad\text{(D)}10$

Which of the followings is false for the sequence $9,99,999,\dots$? $\textbf{(A)}$ The primes which do not divide any term of the sequence are finite. $\textbf{(B)}$ Infinitely many primes divide infinitely many terms of the sequence. $\textbf{(C)}$ For every positive integer $n$, there is a term which is divisible by at least $n$ distinct prime numbers. $\textbf{(D)}$ There is an inteter $n$ such that every prime number greater than $n$ divides infinitely many terms of the sequence. $\textbf{(E)}$ None of above

Find the least positive integer $m$ such that $105| 9^{(p^2)} -29^p +m$ for all prime numbers $p > 3$.

Let $\mathbb N$ be the set of positive integers. Find all functions $f: \mathbb N \to \mathbb N$ that satisfy the equation \[ f^{abc-a}(abc) + f^{abc-b}(abc) + f^{abc-c}(abc) = a + b + c \] for all $a,b,c \ge 2$. (Here $f^1(n) = f(n)$ and $f^k(n) = f(f^{k-1}(n))$ for every integer $k$ greater than $1$.)

Find the largest integer that is a factor of $(a-b)(b-c)(c-d)(d-a)(a-c)(b-d)$ for all integers $a,b,c,d$.

Let $b$ be a number greater than $5$. For each positive integer $n$, consider the number $$x_n=\underbrace{11\ldots1}_{n-1}\underbrace{22\ldots2}_n5,$$ written in base $b$. Prove that the following condition holds if and only if $b=10$: There exists a positive integer $M$ such that for every integer $n$ greater than $M$, the number $x_n$ is a perfect square.

The [i]fragments [/i] of a positive integer are the numbers seen when reading one or more of its digits in order. The [i]fragment sum[/i] equals the sum of all the fragments, including the number itself. For example, the fragment sum of $2022$ is $2022+202+022+20+02+22+2+0+2+2 = 2296$. There is another four-digit number with the same fragment sum. What is it? As the example shows, if a fragment occurs multiple times, then all its occurrences are added, and the fragments beginning with $0$ also count (for instance, $022$ is worth $22$).

Fix an odd prime number $p$. Find the largest positive integer $n$ such that there exist points $A_1,A_2,\cdots,A_n$ in the plane with integral coordinates, no three points are collinear. Moreover, for any $1\le i<j<k\le n$, $p \nmid 2S_{\Delta A_iA_j A_k}.$

Find the least positive integer $N$ such that the set of $1000$ consecutive integers beginning with $1000 \cdot N$ contains no square of an integer.