A $12 \times 12$ board is divided into $144$ unit squares by drawing lines parallel to the sides. Two rooks placed on two unit squares are said to be non-attacking if they are not in the same column or same row. Find the least number $N$ such that if $N$ rooks are placed on the unit squares, one rook per square, we can always find $7$ rooks such that no two are attacking each other.

The five pieces shown below can be arranged to form four of the five figures shown in the choices. Which figure [b]cannot[/b] be formed? [asy] defaultpen(linewidth(0.6)); size(80); real r=0.5, s=1.5; path p=origin--(1,0)--(1,1)--(0,1)--cycle; draw(p); draw(shift(s,r)*p); draw(shift(s,-r)*p); draw(shift(2s,2r)*p); draw(shift(2s,0)*p); draw(shift(2s,-2r)*p); draw(shift(3s,3r)*p); draw(shift(3s,-3r)*p); draw(shift(3s,r)*p); draw(shift(3s,-r)*p); draw(shift(4s,-4r)*p); draw(shift(4s,-2r)*p); draw(shift(4s,0)*p); draw(shift(4s,2r)*p); draw(shift(4s,4r)*p);[/asy] [asy] size(350); defaultpen(linewidth(0.6)); path p=origin--(1,0)--(1,1)--(0,1)--cycle; pair[] a={(0,0), (0,1), (0,2), (0,3), (0,4), (1,0), (1,1), (1,2), (2,0), (2,1), (3,0), (3,1), (3,2), (3,3), (3,4)}; pair[] b={(5,3), (5,4), (6,2), (6,3), (6,4), (7,1), (7,2), (7,3), (7,4), (8,0), (8,1), (8,2), (9,0), (9,1), (9,2)}; pair[] c={(11,0), (11,1), (11,2), (11,3), (11,4), (12,1), (12,2), (12,3), (12,4), (13,2), (13,3), (13,4), (14,3), (14,4), (15,4)}; pair[] d={(17,0), (17,1), (17,2), (17,3), (17,4), (18,0), (18,1), (18,2), (18,3), (18,4), (19,0), (19,1), (19,2), (19,3), (19,4)}; pair[] e={(21,4), (22,1), (22,2), (22,3), (22,4), (23,0), (23,1), (23,2), (23,3), (23,4), (24,1), (24,2), (24,3), (24,4), (25,4)}; int i; for(int i=0; i<15; i=i+1) { draw(shift(a[i])*p); draw(shift(b[i])*p); draw(shift(c[i])*p); draw(shift(d[i])*p); draw(shift(e[i])*p); } [/asy] \[ \textbf{(A)}\qquad\qquad\qquad\textbf{(B)}\quad\qquad\qquad\textbf{(C)}\:\qquad\qquad\qquad\textbf{(D)}\quad\qquad\qquad\textbf{(E)} \]

Let $a_1, a_2, \ldots, a_{2023}$ be nonnegative real numbers such that $a_1 + a_2 + \ldots + a_{2023} = 100$. Let $A = \left \{ (i,j) \mid 1 \leqslant i \leqslant j \leqslant 2023, \, a_ia_j \geqslant 1 \right\}$. Prove that $|A| \leqslant 5050$ and determine when the equality holds. [i]Proposed by Yunhao Fu[/i]

Find all integers $x$ and $y$ satisfying the following equation $x^2 - 2xy + 5y^2 + 2x - 6y - 3 = 0$.

The symbol $|a|$ means $a$ is a positive number or zero, and $-a$ if $a$ is a negative number. For all real values of $t$ the expression $\sqrt{t^4+t^2}$ is equal to: ${{ \textbf{(A)}\ t^3 \qquad\textbf{(B)}\ t^2+t \qquad\textbf{(C)}\ |t^2+t| \qquad\textbf{(D)}\ t\sqrt{t^2+1} }\qquad\textbf{(E)}\ |t|\sqrt{1+t^2} } $

For every integer $n\geq 1$ prove that $$\frac{1}{n+1}-\frac{2}{n+2}+\frac{3}{n+3}-\frac{4}{n+4}+...+\frac{2n-1}{3n-1}>\frac{1}{3}.$$

Consider a $12$-card deck containing all four suits of $2, 3,$ and $4.$ A [i]double[/i] is defined as two cards directly next to each other in the deck, with the same value. Suppose we scan the deck left to right, and whenever we encounter a double, we remove all the cards up to that point (including the double). Let $N$ denote the number of times we have to remove cards. What is the expected value of $N$?

Let $X_1, X_2, \ldots$ be independent random variables of the same distribution such that their joint distribution is discrete and is concentrated on infinitely many different values. Let $a_n$ denote the probability that $X_1,\ldots, X_{n+1}$ are all different on the condition that $X_1,\ldots, X_n$ are all different ($n\ge 1$). Show that (a) $a_n$ is strictly decreasing and tends to $0$ as $n\to \infty$; and (b) for any sequence $1\le f(1)\le f(2) < \ldots$ of positive integers the joint distribution of $X_1, X_2, \ldots$ can be chosen such that $$\limsup_{n\to\infty}\frac{a_{f(n)}}{a_n}=1$$ holds.

Let $ABC$ be an acute triangle with circumcenter $O$, and select $E$ on $\overline{AC}$ and $F$ on $\overline{AB}$ so that $\overline{BE} \perp \overline{AC}$, $\overline{CF} \perp \overline{AB}$. Suppose $\angle EOF - \angle A = 90^{\circ}$ and $\angle AOB - \angle B = 30^{\circ}$. If the maximum possible measure of $\angle C$ is $\tfrac mn \cdot 180^{\circ}$ for some positive integers $m$ and $n$ with $m < n$ and $\gcd(m,n)=1$, compute $m+n$. [i]Proposed by Evan Chen[/i]

Solve the equation $~$ $x^4+2y^4+4z^4+8t^4=16xyzt$ $~$ in the set of integer numbers.

Find all functions $f: \mathbb{Z} \to \mathbb{Z}$, such that $$f(x+y)((f(x) - f(y))^2+f(xy))=f(x^3)+f(y^3)$$ for all integers $x, y$.

Let $x_1,x_2,\dots,x_{2023}$ be pairwise different positive real numbers such that \[a_n=\sqrt{(x_1+x_2+\dots+x_n)\left(\frac{1}{x_1}+\frac{1}{x_2}+\dots+\frac{1}{x_n}\right)}\] is an integer for every $n=1,2,\dots,2023.$ Prove that $a_{2023} \geqslant 3034.$

We have a bipartite graph $G$ (with parts $X$ and $Y$). We orient each edge arbitrarily. [i]Hessam[/i] chooses a vertex at each turn and reverse the orientation of all edges that $v$ is one of their endpoint. Prove that with these steps we can reach to a graph that for each vertex $v$ in part $X$, $\deg^{+}(v)\geq \deg^{-}(v)$ and for each vertex in part $Y$, $\deg^{+}v\leq \deg^{-}v$

Prove that for positive integers $ x,y,z$ the number $ x^2 \plus{} y^2 \plus{} z^2$ is not divisible by $ 3(xy \plus{} yz \plus{} zx)$.

For real numbers $ a,\ b$ such that $ |a|\neq |b|$, let $ I_n \equal{} \int \frac {1}{(a \plus{} b\cos \theta)^n}\ (n\geq 2)$. Prove that : $ \boxed{\boxed{I_n \equal{} \frac {a}{a^2 \minus{} b^2}\cdot \frac {2n \minus{} 3}{n \minus{} 1}I_{n \minus{} 1} \minus{} \frac {1}{a^2 \minus{} b^2}\cdot\frac {n \minus{} 2}{n \minus{} 1}I_{n \minus{} 2} \minus{} \frac {b}{a^2 \minus{} b^2}\cdot\frac {1}{n \minus{} 1}\cdot \frac {\sin \theta}{(a \plus{} b\cos \theta)^{n \minus{} 1}}}}$

Let $ABC$ be a triangle with circumcircle $\omega$ . Point $D$ lies on the arc $BC$ of $\omega$ and is different than $B,C$ and the midpoint of arc $BC$. Tangent of $\Gamma$ at $D$ intersects lines $BC$, $CA$, $AB$ at $A',B',C'$, respectively. Lines $BB'$ and $CC'$ intersect at $E$. Line $AA'$ intersects the circle $\omega$ again at $F$. Prove that points $D,E,F$ are collinear. (Saudi Arabia)

Arbitrary triangle $ABC$ is given (with $AB<BC$). Let $M$ - midpoint of $AC$, $N$- midpoint of arc $AC$ of circumcircle $ABC$, which is contains point $B$. Let $I$ - in-center of $ABC$. Proved, that $ \angle IMA = \angle INB$

Let $P$ be a point in the interior of the acute-angled triangle $ABC$. Prove that if the reflections of $P$ with respect to the sides of the triangle lie on the circumcircle of the triangle, then $P$ is the orthocenter of $ABC$.

In an acute-angled triangle $ ABC,$ let $ AD,BE$ be altitudes and $ AP,BQ$ internal bisectors. Denote by $ I$ and $ O$ the incenter and the circumcentre of the triangle, respectively. Prove that the points $ D, E,$ and $ I$ are collinear if and only if the points $ P, Q,$ and $ O$ are collinear.

Determine the maximal area triangle such that all of its vertices satisfy $\frac{x^2}{9} + \frac{y^2}{16} = 1$.

There are 8 members in a a bridge committee (committee for making bridges). Of these 8 members, 3 are chosen to be in special "approval" committee with 1 of 3 members being the "boss." In how many ways can this happen?

Let n be a positive integer and $x_1, x_2, ..., x_n > 0$ be real numbers so that $x_1 + x_2 +... + x_n =\frac{1}{x_1^2}+\frac{1}{x_2^2}+...+\frac{1}{x_n^2}$ Show that for each positive integer $k \le n$, there are $k$ numbers among $x_1, x_2, ..., x_n $ whose sum is at least $k$.

A set of segments with the total length less than $1$ is given on a line. Prove that every set of $n$ points on the line can be translated by a vector of length not exceeding $n/2$, so that all the obtained points are away from the given segments.

If a linear transformation $A$ on an $n$-dimensional vector space has $n+1$ eigenvectors such that any $n$ of them are linearly independent, does it follow that $A$ is a scalar multiple of the identity? Prove your answer.

A $10$ digit number is called interesting if its digits are distinct and is divisible by $11111$. Then find the number of interesting numbers.