Let $\mathbb Z_{\ge 0}$ be the set of non-negative integers, and let $f:\mathbb Z_{\ge 0}\times \mathbb Z_{\ge 0} \to \mathbb Z_{\ge 0}$ be a bijection such that whenever $f(x_1,y_1) > f(x_2, y_2)$, we have $f(x_1+1, y_1) > f(x_2 + 1, y_2)$ and $f(x_1, y_1+1) > f(x_2, y_2+1)$. Let $N$ be the number of pairs of integers $(x,y)$ with $0\le x,y<100$, such that $f(x,y)$ is odd. Find the smallest and largest possible values of $N$.

Let $\mathbb{Z}_{>0}$ denote the set of positive integers. Consider a function $f: \mathbb{Z}_{>0} \to \mathbb{Z}_{>0}$. For any $m, n \in \mathbb{Z}_{>0}$ we write $f^n(m) = \underbrace{f(f(\ldots f}_{n}(m)\ldots))$. Suppose that $f$ has the following two properties: (i) if $m, n \in \mathbb{Z}_{>0}$, then $\frac{f^n(m) - m}{n} \in \mathbb{Z}_{>0}$; (ii) The set $\mathbb{Z}_{>0} \setminus \{f(n) \mid n\in \mathbb{Z}_{>0}\}$ is finite. Prove that the sequence $f(1) - 1, f(2) - 2, f(3) - 3, \ldots$ is periodic. [i]Proposed by Ang Jie Jun, Singapore[/i]

Some cells of a $10 \times 10$ are colored blue. A set of six cells is called [i]gremista[/i] when the cells are the intersection of three rows and two columns, or two rows and three columns, and are painted blue. Determine the greatest value of $n$ for which it is possible to color $n$ chessboard cells blue such that there is not a [i]gremista[/i] set.

The unit of a screw is listed as $0.2$ cents. When a group of screws is sold to a customer, the total cost of the screws is computed with the listed price and then rounded to the nearest cent. If Al has $50$ cents and wishes to only make one purchase, what is the maximum possible number of screws he can buy?

16 cities attend a football match. Each city has two teams: A and B. According to the rule, each team can compete with any other team of other cities at most once. After a few days, we find that except team A of city 1, the number of matches they've played are different. Then, how many matches have team A of city 1 played?

There are \(n+1\) squares in a row, labelled from 0 to \(n\). Tony starts with \(k\) stones on square 0. On each move, he may choose a stone and advance the stone up to \(m\) squares where \(m\) is the number of stones on the same square (including itself) or behind it. Tony's goal is to get all stones to square \(n\). Show that Tony cannot achieve his goal in fewer than \(\frac{n}{1} + \frac{n}{2} + \cdots + \frac{n}{k}\) moves. [i]Proposed by Tony Wang[/i]

Let be a ring $ R $ which has the property that there exist two distinct natural numbers $ s,t $ such that for any element $ x $ of $ R, $ the equation $ x^s=x^t $ is true. Show that there exists a polynom in $ R[X] $ of degree $$ |s-t|\left( 1+|s-t| \right) $$ such that all the elements of $ R $ are roots of it.

A tournament on $2k$ vertices contains no $7$-cycles. Show that its vertices can be partitioned into two sets, each with size $k$, such that the edges between vertices of the same set do not determine any $3$-cycles. [i]Calvin Deng.[/i]

For which values of positive integer $m$ is it possible to find polynomials $P, Q\in\mathbb{C} [x]$, with degrees at least two, such that \[x(x+1)\cdots(x+m-1)=P(Q(x)).\][i]Proposed by Navid Safaei, Tehran[/i]

$2021$ points on the plane in the convex position, no three collinear and no four concyclic, are given. Prove that there exist two of them such that every circle passing through these two points contains at least $673$ of the other points in its interior. (A finite set of points on the plane are in convex position if the points are the vertices of a convex polygon.)

How many integers of the form $n^{2023-n}$ are perfect squares, where $n$ is a positive integer between $1$ and $2023$ inclusive?

[b]p1.[/b] I open my $2010$-page dictionary, whose pages are numbered $ 1$ to $2010$ starting on page $ 1$ on the right side of the spine when opened, and ending with page $2010$ on the left. If I open to a random page, what is the probability that the two page numbers showing sum to a multiple of $6$? [b]p2.[/b] Let $A$ be the number of positive integer factors of $128$. Let $B$ be the sum of the distinct prime factors of $135$. Let $C$ be the units’ digit of $381$. Let $D$ be the number of zeroes at the end of $2^5\cdot 3^4 \cdot 5^3 \cdot 7^2\cdot 11^1$. Let $E$ be the largest prime factor of $999$. Compute $\sqrt[3]{\sqrt{A + B} +\sqrt[3]{D^C+E}}$. [b]p3. [/b] The root mean square of a set of real numbers is defined to be the square root of the average of the squares of the numbers in the set. Determine the root mean square of $17$ and $7$. [b]p4.[/b] A regular hexagon $ABCDEF$ has area $1$. The sides$ AB$, $CD$, and $EF$ are extended to form a larger polygon with $ABCDEF$ in the interior. Find the area of this larger polygon. [b]p5.[/b] For real numbers $x$, let $\lfloor x \rfloor$ denote the greatest integer less than or equal to $x$. For example, $\lfloor 3\rfloor = 3$ and $\lfloor 5.2 \rfloor = 5$. Evaluate $\lfloor -2.5 \rfloor + \lfloor \sqrt 2 \rfloor + \lfloor -\sqrt 2 \rfloor + \lfloor 2.5 \rfloor$. [b]p6.[/b] The mean of five positive integers is $7$, the median is $8$, and the unique mode is $9$. How many possible sets of integers could this describe? [b]p7.[/b] How many three digit numbers x are there such that $x + 1$ is divisible by $11$? [b]p8.[/b] Rectangle $ABCD$ is such that $AD = 10$ and $AB > 10$. Semicircles are drawn with diameters $AD$ and $BC$ such that the semicircles lie completely inside rectangle $ABCD$. If the area of the region inside $ABCD$ but outside both semicircles is $100$, determine the shortest possible distance between a point $X$ on semicircle $AD$ and $Y$ on semicircle $BC$. [b]p9.[/b] $ 8$ distinct points are in the plane such that five of them lie on a line $\ell$, and the other three points lie off the line, in a way such that if some three of the eight points lie on a line, they lie on $\ell$. How many triangles can be formed using some three of the $ 8$ points? [b]p10.[/b] Carl has $10$ Art of Problem Solving books, all exactly the same size, but only $9$ spaces in his bookshelf. At the beginning, there are $9$ books in his bookshelf, ordered in the following way. $A - B - C - D - E - F - G - H - I$ He is holding the tenth book, $J$, in his hand. He takes the books out one-by-one, replacing each with the book currently in his hand. For example, he could take out $A$, put $J$ in its place, then take out $D$, put $A$ in its place, etc. He never takes the same book out twice, and stops once he has taken out the tenth book, which is $G$. At the end, he is holding G in his hand, and his bookshelf looks like this. $C - I - H - J - F - B - E - D - A$ Give the order (start to finish) in which Carl took out the books, expressed as a $9$-letter string (word). PS. You had better use hide for answers.

If $a$ and $b$ satisfy the equations $a +\frac1b=4$ and $\frac1a+b=\frac{16}{15}$, determine the product of all possible values of $ab$.

Maria has a balance scale that can indicate which of its pans is heavier or whether they have equal weight. She also has 4 weights that look the same but have masses of 1001, 1002, 1004 and 1005g. Can Maria determine the mass of each weight in 4 weightings? The weights for a new weighing may be picked when the result of the previous ones is known. [i]The Jury[/i] (For the senior paper) The same question when the left pan of the scale is lighter by 1g than the right one, so the scale indicates equality when the mass on the left pan is heavier by 1g than the mass on the right pan. [i]Alexey Tolpygo[/i]

Let $ p\geq 5$ be a prime number.Prove that for any partition of the set $ P\equal{}\{1,2,3,...,p\minus{}1\}$ in $ 3$ subsets there exists numbers $ x,y,z$ each belonging to a distinct subset,such that $ x\plus{}y\equiv z (mod p)$

Find the maximal positive integer $n$, so that for any real number $x$ we have $\sin^{n}{x}+\cos^{n}{x} \geq \frac{1}{n}$.

Let $\mathbb{N} = \{1,2,3, \ldots\}$. Determine if there exists a strictly increasing function $f: \mathbb{N} \mapsto \mathbb{N}$ with the following properties: (i) $f(1) = 2$; (ii) $f(f(n)) = f(n) + n, (n \in \mathbb{N})$.

Let $H_n=\sum_{r=1}^{n} \frac{1}{r}$. Show that $$n-(n-1)n^{-1\slash (n-1)}>H_n>n(n+1)^{1\slash n}-n$$ for $n>2$.

Let $\triangle ABC$ be an acute-angled triangle and $A_1, B_1$, and $C_1$ be the feet of the altitudes from $A, B$, and $C$, respectively. On the rays $AA_1, BB_1$, and $CC_1$, we have points $A_2, B_2$, and $C_2$ respectively, lying outside of $\triangle ABC$, such that \[\frac{A_1A_2}{AA_1} = \frac{B_1B_2}{BB_1} = \frac{C_1C_2}{CC_1}.\] If the intersections of $B_1C_2$ and $B_2C_1$, $C_1A_2$ and $C_2A_1$, and $A_1B_2$ and $A_2B_1$ are $A', B'$, and $C'$ respectively, prove that $AA', BB'$, and $CC'$ have a common point.

A post service of some country uses carriers to transport the mail, each carrier’s task is to bring the mail from one city to a neighbouring city. It is known that it is possible to send mail from any city to the capital $P$ . For any two cities $A$ and $B$, call $B$ [i]more important than[/i] $A$, if every possible route of mail from $A$ to the capital $P$ goes through $B$. a) Prove that, for any three different cities $A, B$, and $C$, if $B$ is more important than $A$ and $C$ is more important than $B$, then $C$ is more important than $A$. b) Prove that, for any three different cities $A, B$, and $C$, if both B and C are more important than $A$, then either $C$ is more important than $B$ or $B$ is more important than $C$.

The circle $\omega$ lies inside the circle $\Omega$ and touches it internally at $T.$ Let $XY{}$ be a variable chord of the circle $\Omega$ touching $\omega.$ Denote by $X'$ and $Y'$ the midpoints of the arcs $TY{}$ and $TX{}$ which do not contain $X{}$ and $Y{}$ respectively. Prove that all possible lines $X'Y'$ pass through a fixed point. [i]Proposed by F. Petrov[/i]

Circles $k_1$ and $k_2$ intersect at points $M$ and $N$. The line $\ell$ intersects the circle $k_1$ at points $A$ and $C$, the circle $K_2$ at points $B$ and $D$ so that the points $A,B,C$ and $D$ lie on the line $\ell$ are in that order. Let $X$ a point on the line $MN$ such that the point $M$ is located between the points $X$ and $N$. Let $P$ be the intersection of lines $AX$ and $BM$, and $Q$ be the intersection of lines $DX$ and $CM$. If $K$ is the midpoint of segment $AD$ and $L$ is the midpoint of segment $BC$, prove that the lines $XK$ and $ML$ intersect on the line $PQ$.

Define the sequence $x_1, x_2, ...$ inductively by $x_1 = \sqrt{5}$ and $x_{n+1} = x_n^2 - 2$ for each $n \geq 1$. Compute $\lim_{n \to \infty} \frac{x_1 \cdot x_2 \cdot x_3 \cdot ... \cdot x_n}{x_{n+1}}$.

$1,000,000,000,000-777,777,777,777=$ $\text{(A)}\ 222,222,222,222 \qquad \text{(B)}\ 222,222,222,223 \qquad \text{(C)}\ 233,333,333,333 \\ \text{(D)}\ 322,222,222,223 \qquad \text{(E)}\ 333,333,333,333$

What is the maximum possible value of $k$ for which $2013$ can be written as a sum of $k$ consecutive positive integers?