Let $n$ be a positive integer. On a $2n\times 2n$ board, the $2n^2$ squares were painted white and the other $2n^2$ squares were painted black. One operation is to choose a $2\times 2$ subtable and mirror its $4$ cells about the vertical or horizontal axis of symmetry of that subtable. For what values of $n$ is it always possible to obtain a chess-like coloring from any initial coloring?

For any $n$ consecutive integers $a_1, \cdots, a_n$, prove that $$(a_1+\cdots+a_n)\cdot\left(\frac{1}{a_1}+\cdots+\frac{1}{a_n}\right)\leqslant \frac{n(n+1)\ln(\text{e}n)}{2}.$$

Let $X_1X_2X_3$ be a triangle with $X_1X_2 = 4, X_2X_3 = 5, X_3X_1 = 7,$ and centroid $G$. For all integers $n \ge 3$, define the set $S_n$ to be the set of $n^2$ ordered pairs $(i,j)$ such that $1\le i\le n$ and $1\le j\le n$. Then, for each integer $n\ge 3$, when given the points $X_1, X_2, \ldots , X_{n}$, randomly choose an element $(i,j)\in S_n$ and define $X_{n+1}$ to be the midpoint of $X_i$ and $X_j$. The value of \[ \sum_{i=0}^\infty \left(\mathbb{E}\left[X_{i+4}G^2\right]\left(\dfrac{3}{4}\right)^i\right) \] can be expressed in the form $p + q \ln 2 + r \ln 3$ for rational numbers $p, q, r$. Let $|p| + |q| + |r| = \dfrac mn$ for relatively prime positive integers $m$ and $n$. Compute $100m+n$. Note: $\mathbb{E}(x)$ denotes the expected value of $x$. [i]Proposed by Yang Liu[/i]

An ant walks around on the coordinate plane. It moves from the origin to $(3,4)$, then to $(-9, 9)$, then back to the origin. How many units did it walk? Express your answer as a decimal rounded to the nearest tenth.

The circle touches the square and goes through its two vertices as shown in the figure. Find the area of the square. (Distance in the picture is measured horizontally from the midpoint of the side of the square.) [img]https://cdn.artofproblemsolving.com/attachments/7/5/ab4b5f3f4fb4b70013e6226ce5189f3dc2e5be.png[/img]

The number of distinct positive integral divisors of $(30)^4$ excluding $1$ and $(30)^4$ is $ \textbf{(A)}\ 100 \qquad\textbf{(B)}\ 125 \qquad\textbf{(C)}\ 123 \qquad\textbf{(D)}\ 30 \qquad\textbf{(E)}\ \text{none of these} $

Prime number $p>3$ is congruent to $2$ modulo $3$. Let $a_k = k^2 + k +1$ for $k=1, 2, \ldots, p-1$. Prove that product $a_1a_2\ldots a_{p-1}$ is congruent to $3$ modulo $p$.

Given a convex polygon with $n$ sides and perimeter $S$, which has an incircle $\omega$ with radius $R$. A regular polygon with $n$ sides, whose vertices lie on $\omega$, has a perimeter $s$. Determine whether the following inequality holds: \[ S \ge \frac{2sRn}{\sqrt{4n^2R^2-s^2}}. \]

We have a five-digit positive integer $N$. We select every pair of digits of $N$ (and keep them in order) to obtain the $\tbinom52 = 10$ numbers $33$, $37$, $37$, $37$, $38$, $73$, $77$, $78$, $83$, $87$. Find $N$. [i]Proposed by Lewis Chen[/i]

A twelve foot tree casts a five foot shadow. How long is Henry’s shadow (at the same time of day) if he is five and a half feet tall?

Let $a\in (0,1)$, $f(z)=z^2-z+a, z\in \mathbb{C}$. Prove the following statement holds: For any complex number z with $|z| \geq 1$, there exists a complex number $z_0$ with $|z_0|=1$, such that $|f(z_0)| \leq |f(z)|$.

Prove that every positive integer $n$, except a finite number of them, can be represented as a sum of $2004$ positive integers: $n=a_1+a_2+\cdots +a_{2004}$, where $1\le a_1<a_2<\cdots <a_{2004}$, and $a_i \mid a_{i+1}$ for all $1\le i\le 2003$. [i]Chen Yonggao[/i]

Find all functions $f : Z \to Z$ satisfying $f(m + n) + f(mn -1) = f(m)f(n) + 2$ for all $m, n \in Z$.

Positive real numbers $a_1, a_2, \ldots, a_{2024}$ are written on the blackboard. A move consists of choosing two numbers $x$ and $y$ on the blackboard, erasing them and writing the number $\frac{x^2+6xy+y^2}{x+y}$ on the blackboard. After $2023$ moves, only one number $c$ will remain on the blackboard. Prove that \[ c<2024 (a_1+a_2+\ldots+a_{2024}).\]

Let ${{\left( {{a}_{n}} \right)}_{n\ge 1}}$ an increasing sequence and bounded.Calculate $\underset{n\to \infty }{\mathop{\lim }}\,\left( 2{{a}_{n}}-{{a}_{1}}-{{a}_{2}} \right)\left( 2{{a}_{n}}-{{a}_{2}}-{{a}_{3}} \right)...\left( 2{{a}_{n}}-{{a}_{n-2}}-{{a}_{n-1}} \right)\left( 2{{a}_{n}}-{{a}_{n-1}}-{{a}_{1}} \right).$

Let $S$ be the subset of rational numbers that can be written in the form $a/b$, where $a$ is any integer and $b$ is an odd integer. Does the sum of two of its elements belong to the $S$ ? And the product? Are there elements in $S$ whose inverse belongs to $S$ ?