The numbers $1$ through $9$ are written on a $3 \times 3$ board, without repetitions. A valid operation is to choose a row or a column of the board, and replace its three numbers $a, b, c$ (in order, i.e., the first number of the row/column is $a$, the second number of the row/column is $b$, the third number of the row/column is $c$) with either the three non-negative numbers $a-x, b-x, c+x$ (in order) or with the three non-negative numbers $a+x, b-x, c-x$ (in order), where $x$ is a real positive number which may vary in each operation . a) Determine if there is a way of getting all $9$ numbers on the board to be the same, starting with the following board: $\begin{array}{|c|c|c|c|c|c|c|c|} \hline 1 & 2 & 3 \\ \hline 4 & 5 & 6 \\ \hline 7 & 8 & 9 \\ \hline \end{array}$ b) For all posible configurations such that it is possible to get all $9$ numbers to be equal to a number $m$ using the valid operations, determine the maximum value of $m$.

In a group of $m$ girls and $n$ boys, any two persons either know each other or do not know each other. For any two boys and any two girls, there are at least one boy and one girl among them,who do not know each other. Prove that the number of unordered pairs of (boy, girl) who know each other does not exceed $m+\frac{n(n-1)}{2}$.

Let $E$ and $F$ be the intersections of opposite sides of a convex quadrilateral $ABCD$. The two diagonals meet at $P$. Let $O$ be the foot of the perpendicular from $P$ to $EF$. Show that $\angle BOC=\angle AOD$.

One integer was removed from the set $S=\left \{ 1,2,3,...,n \right \}$ of the integers from $1$ to $n$. The arithmetic mean of the other integers of $S$ is equal to $\frac{163}{4}$. What integer was removed ?

Consider the triangle $ABC$, where $\angle B= 30^o, \angle C = 15^o$, and $M$ is the midpoint of the side $[BC]$. Let point $N \in (BC)$ be such that $[NC] = [AB]$. Show that $[AN$ is the angle bisector of $MAC$

Suppose that we have a countable set $A$ of balls and a unit cube in $\mathbb R^3$. Assume that for every finite subset $B$ of $A$ it is possible to put all balls of $B$ into the cube in such a way that they have disjoint interiors. Show that it is possible to arrange all the balls in the cube so that all of them have pairwise disjoint interiors.

Let $a$, $b$, $c$ be positive integers such that $29a + 30b + 31c = 366$. Find $19a + 20b + 21c$.

Given a real number $a$, we define a sequence by $x_0 = 1$, $x_1 = x_2 = a$, and $x_{n+1} = 2x_nx_{n-1} - x_{n-2}$ for $n \ge 2$. Prove that if $x_n = 0$ for some $n$, then the sequence is periodic.

There are two matrices $A$ and $B$ of size $m\times n$ each filled only by “0”s and “1”s. It is given that along any row or column its elements do not decrease (from left to right and from top to bottom).It is also given that the numbers of “1”s in both matrices are equal and for any $k = 1, . . .$ , $m$ the sum of the elements in the top $k$ rows of the matrix $A$ is no less than that of the matrix $B$. Prove for any $l = 1, . . . $, $n$ the sum of the elements in left $l$ columns of the matrix $A$ is no greater than that of the matrix $B$.

For two sets $A, B$, define the operation $$A \otimes B = \{x \mid x=ab+a+b, a \in A, b \in B\}.$$ Set $A=\{0, 2, 4, \cdots, 18\}$ and $B=\{98, 99, 100\}$. Compute the sum of all the elements in $A \otimes B$. [i](Source: China National High School Mathematics League 2021, Zhejiang Province, Problem 7)[/i]

Let $\gamma$ be a semicircle with diameter $AB$ . A creek is built with origin in $A$ , which has its vertices alternately in the diameter $AB$ and in the semicircle $\gamma$ , so that its sides make equal angles $\alpha$ with the diameter (but alternately in either direction). It is requested: a) Values of the angle $\alpha$ for the ravine to pass through the other end $B$ of the diameter. b) The total length of the ravine, in the case that it ends in $B$ , as a function of the length $d$ of the diameter and of the angle $\alpha$ . [img]https://cdn.artofproblemsolving.com/attachments/3/c/54c71cdf1bf8fbb3bdfa38f4b14a1dc961c5fe.png[/img]

How many perfect cubes lie between $2^8+1$ and $2^{18}+1$, inclusive? $\textbf{(A) }4\qquad\textbf{(B) }9\qquad\textbf{(C) }10\qquad\textbf{(D) }57\qquad \textbf{(E) }58$

A triangle with sides $a,b,c$ is called a good triangle if $a^2,b^2,c^2$ can form a triangle. How many of below triangles are good? (i) $40^{\circ}, 60^{\circ}, 80^{\circ}$ (ii) $10^{\circ}, 10^{\circ}, 160^{\circ}$ (iii) $110^{\circ}, 35^{\circ}, 35^{\circ}$ (iv) $50^{\circ}, 30^{\circ}, 100^{\circ}$ (v) $90^{\circ}, 40^{\circ}, 50^{\circ}$ (vi) $80^{\circ}, 20^{\circ}, 80^{\circ}$ $ \textbf{(A)}\ 1 \qquad\textbf{(B)}\ 2 \qquad\textbf{(C)}\ 3 \qquad\textbf{(D)}\ 4 \qquad\textbf{(E)}\ 5 $

Prove that the equation $3y^2 = x^4 + x$ has no positive integer solutions.

Find all pairs of positive integers $(p; q) $such that both the equations $x^2- px + q = 0 $ and $ x^2 -qx + p = 0 $ have integral solutions.

The volume of a certain rectangular solid is $216\text{ cm}^3$, its total surface area is $288\text{ cm}^2$, and its three dimensions are in geometric progression. Find the sum of the lengths in cm of all the edges of this solid.

For every $n\geq 3$, determine all the configurations of $n$ distinct points $X_1,X_2,\ldots,X_n$ in the plane, with the property that for any pair of distinct points $X_i$, $X_j$ there exists a permutation $\sigma$ of the integers $\{1,\ldots,n\}$, such that $\textrm{d}(X_i,X_k) = \textrm{d}(X_j,X_{\sigma(k)})$ for all $1\leq k \leq n$. (We write $\textrm{d}(X,Y)$ to denote the distance between points $X$ and $Y$.) [i](United Kingdom) Luke Betts[/i]

$ABCDEF GH$ is a regular octagon with $10$ units side . The circle with center $A$ and radius $AC$ intersects the circle with center $D$ and radius $CD$ at point $ I$, different from $C$. What is the length of the segment $IF$?

A positive integer is called [i]fancy[/i] if it can be expressed in the form $$2^{a_1}+2^{a_2}+ \cdots+ 2^{a_{100}},$$ where $a_1,a_2, \cdots, a_{100}$ are non-negative integers that are not necessarily distinct. Find the smallest positive integer $n$ such that no multiple of $n$ is a [i]fancy[/i] number. [i]Senior Problems Committee of the Australian Mathematical Olympiad Committee[/i]

Find all quadruples $(a, b, c, d)$ of non-negative integers such that $ab =2(1 + cd)$ and there exists a non-degenerate triangle with sides of length $a - c$, $b - d$, and $c + d$.

Suppose a grid with $2m$ rows and $2n$ columns is given, where $m$ and $n$ are positive integers. You may place one pawn on any square of this grid, except the bottom left one or the top right one. After placing the pawn, a snail wants to undertake a journey on the grid. Starting from the bottom left square, it wants to visit every square exactly once, except the one with the pawn on it, which the snail wants to avoid. Moreover, it wants to finish in the top right square. It can only move horizontally or vertically on the grid. On which squares can you put the pawn for the snail to be able to finish its journey?

Barney Schwinn notices that the odometer on his bicycle reads $1441$, a palindrome, because it reads the same forward and backward. After riding $4$ more hours that day and $6$ the next, he notices that the odometer shows another palindrome, $1661$. What was his average speed in miles per hour? $\textbf{(A)}\ 15\qquad \textbf{(B)}\ 16\qquad \textbf{(C)}\ 18\qquad \textbf{(D)}\ 20\qquad \textbf{(E)}\ 22$

Let $W,X,Y$ and $Z$ be points on a circumference $\omega$ with center $O$, in that order, such that $WY$ is perpendicular to $XZ$; $T$ is their intersection. $ABCD$ is the convex quadrilateral such that $W,X,Y$ and $Z$ are the tangency points of $\omega$ with segments $AB,BC,CD$ and $DA$ respectively. The perpendicular lines to $OA$ and $OB$ through $A$ and $B$, respectively, intersect at $P$; the perpendicular lines to $OB$ and $OC$ through $B$ and $C$, respectively, intersect at $Q$, and the perpendicular lines to $OC$ and $OD$ through $C$ and $D$, respectively, intersect at $R$. $O_1$ is the circumcenter of triangle $PQR$. Prove that $T,O$ and $O_1$ are collinear. [i]Proposed by CDMX[/i]

$ \Delta_1,\ldots,\Delta_n$ are $ n$ concurrent segments (their lines concur) in the real plane. Prove that if for every three of them there is a line intersecting these three segments, then there is a line that intersects all of the segments.

Let $a$ and $b$ real numbers. Let $f:[a,b] \rightarrow \mathbb{R}$ a continuous function. We say that f is "smp" if $[a,b]=[c_0,c_1]\cup[c_1,c_2]...\cup[c_{n-1},c_n]$ satisfying $c_0<c_1...<c_n$ and for each $i\in\{0,1,2...n-1\}$: $c_i<x<c_{i+1} \Rightarrow f(c_i)<f(x)<f(c_{i+1})$ or $c_i>x>c_{i+1} \Rightarrow f(c_i)>f(x)>f(c_{i+1})$ Prove that if $f:[a,b] \rightarrow \mathbb{R}$ is continuous such that for each $v\in\mathbb{R}$ there are only finitely many $x$ satisfying $f(x)=v$, then $f$ is "smp".