Let $n \geqslant 100$ be an integer. Ivan writes the numbers $n, n+1, \ldots, 2 n$ each on different cards. He then shuffles these $n+1$ cards, and divides them into two piles. Prove that at least one of the piles contains two cards such that the sum of their numbers is a perfect square.

Consider a $10 \times 10$ grid. On every move, we colour $4$ unit squares that lie in the intersection of some two rows and two columns. A move is allowed if at least one of the $4$ squares is previously uncoloured. What is the largest possible number of moves that can be taken to colour the whole grid?

Peter and Bob play a game on a $n\times n$ chessboard. At the beginning, all squares are white apart from one black corner square containing a rook. Players take turns to move the rook to a white square and recolour the square black. The player who can not move loses. Peter goes first. Who has a winning strategy?

Let $a,b,c$ be positive integers. Prove that $a^2+b^2+c^2$ is divisible by $4$, if and only if $a,b,c$ are even.

If $a$ and $b$ are positive integers, we say that $a$ [i]almost divides[/i] $b$ if $a$ divides at least one of $b - 1$ and $b + 1$. We call a positive integer $n$ [i]almost prime[/i] if the following holds: for any positive integers $a, b$ such that $n$ almost divides $ab$, we have that $n$ almost divides at least one of $a$ and $b$. Determine all almost prime numbers. [hide = original link][url]https://mathematical.olympiad.ch/fileadmin/user_upload/Archiv/Intranet/Olympiads/Mathematics/deploy/exams/2024/FinalRound/Exam/englishFinalRound2024.pdf[/url]!![/hide]

In a closed rectangular neighborhood there are: $S$ streets (these are straight roads of maximum length), $V$ four-arm intersections ( [img]https://cdn.artofproblemsolving.com/attachments/e/4/6a5974a30dc182b59a519a8ef4eb4f1412e05e.png[/img]), $H$ city blocks (these are rectangular areas bounded by four streets, which are no be intersected by another street) and $T$ represents the number of $T$-intersections ([img]https://cdn.artofproblemsolving.com/attachments/0/a/b390a30a0b27d83db681f70f633bdeed697163.png[/img] ). For example, in the neighborhood below, there are $15$ streets, $8$ four-arm intersections, $20$ city blocks and $22$ $T$-intersections. [img]https://cdn.artofproblemsolving.com/attachments/a/2/c1a5e463d0fb5671ac0702c91cfc2272d4e2c3.png[/img] Prove that in each district $S + V = H + 3$.

Let $ABC$ be a triangle with $O$ as its circumcenter. A circle $\Gamma$ tangents $OB, OC$ at $B, C$, respectively. Let $D$ be a point on $\Gamma$ other than $B$ with $CB=CD$, $E$ be the second intersection of $DO$ and $\Gamma$, and $F$ be the second intersection of $EA$ and $\Gamma$. Let $X$ be a point on the line $AC$ so that $XB\perp BD$. Show that one half of $\angle ADF$ is equal to one of $\angle BDX$ and $\angle BXD$. [i]Proposed by usjl[/i]

Given two regular tetrahedrons with edges of length $\sqrt2$, transforming into one another with central symmetry. Let $\Phi$ be the set the midpoints of segments whose ends belong to different tetrahedrons. Find the volume of the figure $\Phi$.

Given is the function $ f\equal{} \lfloor x^2 \rfloor \plus{} \{ x \}$ for all positive reals $ x$. ( $ \lfloor x \rfloor$ denotes the largest integer less than or equal $ x$ and $ \{ x \} \equal{} x \minus{} \lfloor x \rfloor$.) Show that there exists an arithmetic sequence of different positive rational numbers, which all have the denominator $ 3$, if they are a reduced fraction, and don’t lie in the range of the function $ f$.

Let $ABC$ be an acute-angled triangle with $BC > AB$, such that the points $A$, $H$, $I$ and $C$ are concyclic (where $H$ is the orthocenter and $I$ is the incenter of triangle $ABC$). The line $AC$ intersects the circumcircle of triangle $BHC$ at point $T$, and the line $BC$ intersects the circumcircle of triangle $AHC$ at point $P$. If the lines $PT$ and $HI$ are parallel, determine the measures of the angles of triangle $ABC$.

Trapezoid $ABCD$ has sides $AB=92,BC=50,CD=19,AD=70$ $AB$ is parallel to $CD$ A circle with center $P$ on $AB$ is drawn tangent to $BC$ and $AD$.Given that $AP=\dfrac mn$ (Where $m,n$ are relatively prime).What is $m+n$?

Find all $x;y\in\mathbb{Z}$ satisfying the following condition: $$x^3=y^4+9x^2$$

Consider the set of points that are inside or within one unit of a rectangular parallelepiped (box) that measures 3 by 4 by 5 units. Given that the volume of this set is $(m + n \pi)/p$, where $m$, $n$, and $p$ are positive integers, and $n$ and $p$ are relatively prime, find $m + n + p$.

Let $f(x)$ be a nonconstant real polynomial. The sequence $\{a_i\}_{i=1}^{\infty}$ of real numbers is strictly increasing and unbounded, as $$a_{i+1}<a_i+2020.$$ The integers $\lfloor{|f(a_1)|}\rfloor$ , $\lfloor{|f(a_2)|}\rfloor$ , $\lfloor{|f(a_3)|}\rfloor$ , $\dots$ are written consecutively in such a way that their digits form an infinite sequence of digits $\{s_k\}_{k=1}^{\infty}$ (here $s_k\in\{0, 1, \dots, 9\}$). $\quad$If $n\in\mathbb{N}$ , prove that among the numbers $\overline{s_{n(k-1)+1}s_{n(k-1)+2}\cdots s_{nk}}$ , where $k\in\mathbb{N}$ , all $n$-digit numbers appear.

In a town there are four pubs, $A,B,C,D$, and any two of them are connected to each other except $A$ and $D$. A drunkard wanders about the pubs starting with $A$ and, after having a drink, goes to any of the pubs directly connected, with equal probability. (a) What is the probability that the drunkard is at $C$ at its fifth drink? (b) Where is the drunkard most likely to be after $n$ drinks ($n > 5$)?

Consider a $12$-gon with sidelengths $1$, $2$, $3$, $4$, ..., $12$. Prove that there are three consecutive sides in this $12$-gon, whose lengths have a sum $> 20$.

Each of the sides $AB$ and $CD$ of a convex quadrilateral $ABCD$ is divided into three equal parts, $|AE| = |EF| = |F B|$ , $|DP| = |P Q| = |QC|$. The diagonals of $AEPD$ and $FBCQ$ intersect at $M$ and $N$, respectively. Prove that the sum of the areas of $\vartriangle AMD$ and $\vartriangle BNC$ is equal to the sum of the areas of $\vartriangle EPM$ and $\vartriangle FNQ$.

The polynomial $ x^3\minus{}ax^2\plus{}bx\minus{}2010$ has three positive integer zeros. What is the smallest possible value of $ a$? $ \textbf{(A)}\ 78 \qquad \textbf{(B)}\ 88 \qquad \textbf{(C)}\ 98 \qquad \textbf{(D)}\ 108 \qquad \textbf{(E)}\ 118$

Let $n$ and $k$ be integers with $k\leq n-2$. The absolute value of the sum of elements of any $k$-element subset of $\{a_1,a_2,\cdots,a_n\}$ is less than or equal to 1. Show that: If $|a_1|\geq1$, then for any $2\leq i \leq n$, we have: $$|a_1|+|a_i|\leq2$$

Let $ABC$ be a triangle. The internal bisector of $\angle B$ meets $AC$ in $P$ and $I$ is the incenter of $ABC$. Prove that if $AP+AB = CB$, then $API$ is an isosceles triangle.

Two dueling wizards are at an altitude of $100$ above the sea. They cast spells in turn, and each spell is of the form "decrease the altitude by $a$ for me and by $b$ for my rival" where $a$ and $b$ are real numbers such that $0 < a < b$. Different spells have different values for $a$ and $b$. The set of spells is the same for both wizards, the spells may be cast in any order, and the same spell may be cast many times. A wizard wins if after some spell, he is still above water but his rival is not. Does there exist a set of spells such that the second wizard has a guaranteed win, if the number of spells is $(a)$ finite; $(b)$ infinite?

Let $I$ and $H$ be the incentre and orthocentre of triangle $ABC$ respectively. Let $P,Q$ be the midpoints of $AB,AC$. The rays $PI,QI$ intersect $AC,AB$ at $R,S$ respectively. Suppose that $T$ is the circumcentre of triangle $BHC$. Let $RS$ intersect $BC$ at $K$. Prove that $A,I$ and $T$ are collinear if and only if $[BKS]=[CKR]$. [i]Shen Wunxuan[/i]

Shiori places seven books, numbered from $1$ to $7$, on a bookshelf in some order. Later, she discovers that she can place two dividers between the books, separating the books into left, middle, and right sections, such that: $\bullet$ The left section is numbered in increasing order from left to right, or has at most one book. $\bullet$ The middle section is numbered in decreasing order from left to right, or has at most one book. $\bullet$ The right section is numbered in increasing order from left to right, or has at most one book. In how many possible orderings could Shiori have placed the books? For example, $(2, 3, 5, 4, 1, 6, 7)$ and $(2, 3, 4, 1, 5, 6, 7)$ are possible orderings with the partitions $2, 3, 5|4, 1|6, 7$ and $2, 3, 4|1|5, 6, 7$, but $(5, 6, 2, 4, 1, 3, 7)$ is not.

Find the sum of all positive integers $n$ such that \[ \frac{2n+1}{n(n-1)} \] has a terminating decimal representation. [i]Proposed by Evan Chen[/i]

The integer $ 9$ can be written as a sum of two consecutive integers: $ 9 \equal{} 4\plus{}5.$ Moreover, it can be written as a sum of (more than one) consecutive positive integers in exactly two ways: $ 9 \equal{} 4\plus{}5 \equal{} 2\plus{}3\plus{}4.$ Is there an integer that can be written as a sum of $ 1990$ consecutive integers and that can be written as a sum of (more than one) consecutive positive integers in exactly $ 1990$ ways?