Let $n$ be a fixed positive integer. Find the minimum value of $$\frac{x_1^3+\dots+x_n^3}{x_1+\dots+x_n}$$ where $x_1,x_2,\dots,x_n$ are distinct positive integers.

Bisector of side $BC$ intersects circumcircle of triangle $ABC$ in points $P$ and $Q$. Points $A$ and $P$ lie on the same side of line $BC$. Point $R$ is an orthogonal projection of point $P$ on line $AC$. Point $S$ is middle of line segment $AQ$. Show that points $A, B, R, S$ lie on one circle.

Suppose that $p_1<p_2<\dots <p_{15}$ are prime numbers in arithmetic progression, with common difference $d$. Prove that $d$ is divisible by $2,3,5,7,11$ and $13$.

If $a_0$ is a positive real number, consider the sequence $\{a_n\}$ defined by: \[ a_{n+1} = \frac{a^2_n - 1}{n+1}, n \geq 0. \] Show that there exist a real number $a > 0$ such that: [b]i.)[/b] for all $a_0 \geq a,$ the sequence $\{a_n\} \rightarrow \infty,$ [b]ii.)[/b] for all $a_0 < a,$ the sequence $\{a_n\} \rightarrow 0.$

Natural numbers $a$ and $b$ are given such that the number $$ P = \frac{[a, b]}{a + 1} + \frac{[a, b]}{b + 1} $$ Is a prime. Prove that $4P + 5$ is the square of a natural number.

Let $ABCDEF$ be a cyclic hexagon, points $K, L, M, N$ be the common points of lines $AB$ and $CD$, $AC$ and $BD$, $AF$ and $DE$, $AE$ and $DF$ respectively. Prove that if three of these points are collinear then the fourth point lies on the same line.

A confused cockroach is initially at vertex $A$ of a cube $ABCDEFGH$ with edges measuring $1$ meter, as shown in the figure. Every second, the cockroach moves $1$ meter, always choosing to go to one of the three adjacent vertices to its current position. For example, after $1$ second, the cockroach could stop at vertex $B$, $D$, or $E$. (a) In how many ways can the cockroach stop at vertex $G$ after $3$ seconds? (b) Is it possible for the cockroach to stop at vertex A after exactly $2023$ seconds? (c) In how many ways can the cockroach stop at A after exactly $2024$ seconds? Note: One way for the cockroach to stop at a vertex after a certain number of seconds differs from another way if, at some point, the cockroach is at different vertices in the trajectory. For example, there are $2$ ways for the cockroach to stop at $C$ after $2$ seconds: one of them passes through $A$, $B$, $C$, and the other through $A$, $D$, $C$. [img]https://cdn.discordapp.com/attachments/954427908359876608/1299721377124847616/Screenshot_2024-10-16_173123.png?ex=671e3b5b&is=671ce9db&hm=76962ee2949d8324c2f7022ef63f8b7d3c6fe3aabf4ecf526f44249439f204ac&[/img]

Let $r_1$, $r_2$, $\ldots$, $r_m$ be a given set of $m$ positive rational numbers such that $\sum_{k=1}^m r_k = 1$. Define the function $f$ by $f(n)= n-\sum_{k=1}^m \: [r_k n]$ for each positive integer $n$. Determine the minimum and maximum values of $f(n)$. Here ${\ [ x ]}$ denotes the greatest integer less than or equal to $x$.

Ten points in the plane are given, with no three collinear. Four distinct segments joining pairs of these points are chosen at random, all such segments being equally likely. The probability that some three of the segments form a triangle whose vertices are among the ten given points is $m/n,$ where $m$ and $n$ are relatively prime positive integers. Find $m+n.$

Find the greatest value and the least value of $x+y$ where $x,y$ are real numbers, with $x\ge -2$, $y\ge -3$ and $$x-2\sqrt{x+2}=2\sqrt{y+3}-y$$

In $\vartriangle ABC$, the bisector of $\angle B$ meets $AC$ at $D$ and the bisector of $\angle C$ meets $AB$ at $E$. These bisectors intersect at $O$ and $OD = OE$. If $AD \ne AE$, prove that $\angle A = 60^o$.

We denote by $\mathbb{R}^\plus{}$ the set of all positive real numbers. Find all functions $f: \mathbb R^ \plus{} \rightarrow\mathbb R^ \plus{}$ which have the property: \[f(x)f(y)\equal{}2f(x\plus{}yf(x))\] for all positive real numbers $x$ and $y$. [i]Proposed by Nikolai Nikolov, Bulgaria[/i]

Fred the Four-Dimensional Fluffy Sheep is walking in 4-dimensional space. He starts at the origin. Each minute, he walks from his current position $(a_1, a_2, a_3, a_4)$ to some position $(x_1, x_2, x_3, x_4)$ with integer coordinates satisfying \[(x_1-a_1)^2 + (x_2-a_2)^2 + (x_3-a_3)^2 + (x_4-a_4)^2 = 4 \quad \text{and} \quad |(x_1 + x_2 + x_3 + x_4) - (a_1 + a_2 + a_3 + a_4)| = 2.\] In how many ways can Fred reach $(10, 10, 10, 10)$ after exactly 40 minutes, if he is allowed to pass through this point during his walk?

Let $ABCD$ be a rectangle and the circle of center $D$ and radius $DA$, which cuts the extension of the side $AD$ at point $P$. Line $PC$ cuts the circle at point $Q$ and the extension of the side $AB$ at point $R$. Show that $QB = BR$.

Call a date mm/dd/yy $\textit{multiplicative}$ if its month number times its day number is a two-digit integer equal to its year expressed as a two-digit year. For example, $01/21/21$, $03/07/21$, and $07/03/21$ are multiplicative. Find the number of dates between January 1, 2022 and December 31, 2030 that are multiplicative.

The number $2024$ is written as the sum of not necessarily distinct two-digit numbers. What is the least number of two-digit numbers needed to write this sum? $\textbf{(A) }20\qquad\textbf{(B) }21\qquad\textbf{(C) }22\qquad\textbf{(D) }23\qquad\textbf{(E) }24$

How many points does one have to place on a unit square to guarantee that two of them are strictly less than 1/2 unit apart?

Two numbers are written on each vertex of a convex $100$-gon. Prove that it is possible to remove a number from each vertex so that the remaining numbers on any two adjacent vertices are different. [i]F. Petrov [/i]

Elisa swims laps in the pool. When she first started, she completed 10 laps in 25 minutes. Now she can finish 12 laps in 24 minutes. By how many minutes has she improved her lap time? $ \textbf{(A)}\ \dfrac{1}{2} \qquad \textbf{(B)}\ \dfrac{3}{4} \qquad \textbf{(C)}\ 1 \qquad \textbf{(D)}\ 2 \qquad \textbf{(E)}\ 3$

Find all natural numbers $m$ such that \[1! \cdot 3! \cdot 5! \cdots (2m-1)! = \biggl( \frac{m(m+1)}{2}\biggr) !.\]

In a country, there are some two-way roads between the cities. There are $2010$ roads connected to the capital city. For all cities different from the capital city, there are less than $2010$ roads connected to that city. For two cities, if there are the same number of roads connected to these cities, then this number is even. $k$ roads connected to the capital city will be deleted. It is wanted that whatever the road network is, if we can reach from one city to another at the beginning, then we can reach after the deleting process also. Find the maximum value of $k.$

Let $\Gamma_1$ be a circle with centre $A$ and $\Gamma_2$ be a circle with centre $B$, with $A$ lying on $\Gamma_2$. On $\Gamma_2$ there is a (variable) point $P$ not lying on $AB$. A line through $P$ is a tangent of $\Gamma_1$ at $S$, and it intersects $\Gamma_2$ again in $Q$, with $P$ and $Q$ lying on the same side of $AB$. A different line through $Q$ is tangent to $\Gamma_1$ at $T$. Moreover, let $M$ be the foot of the perpendicular to $AB$ through $P$. Let $N$ be the intersection of $AQ$ and $MT$. Show that $N$ lies on a line independent of the position of $P$ on $\Gamma_2$.

Prove that there are infinitely many quadruples of integers $(a,b,c,d)$ such that \begin{align*} a^2 + b^2 + 3 &= 4ab\\ c^2 + d^2 + 3 &= 4cd\\ 4c^3 - 3c &= a \end{align*} [i]Travis Hance.[/i]

Svitlana writes the number $147$ on a blackboard. Then, at any point, if the number on the blackboard is $n$, she can perform one of the following three operations: $\bullet$ if $n$ is even, she can replace $n$ with $\frac{n}{2}$ $\bullet$ if $n$ is odd, she can replace $n$ with $\frac{n+255}{2}$ and $\bullet$ if $n \ge 64$, she can replace $n$ with $n - 64$. Compute the number of possible values that Svitlana can obtain by doing zero or more operations.

For positive real numbers $a$, $b$, and $c$ with $a+b+c=1$, prove that: $$ (a-b)^2 + (b-c)^2 + (c-a)^2 \geq \frac{1-27abc}{2}. $$