Let $P$ be a convex n-gon in the plane with vertices labeled $V_1,...,V_n$ in counterclockwise order. A point $Q$ not outside $P$ is called a balancing point of $P$ if, when the triangles the blue and green regions are the same. Suppose $P$ has exactly one balancing point/ Show that the balancing point must be a vertex of $P$

Let $a$ and $b$ be arbitrary distinct numbers. Prove that the equation $(x +a) (x+b)=2x+a+b$ has two different roots.

For a pair of integers $a$ and $b$, with $0<a<b<1000$, a set $S\subset \begin{Bmatrix}1,2,3,...,2024\end{Bmatrix}$ $escapes$ the pair $(a,b)$ if for any elements $s_1,s_2\in S$ we have $\left|s_1-s_2\right| \notin \begin{Bmatrix}a,b\end{Bmatrix}$. Let $f(a,b)$ be the greatest possible number of elements of a set that escapes the pair $(a,b)$. Find the maximum and minimum values of $f$.

Determine all integers $k$ for which there exists a function $f: \mathbb{Z}_{>0} \to \mathbb{Z}$ such that $f(2023) = 2024$ and $f(ab) = f(a) + f(b) + kf(\gcd(a,b))$ for all positive integers $a$ and $b$.

Consider the space $ \{0,1 \} ^{N} $ with the product topology (where $\{0,1 \}$ is a discrete space). Let $ T: \{0,1 \} ^ {\mathbb {N}} \rightarrow \{0,1 \} ^ {\mathbb {N}} $ be the left-shift, ie $ (Tx) (n) = x (n+1) $ for every $ n \in \mathbb {N} $. Can a finite number of Borel sets be given: $ B_ {1}, \ldots, B_ {m} \subset \{0,1 \} ^ {N} $ such that $$ \left \{T ^ {i} \left (B_ {j} \right) \mid i \in \mathbb {N}, 1 \leq j \leq m \right \} $$the $ \sigma $-algebra generated by the set system coincides with the Borel set system?

Let $x,y,z$ be positive real numbers such that $x^2+y^2+z^2 = 25.$ Find the minimum of $\frac {xy} z + \frac {yz} x + \frac {zx} y .$ Pierre.

Which of the following conditions is sufficient to guarantee that integers $x$, $y$, and $z$ satisfy the equation $$x(x-y)+y(y-z)+z(z-x) = 1?$$$\textbf{(A)}\: x>y$ and $y=z$ $\textbf{(B)}\: x=y-1$ and $y=z-1$ $\textbf{(C)} \: x=z+1$ and $y=x+1$ $\textbf{(D)} \: x=z$ and $y-1=x$ $\textbf{(E)} \: x+y+z=1$

Prove that the equation $x^n - a_1x^{n-1} - a_2x^{n-2} - ... -a_{n-1}x - a_n = 0$, where $a_1 \ge 0, a_2 \ge 0, . . . , a_n \ge 0$, cannot have two positive roots.

Find all solutions in integers of $x^{3}+2y^{3}=4z^{3}$.

Find all polynomials $f(x)$ with integer coefficients such that $f(n)$ and $f(2^{n})$ are co-prime for all natural numbers $n$.

What is the product of real numbers $a$ which make $x^2+ax+1$ a negative integer for only one real number $x$? $ \textbf{(A)}\ -1 \qquad\textbf{(B)}\ -2 \qquad\textbf{(C)}\ -4 \qquad\textbf{(D)}\ -6 \qquad\textbf{(E)}\ -8 $

How many primes exist which are less than 50?

For what integers $ n\ge 3$ is it possible to accommodate, in some order, the numbers $ 1,2,\cdots, n$ in a circular form such that every number divides the sum of the next two numbers, in a clockwise direction?

Let $d = a^{1999} + b^{1999} + c^{1999}$ , where $a, b$ and $c$ are integers such that $a + b + c = 0$. (a) May it happen that $d = 2$? (b) May it happen that $d$ is prime? (V Senderov)

The real numbers $a$ and $b$ satisfy the relation $a + b \ge 1$. Show that $8 (a^4 + b^4) \ge 1$.

$D$ is inner point of triangle $ABC$. $E$ is on $BD$ and $CE=BD$. $\angle ABD=\angle ECD=10,\angle BAD=40,\angle CED=60$ Prove, that $AB>AC$

Let $a,b,c$ be the lengths of the sides of a given triangle.If positive reals $x,y,z$ satisfy $x+y+z=1,$ find the maximum of $axy+byz+czx.$

Let $A$ be a six-digit number, three of which are colored and equal to $1, 2$, and $4$. Prove that it is always possible to obtain a number that is a multiple of $7$, by performing only one of the following operations: either delete the three colored figures, or write all the numbers of $A$ in some order.

A plastic snap-together cube has a protruding snap on one side and receptacle holes on the other five sides as shown. What is the smallest number of these cubes that can be snapped together so that only receptacle holes are showing? [asy] draw((0,0)--(4,0)--(4,4)--(0,4)--cycle); draw(circle((2,2),1)); draw((4,0)--(6,1)--(6,5)--(4,4)); draw((6,5)--(2,5)--(0,4)); draw(ellipse((5,2.5),0.5,1)); fill(ellipse((3,4.5),1,0.25),black); fill((2,4.5)--(2,5.25)--(4,5.25)--(4,4.5)--cycle,black); fill(ellipse((3,5.25),1,0.25),black); [/asy] $\text{(A)}\ 3 \qquad \text{(B)}\ 4 \qquad \text{(C)}\ 5 \qquad \text{(D)}\ 6 \qquad \text{(E)}\ 8$

Let $a$ be any integer. Prove that there are infinitely many primes $p$ such that \[ p\,|\,n^2+3\qquad\text{and}\qquad p\,|\,m^3-a \] for some integers $n$ and $m$.

Pablo will decorate each of $6$ identical white balls with either a striped or a dotted pattern, using either red or blue paint. He will decide on the color and pattern for each ball by flipping a fair coin for each of the $12$ decisions he must make. After the paint dries, he will place the $6$ balls in an urn. Frida will randomly select one ball from the urn and note its color and pattern. The events "the ball Frida selects is red" and "the ball Frida selects is striped" may or may not be independent, depending on the outcome of Pablo's coin flips. The probability that these two events are independent can be written as $\frac mn,$ where $m$ and $n$ are relatively prime positive integers. What is $m?$ (Recall that two events $A$ and $B$ are independent if $P(A \text{ and }B) = P(A) \cdot P(B).$) $\textbf{(A) } 243 \qquad \textbf{(B) } 245 \qquad \textbf{(C) } 247 \qquad \textbf{(D) } 249\qquad \textbf{(E) } 251$

Let $ABC$ be a triangle with $AB = 3$, $AC = 8$, $BC = 7$ and let $M$ and $N$ be the midpoints of $\overline{AB}$ and $\overline{AC}$, respectively. Point $T$ is selected on side $BC$ so that $AT = TC$. The circumcircles of triangles $BAT$, $MAN$ intersect at $D$. Compute $DC$.

Which reaction has the most positive entropy change under standard conditions? $ \textbf{(A)}\hspace{.05in}\ce{H2O}_{(g)}+\ce{CO}_{(g)} \rightarrow \ce{H2}_{(g)}+ \ce{CO2}_{(g)}\qquad$ $\textbf{(B)}\hspace{.05in}\ce{CaCO3}_{(s)} \rightarrow \ce{CaO}_{(s)} + \ce{CO2}_{(g)} \qquad$ $\textbf{(C)}\hspace{.05in}\ce{NH3}_{(g)} \rightarrow \ce{NH3}_{(aq)}\qquad$ $\textbf{(D)}\hspace{.05in}\ce{C8H18}_{(l)} \rightarrow \ce{C8H18}_{(s)}\qquad$

Given a positive integer $ k$, there is a positive integer $ n$ with the property that one can obtain the sum of the first $ n$ positive integers by writing some $ k$ digits to the right of $ n$. Find the remainder of $ n$ when dividing at $ 9$.

Let $ABC$ be a triangle with circumcircle $\Gamma$ and incenter $I$ and let $M$ be the midpoint of $\overline{BC}$. The points $D$, $E$, $F$ are selected on sides $\overline{BC}$, $\overline{CA}$, $\overline{AB}$ such that $\overline{ID} \perp \overline{BC}$, $\overline{IE}\perp \overline{AI}$, and $\overline{IF}\perp \overline{AI}$. Suppose that the circumcircle of $\triangle AEF$ intersects $\Gamma$ at a point $X$ other than $A$. Prove that lines $XD$ and $AM$ meet on $\Gamma$. [i]Proposed by Evan Chen, Taiwan[/i]