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]

Welcome to the [b]USAYNO[/b], a twelve-part question where each part has a yes/no answer. If you provide $C$ correct answers, your score on this problem will be $\frac{C}{6}$. Your answer should be a twelve-character string containing `Y' (for yes) and `N' (for no). For instance if you think a, c, and f are `yes' and the rest are `no', you should answer YNYNNYNNNNNN. (a) Is there a positive integer $n$ such that the sum of the digits of $2018n+1337$ in base $10$ is $2018$ more than the sum of the digits of $2018n+1337$ in base $4$? (b) Is there a fixed constant $\theta$ such that for all triangles $ABC$ with $$2018AB^2=2018CA^2+2017CA\cdot CB+2018CB^2,$$ one of the angles of $ABC$ is $\theta$? (c) Adam lists out every possible way to arrange the letters of ``CCACCACCA'' (including the given arrangement) at $1$ arrangement every $5$ seconds. Madam lists out every possible way to arrange the letters of ``CCACCAA'' (including the given arrangement) at $1$ arrangement every $12$ seconds. Does Adam finish first? (d) Do there exist real numbers $a,b,c$, none of which is the average of the other two, such that \[\frac{1}{b+c-2a}+\frac{1}{c+a-2b}+\frac{1}{a+b-2c}=0?\] (e) Let $f\left(x\right)=\frac{2^x-2}{x}-1$. Is there an integer $n$ such that $$f\left(n\right),f\left(f\left(n\right)\right),f\left(f\left(f\left(n\right)\right)\right),\ldots$$ are all integers? (f) In an elementary school with $2585$ students and $159$ classes (every student is in exactly one class), each student reports the size of their class. The principal of the school takes the average of all of these numbers and calls it $X$. The principal then computes the average size of each class and calls it $Y$. Is it necessarily true that $X>Y$? (g) Six sticks of lengths $3$, $5$, $7$, $11$, $13$, and $17$ are put together to form a hexagon. From a point inside the hexagon, a circular water balloon begins to expand and will stop expanding once it hits any stick. Is it possible that once the balloon stops expanding, it is touching each of the six sticks? (h) A coin is biased so that it flips heads and tails (and only heads or tails) each with a positive rational probability (not necessarily $\frac{1}{2}$). Is it possible that on average, it takes exactly twice as long to flip two heads in a row as it is to flip two tails in a row? (i) Does there exist a base $b$ such that $2018_b$ is prime? (j) Does there exist a sequence of $2018$ distinct real numbers such that no $45$ terms (not necessarily consecutive) can be examined, in order, and be in strictly increasing or strictly decreasing order? (k) Does there exist a scalene triangle $ABC$ such that there exist two distinct rectangles $PQRS$ inscribed in $\triangle{ABC}$ with $P\in AB$, $Q,R\in BC$, $S\in AC$ such that the angle bisectors of $\angle{PAS}$, $\angle{PQR}$, and $\angle{SRQ}$ concur? (l) For three vectors $\mathbf{u}_1,\mathbf{u}_2,\mathbf{u}_3$ with $\mathbf{u}_i=\left(x_{i,1},x_{i,2},x_{i,3},x_{i,4}\right)$, define \[f\left(\mathbf{u}_1,\mathbf{u}_2,\mathbf{u}_3\right)=1-\displaystyle\prod_{j=1}^4\left(1+\left(x_{2,j}-x_{3,j}\right)^2+\left(x_{3,j}-x_{1,j}\right)^2+\left(x_{1,j}-x_{2,j}\right)^2\right).\] Are there any sequences $\mathbf{v}_1,\mathbf{v}_2,\ldots,\mathbf{v}_{18}$ of distinct vectors with four components, with all components in $\left\{1,2,3\right\}$, such that \[\displaystyle\prod_{1\leq i<j<k\leq18}f\left(\mathbf{v}_i,\mathbf{v}_j,\mathbf{v}_k\right)\equiv1\pmod3?\] [i]2018 CCA Math Bonanza Lightning Round #5.4[/i]

Determine all polynomials $P(x) \in \mathbb R[x]$ satisfying the following two conditions : (a) $P(2017) = 2016$ and (b) $(P(x) + 1)^2 = P(x^2 + 1)$ for all real numbers $x$. [i]proposed by Walther Janous[/i]

Prove that the sum of an odd number of vectors of length 1, of common origin $O$ and all situated in the same semi-plane determined by a straight line which goes through $O,$ is at least 1.

Jerry cuts a wedge from a $6$-cm cylinder of bologna as shown by the dashed curve. Which answer choice is closest to the volume of his wedge in cubic centimeters? [asy] defaultpen(linewidth(0.65)); real d=90-63.43494882; draw(ellipse((origin), 2, 4)); fill((0,4)--(0,-4)--(-8,-4)--(-8,4)--cycle, white); draw(ellipse((-4,0), 2, 4)); draw((0,4)--(-4,4)); draw((0,-4)--(-4,-4)); draw(shift(-2,0)*rotate(-d-5)*ellipse(origin, 1.82, 4.56), linetype("10 10")); draw((-4,4)--(-8,4), dashed); draw((-4,-4)--(-8,-4), dashed); draw((-4,4.3)--(-4,5)); draw((0,4.3)--(0,5)); draw((-7,4)--(-7,-4), Arrows(5)); draw((-4,4.7)--(0,4.7), Arrows(5)); label("$8$ cm", (-7,0), W); label("$6$ cm", (-2,4.7), N);[/asy] $\textbf{(A)} 48 \qquad \textbf{(B)} 75 \qquad \textbf{(C)}151\qquad \textbf{(D)}192 \qquad \textbf{(E)}603$

The ratio of the number of games won to the number of games lost (no ties) by the Middle School Middies is $11:4$ . To the nearest whole percent, what percent of its games did the team lose? $ \text{(A)}\ 24\qquad\text{(B)}\ 27\qquad\text{(C)}\ 36\qquad\text{(D)}\ 45\qquad\text{(E)}\ 73 $