Compute the number of even positive integers $n \le 2024$ such that $1, 2, \ldots, n$ can be split into $\tfrac{n}{2}$ pairs, and the sum of the numbers in each pair is a multiple of $3.$

Each face of a cube is painted with a different color. How many distinct cubes can be created this way? (*Observation: The ways to color the cube are $6!$, since each time a color is used on one face, there is one fewer available for the others. However, this does not determine $6!$ different cubes, since colorings that differ only by rotation should be considered the same.*)

Let $m, n$ be integers such that $n \geq m \geq 1$. Prove that $\frac{\text{gcd} (m,n)}{n} \binom{n}{m}$ is an integer. Here $\text{gcd}$ denotes greatest common divisor and $\binom{n}{m} = \frac{n!}{m!(n-m)!}$ denotes the binomial coefficient.

Let $ I$ be the incentre and $ O$ the circumcentre of a given acute triangle $ ABC$. The incircle is tangent to $ BC$ at $ D$. Assume that $ \angle B < \angle C$ and the segments $ AO$ and $ HD$ are parallel, where $H$ is the orthocentre of triangle $ABC$. Let the intersection of the line $ OD$ and $ AH$ be $ E$. If the midpoint of $ CI$ is $ F$, prove that $ E,F,I,O$ are concyclic.

A sphere is inscribed in a regular tetrahedron. Another regular tetrahedron is inscribed in the sphere. Find the ratio of the volumes of these two tetrahedra.

Prove that for any integer $n$ there exist integers $a, b$ and $c$ such that $n=a^2+b^2-c^2$.

Find the least positive integer such that when its leftmost digit is deleted, the resulting integer is $\frac{1}{29}$ of the original integer.

[u]Round 1[/u] [b]1.1.[/b] What is the area of a circle with diameter $2$? [b]1.2.[/b] What is the slope of the line through $(2, 1)$ and $(3, 4)$? [b]1.3.[/b] What is the units digit of $2^2 \cdot 4^4 \cdot 6^6$ ? [u]Round 2[/u] [b]2.1.[/b] Find the sum of the roots of $x^2 - 5x + 6$. [b]2. 2.[/b] Find the sum of the solutions to $|2 - x| = 1$. [b]2.3.[/b] On April $1$, $2018$, Mr. Dospinescu, Mr. Phaovibul and Mr. Pohoata all go swimming at the same pool. From then on, Mr. Dospinescu returns to the pool every 4th day, Mr. Phaovibul returns every $7$th day and Mr. Pohoata returns every $13$th day. What day will all three meet each other at the pool again? Give both the month and the day. [u]Round 3[/u] [b]3. 1.[/b] Kendall and Kylie are each selling t-shirts separately. Initially, they both sell t-shirts for $\$ 33$ each. A week later, Kendall marks up her t-shirt price by $30 \%$, but after seeing a drop in sales, she discounts her price by $30\%$ the following week. If Kim wants to buy $360$ t-shirts, how much money would she save by buying from Kendall instead of Kylie? Write your answer in dollars and cents. [b]3.2.[/b] Richard has English, Math, Science, Spanish, History, and Lunch. Each class is to be scheduled into one distinct block during the day. There are six blocks in a day. How many ways could he schedule his classes such that his lunch block is either the $3$rd or $4$th block of the day? [b]3.3.[/b] How many lattice points does $y = 1 + \frac{13}{17}x$ pass through for $x \in [-100, 100]$ ? (A lattice point is a point where both coordinates are integers.) [u]Round 4[/u] [b]4. 1.[/b] Unsurprisingly, Aaron is having trouble getting a girlfriend. Whenever he asks a girl out, there is an eighty percent chance she bursts out laughing in his face and walks away, and a twenty percent chance that she feels bad enough for him to go with him. However, Aaron is also a player, and continues asking girls out regardless of whether or not previous ones said yes. What is the minimum number of girls Aaron must ask out for there to be at least a fifty percent chance he gets at least one girl to say yes? [b]4.2.[/b] Nithin and Aaron are two waiters who are working at the local restaurant. On any given day, they may be fired for poor service. Since Aaron is a veteran who has learned his profession well, the chance of him being fired is only $\frac{2}{25}$ every day. On the other hand, Nithin (who never paid attention during job training) is very lazy and finds himself constantly making mistakes, and therefore the chance of him being fired is $\frac{2}{5}$. Given that after 1 day at least one of the waiters was fired, find the probability Nithin was fired. [b]4.3.[/b] In a right triangle, with both legs $4$, what is the sum of the areas of the smallest and largest squares that can be inscribed? An inscribed square is one whose four vertices are all on the sides of the triangle. PS. You should use hide for answers. Rounds 5-8 have been posted [url=https://artofproblemsolving.com/community/c3h2784569p24468582]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Given acute triangle $ABC$ with circumcenter $O$ and the center of nine-point circle $N$. Point $N_1$ are given such that $\angle NAB = \angle N_1AC$ and $\angle NBC = \angle N_1BA$. Perpendicular bisector of segment $OA$ intersects the line $BC$ at $A_1$. Analogously define $B_1$ and $C_1$. Show that all three points $A_1,B_1,C_1$ are collinear at a line that is perpendicular to $ON_1$.

Prove that (a) for each $n \ge 1$ $$\sum_{k=0}^n C_{n}^{k} \left(\frac{k}{n}-\frac{1}{2} \right)^2 \frac{1}{2^n}=\frac{1}{4n}$$ (b) for every n \ge m \ge 2 $$\sum_{\ell=0}^n \sum_{k_1+...+k_n=\ell,k_i=0,...,m} \frac{\ell!}{k_1!...k_n!} \frac{1}{(m+1)^n} \left(\frac{\ell}{n}-\frac{m}{2} \right)^2= \left(\frac{m^3-3m^2}{12(m+1)}+\frac{m}{2}-\frac{m}{3(m+1)}\right)n$$

Prove that for any positive integer $ n$, there exists only $ n$ degree polynomial $ f(x),$ satisfying $ f(0) \equal{} 1$ and $ (x \plus{} 1)[f(x)]^2 \minus{} 1$ is an odd function.

An artist has $14$ cubes, each with an edge of $1$ meter. She stands them on the ground to form a sculpture as shown. She then paints the exposed surface of the sculpture. How many square meters does she paint? $\text{(A)}\ 21 \qquad \text{(B)}\ 24 \qquad \text{(C)}\ 33 \qquad \text{(D)}\ 37 \qquad \text{(E)}\ 42$ [asy] draw((0,0)--(2.35,-.15)--(2.44,.81)--(.09,.96)--cycle); draw((.783333333,-.05)--(.873333333,.91)--(1.135,1.135)); draw((1.566666667,-.1)--(1.656666667,.86)--(1.89,1.1)); draw((2.35,-.15)--(4.3,1.5)--(4.39,2.46)--(2.44,.81)); draw((3,.4)--(3.09,1.36)--(2.61,1.4)); draw((3.65,.95)--(3.74,1.91)--(3.29,1.94)); draw((.09,.96)--(.76,1.49)--(.71,1.17)--(2.2,1.1)--(3.6,2.2)--(3.62,2.52)--(4.39,2.46)); draw((.76,1.49)--(.82,1.96)--(2.28,1.89)--(2.2,1.1)); draw((2.28,1.89)--(3.68,2.99)--(3.62,2.52)); draw((1.455,1.135)--(1.55,1.925)--(1.89,2.26)); draw((2.5,2.48)--(2.98,2.44)--(2.9,1.65)); draw((.82,1.96)--(1.55,2.6)--(1.51,2.3)--(2.2,2.26)--(2.9,2.8)--(2.93,3.05)--(3.68,2.99)); draw((1.55,2.6)--(1.59,3.09)--(2.28,3.05)--(2.2,2.26)); draw((2.28,3.05)--(2.98,3.59)--(2.93,3.05)); draw((1.59,3.09)--(2.29,3.63)--(2.98,3.59)); [/asy]

Let $ABC$ be a triangle with $\angle{BAC} > 90$. Let $D$ be a point on the segment $BC$ and $E$ be a point on line $AD$ such that $AB$ is tangent to the circumcircle of triangle $ACD$ at $A$ and $BE$ is perpendicular to $AD$. Given that $CA=CD$ and $AE=CE$. Determine $\angle{BCA}$ in degrees.

[b]a)[/b] Show that, for any distinct natural numbers $ m,n, $ the rings $ \mathbb{Z}_2\times \underbrace{\cdots}_{m\text{ times}} \times\mathbb{Z}_2,\mathbb{Z}_2\times \underbrace{\cdots}_{n\text{ times}} \times\mathbb{Z}_2 $ are homomorphic, but not isomorphic. [b]b)[/b] Show that there are infinitely many pairwise nonhomomorphic rings of same order.

$1+2+3+4+5+6=6+7+8$. What is the smallest number $k$ greater than $6$ for which: $1 + 2 +...+ k = k + (k+1) +...+ n$, with $n$ an integer greater than $k$ ?

All diagonals are plotted in a $2017$-sided convex polygon. A line $\ell$ intersects said polygon but does not pass through any of its vertices. Show that the line $\ell$ intersects an even number of diagonals of said polygon.

In the class, there are $ 15$ boys and $ 15$ girls. On March $ 8$, some boys made phone calls to some girls to congratulate them on the holiday ( each boy made no more than one call to each girl). It appears that there is a unique way to split the class in $ 15$ pairs (each consisting of a boy and a girl) such that in every pair the boy has phoned the girl. Find the maximal possible number of calls.

A factory produces several types of mug, each with two colors, chosen from a set of six. Every color occurs in at least three different types of mug. Show that we can find three mugs which together contain all six colors.

Let $ q_{0}, q_{1}, \cdots$ be a sequence of integers such that a) for any $ m > n$, $ m \minus{} n$ is a factor of $ q_{m} \minus{} q_{n}$, b) item $ |q_n| \le n^{10}$ for all integers $ n \ge 0$. Show that there exists a polynomial $ Q(x)$ satisfying $ q_{n} \equal{} Q(n)$ for all $ n$.

The vertices of a given square are clockwise lettered $A,B,C,D$. On the side $AB$ is situated a point $E$ such that $AE = AB/3$. Starting from an arbitrarily chosen point $P_0$ on segment $AE$ and going clockwise around the perimeter of the square, a series of points $P_0, P_1, P_2, \ldots$ is marked on the perimeter such that $P_iP_{i+1} = AB/3$ for each $i$. It will be clear that when $P_0$ is chosen in $A$ or in $E$, then some $P_i$ will coincide with $P_0$. Does this possibly also happen if $P_0$ is chosen otherwise?

Ayala and Barvaz play a game: Ayala initially gives Barvaz two $100\times100$ tables of positive integers, such that the product of numbers in each table is the same. In one move, Barvaz may choose a row or column in one of the tables, and change the numbers in it (to some positive integers), as long as the total product remains the same. Barvaz wins if after $N$ such moves, he manages to make the two tables equal to each other, and otherwise Ayala wins. a. For which values of $N$ does Barvaz have a winning strategy? b. For which values of $N$ does Barvaz have a winning strategy, if all numbers in Ayalah’s tables must be powers of $2$?

Let $n$ be an integer greater than two, and let $A_1,A_2, \cdots , A_{2n}$ be pairwise distinct subsets of $\{1, 2, ,n\}$. Determine the maximum value of \[\sum_{i=1}^{2n} \dfrac{|A_i \cap A_{i+1}|}{|A_i| \cdot |A_{i+1}|}\] Where $A_{2n+1}=A_1$ and $|X|$ denote the number of elements in $X.$

We call a set of integers $\textit{special}$ if it has $4$ elements and can be partitioned into $2$ disjoint subsets $\{ a,b \}$ and $\{ c, d \}$ such that $ab - cd = 1$. For every positive integer $n$, prove that the set $\{ 1, 2, \dots, 4n \}$ cannot be partitioned into $n$ disjoint special sets. [i]Proposed by Mohsen Jamali, Iran[/i]

The number of pairs of positive integers $(x,y)$ which satisfy the equation $x^2+y^2=x^3$ is $\textbf {(A) } 0 \qquad \textbf{(B) } 1 \qquad \textbf {(C) } 2 \qquad \textbf {(D) } \text{not finite} \qquad \textbf {(E) } \text{none of these}$

For an integer $n \ge 3$ we consider a circle with $n$ points on it. We place a positive integer at each point, where the numbers are not necessary need to be different. Such placement of numbers is called [i]stable [/i] as three numbers next to always have product $n$ each other. For how many values of $n$ with $3 \le n \le 2020$ is it possible to place numbers in a stable way?