We say that a graph $G$ is [i]divisive[/i], if we can write a positive integer on each of its vertices such that all the integers are distinct, and any two of these integers divide each other if and only if there is an edge running between them in $G$. Which Platonic solids form a divisive graph? [img]https://cdn.artofproblemsolving.com/attachments/1/5/7c81439ee148ccda09c429556e0740865723e0.png[/img]

Stairs are built by laying bricks as shown in the figure. If you have $2004$ bricks to build a staircase: a) How many steps (= escalones) will the ladder have? b) How many bricks will there be left over? [img]https://cdn.artofproblemsolving.com/attachments/4/b/c1b80b374daeda4e33e1bb45be1d11f4b89590.png[/img]

In the coordinate plane, the line passing through points $(2023,0)$ and $(-2021,2024)$ also passes through $(1,c)$ for a constant $c$. Find $c$. [i]Proposed by Andy Xu[/i]

Let $f$ be a real-valued function such that \[f(x)+2f\left(\dfrac{2002}x\right)=3x\] for all $x>0$. Find $f(2)$. $\textbf{(A) }1000\qquad\textbf{(B) }2000\qquad\textbf{(C) }3000\qquad\textbf{(D) }4000\qquad\textbf{(E) }6000$

Given a $m \times n$ rectangle where $m,n\geq 2023$. The square in the $i$-th row and $j$-th column is filled with the number $i+j$ for $1\leq i \leq m, 1\leq j \leq n$. In each move, Alice can pick a $2023 \times 2023$ subrectangle and add $1$ to each number in it. Alice wins if all the numbers are multiples of $2023$ after a finite number of moves. For which pairs $(m,n)$ can Alice win? [i]Proposed by Boon Qing Hong[/i]

Find the smallest integer $n$ satisfying the following condition: regardless of how one colour the vertices of a regular $n$-gon with either red, yellow or blue, one can always find an isosceles trapezoid whose vertices are of the same colour.

Let \( a_1 \) be an integer greater than or equal to 2. Consider the sequence such that its first term is \( a_1 \), and for \( a_n \), the \( n \)-th term of the sequence, we have \[ a_{n+1} = \frac{a_n}{p_k^{e_k - 1}} + 1, \] where \( p_1^{e_1} p_2^{e_2} \cdots p_k^{e_k} \) is the prime factorization of \( a_n \), with \( 1 < p_1 < p_2 < \cdots < p_k \), and \( e_1, e_2, \dots, e_k \) positive integers. For example, if \( a_1 = 2024 = 2^3 \cdot 11 \cdot 23 \), the next two terms of the sequence are \[ a_2 = \frac{a_1}{23^{1-1}} + 1 = \frac{2024}{1} + 1 = 2025 = 3^4 \cdot 5^2; \] \[ a_3 = \frac{a_2}{5^{2-1}} + 1 = \frac{2025}{5} + 1 = 406. \] Determine for which values of \( a_1 \) the sequence is eventually periodic and what all the possible periods are. [b]Note:[/b] Let \( p \) be a positive integer. A sequence \( x_1, x_2, \dots \) is eventually periodic with period \( p \) if \( p \) is the smallest positive integer such that there exists an \( N \geq 0 \) satisfying \( x_{n+p} = x_n \) for all \( n > N \).

You are given an acute triangle $ABC$ with circumcircle $\omega$. Points $F$ on $AC$, $E$ on $AB$ and $P, Q$ on $\omega$ are chosen so that $\angle AFB = \angle AEC = \angle APE = \angle AQF = 90^\circ$. Show that lines $BC, EF, PQ$ are concurrent or parallel. [i]Proposed by Fedir Yudin[/i]

Prinstan Trollner and Dukejukem are competing at the game show WASS. Both players spin a wheel which chooses an integer from $1$ to $50$ uniformly at random, and this number becomes their score. Dukejukem then flips a weighted coin that lands heads with probability $\tfrac{3}{5}$. If he flips heads, he adds $1$ to his score. A player wins the game if their score is higher than the other player's score. A player wins the game if their score is higher than the other player's score. The probability Dukejukem defeats the Trollner to win WASS equals $\tfrac{m}{n}$ where $m$ and $n$ are coprime positive integers. Computer $m+n$.

Find $ \lim_{a\rightarrow\infty}\int_{a}^{a\plus{}1}\frac{x}{x\plus{}\ln x}\ dx$.

A chord is drawn on a circle by choosing two points uniformly at random along its circumference. This is done two more times to obtain three total random chords. The circle is cut along these three lines, splitting it into pieces. The probability that one of the pieces is a triangle is $\frac{m}{n}$ , where $m$, $n$ are positive integers and gcd $(m,n) = 1$. Find $100m + n$.

We select a real number $\alpha$ uniformly and at random from the interval $(0,500)$. Define \[ S = \frac{1}{\alpha} \sum_{m=1}^{1000} \sum_{n=m}^{1000} \left\lfloor \frac{m+\alpha}{n} \right\rfloor. \] Let $p$ denote the probability that $S \ge 1200$. Compute $1000p$. [i]Proposed by Evan Chen[/i]

Let $ABC$ be a triangle with $\angle A,\angle B,\angle C <120^{\circ}$, $T$ is its [i]Fermat-Torricelli[/i] point. Construct 3 equilateral triangles $BCD, CAE, ABF$ outside $\triangle ABC$ Prove that: $AD, BE, CF$ are concurrent at $T$.

For three points $ X,Y,Z$ let $ R_{XYZ}$ be the circumcircle radius of the triangle $ XYZ.$ If $ ABC$ is a triangle with incircle centre $ I$ then we have: \[ \frac{1}{R_{ABI}} \plus{} \frac{1}{R_{BCI}} \plus{} \frac{1}{R_{CAI}} \leq \frac{1}{\bar{AI}} \plus{} \frac{1}{\bar{BI}} \plus{} \frac{1}{\bar{CI}}.\]

Let $S_k$ be the set of all triplets of real numbers $(a, b, c)$ satisfying $a <k (b + c)$, $b <k (c + a)$, and $c <k (a + b)$. For what value of $k$ then $S_k$ is a subset of $\{(a, b, c) | ab + bc + ca> 0\}$ ? Michel Bataille, France

Consider the collection of all three-element subsets drawn from the set $ \{1,2,3,4,\dots,299,300\}$. Determine the number of those subsets for which the sum of the elements is a multiple of 3.

Find all positive integer $N$ such that for any infinite triangular grid with exactly $N$ black unit equilateral triangles, there exists an equilateral triangle $S$ whose sides align with grid lines such that there is exactly one black unit equilateral triangle outside of $S.$ (ltf0501)

You roll three fair six-sided dice. Given that the highest number you rolled is a $5$, the expected value of the sum of the three dice can be written as $\tfrac ab$ in simplest form. Find $a+b$.

Solve the equation $p^2-pq-q^3=1$ in prime numbers. [i]A. Golovanov[/i]

Let $B$ be a point on a circle $S_1$, and let $A$ be a point distinct from $B$ on the tangent at $B$ to $S_1$. Let $C$ be a point not on $S_1$ such that the line segment $AC$ meets $S_1$ at two distinct points. Let $S_2$ be the circle touching $AC$ at $C$ and touching $S_1$ at a point $D$ on the opposite side of $AC$ from $B$. Prove that the circumcentre of triangle $BCD$ lies on the circumcircle of triangle $ABC$.

Find the remainder when $(1^2+1)(2^2+1)(3^2+1)\dots(42^2+1)$ is divided by $43$. Your answer should be an integer between $0$ and $42$.

Given that $x$ and $y$ are distinct nonzero real numbers such that $x+\tfrac{2}{x} = y + \tfrac{2}{y}$, what is $xy$? $ \textbf{(A)}\ \frac{1}{4}\qquad\textbf{(B)}\ \frac{1}{2}\qquad\textbf{(C)}\ 1\qquad\textbf{(D)}\ 2\qquad\textbf{(E)}\ 4\qquad $

Suppose that $a,b,c,d$ are positive real numbers satisfying $(a+c)(b+d)=ac+bd$. Find the smallest possible value of $$\frac{a}{b}+\frac{b}{c}+\frac{c}{d}+\frac{d}{a}.$$ [i]Israel[/i]

Compute the prime factorization of $1007021035035021007001$. (You should write your answer in the form $p_1^{e_1}p_2^{e_2}\ldots p_k^{e_k}$ where $p_1,\ldots,p_k$ are distinct prime numbers and $e_1,\ldots,e_k$ are positive integers.)

For what polynomials $P(n)$ with integer coefficients can a positive integer be assigned to every lattice point in $\mathbb{R}^3$ so that for every integer $n \ge 1$, the sum of the $n^3$ integers assigned to any $n \times n \times n$ grid of lattice points is divisible by $P(n)$? [i]Proposed by Andre Arslan[/i]