An integer $n\geq 3$ is [i]poli-pythagorean[/i] if there exist $n$ positive integers pairwise distinct such that we can order these numbers in the vertices of a regular $n$-gon such that the sum of the squares of consecutive vertices is also a perfect square. For instance, $3$ is poli-pythagorean, because if we write $44,117,240$ in the vertices of a triangle we notice: $$44^2+117^2=125^2, 117^2+240^2=267^2, 240^2+44^2=244^2$$ Determine all poli-pythagorean integers.

There are finitely many primes dividing the numbers $\{ a \cdot b^n + c\cdot d^n : n=1, 2, 3,... \}$ where $a, b, c, d$ are positive integers. Prove that $b=d$.

Let $ a,b,c$ be positive numbers.Find $ k$ such that: $ (k \plus{} \frac {a}{b \plus{} c})(k \plus{} \frac {b}{c \plus{} a})(k \plus{} \frac {c}{a \plus{} b}) \ge (k \plus{} \frac {1}{2})^3$

$ AB$ is a fixed diameter of a circle whose center is $ O$. From $ C$, any point on the circle, a chord $ CD$ is drawn perpendicular to $ AB$. Then, as $ C$ moves over a semicircle, the bisector of angle $ OCD$ cuts the circle in a point that always: $ \textbf{(A)}\ \text{bisects the arc } AB \qquad\textbf{(B)}\ \text{trisects the arc } AB \qquad\textbf{(C)}\ \text{varies}$ $ \textbf{(D)}\ \text{is as far from }AB \text{ as from } D \qquad\textbf{(E)}\ \text{is equidistant from }B \text{ and } C$

Solve the equation \[2^{x^{2}+x}+\log_{2}x = 2^{x+1}\]

In a right triangle $ ABC $, the altitude $ CD $ is drawn from the vertex of the right angle $ C $ and a circle is inscribed in each of the triangles $ ABC $, $ ACD $ and $ BCD $. Prove that the sum of the radii of these circles equals the height $ CD $.

Find all pairs of polynomials $P(x),Q(x)$ with integer coefficients such that $P(Q(x)) = (x - 1)(x - 2)...(x - 9)$ for all real numbers $x$

The height and radius of the base of the cylinder are equal to $1$. What is the smallest number of balls of radius $1$ that can cover the entire cylinder?

For each positive integer \( n \), let \( f(n) \) be the number of ordered triples \( (a, b, c) \) such that \( a, b, c \in \{1, 2, \ldots, n\} \) and that the two roots (possibly equal) of the quadratic equation \( ax^2 + bx + c = 0 \) are both integers. (a) Prove that for every positive real number \( C \), there exists a positive integer \( n_C \) such that for all integers \( n \geq n_C \), we have \( f(n) > C \cdot n \). (b) Prove that for every positive real number \( C \), there exists a positive integer \( n_C \) such that for all integers \( n \geq n_C \), we have \( f(n) < C \cdot n^{\frac{2025}{2024}} \).

$ ABC$ is a triangle, the bisector of angle $ A$ meets the circumcircle of triangle $ ABC$ in $ A_1$, points $ B_1$ and $ C_1$ are defined similarly. Let $ AA_1$ meet the lines that bisect the two external angles at $ B$ and $ C$ in $ A_0$. Define $ B_0$ and $ C_0$ similarly. Prove that the area of triangle $ A_0B_0C_0 \equal{} 2 \cdot$ area of hexagon $ AC_1BA_1CB_1 \geq 4 \cdot$ area of triangle $ ABC$.

The permutohedron of order $3$ is the hexagon determined by points $(1, 2, 3)$, $(1, 3, 2)$, $(2, 1, 3)$, $(2, 3, 1)$, $(3, 1, 2)$, and $(3, 2, 1)$. The pyramid determined by these six points and the origin has a unique inscribed sphere of maximal volume. Determine its radius.

Let $ABC$ be an acute triangle and $\omega$ be its circumcircle. The bisector of $\angle BAC$ intersects $\omega$ at [another point] $M$. Let $P$ be a point on $AM$ and inside $\triangle ABC$. Lines passing $P$ that are parallel to $AB$ and $AC$ intersects $BC$ on $E, F$ respectively. Lines $ME, MF$ intersects $\omega$ at points $K, L$ respectively. Prove that $AM, BL, CK$ are concurrent.

Suppose $ABCD$ is a convex quadrilateral satisfying $AB=BC$, $AC=BD$, $\angle ABD = 80^\circ$, and $\angle CBD = 20^\circ$. What is $\angle BCD$ in degrees?

What is the value of $(625^{\log_{5}{2015}})^{\frac{1}{4}}$? $\textbf{(A) }5\qquad\textbf{(B) }\sqrt[4]{2015}\qquad\textbf{(C) }625\qquad\textbf{(D) }2015\qquad\textbf{(E) }\sqrt[4]{5^{2015}}$

Rein solved a test on mathematics that consisted of questions on algebra, geometry and logic. After checking the results, it occurred that Rein had answered correctly $50\%$ of questions on algebra, $70\%$ of questions on geometry and $80\%$ of questions on logic. Thereby, Rein had answered correctly altogether $62\%$ of questions on algebra and logic, and altogether $74\%$ of questions on geometry and logic. What was the percentage of correctly answered questions throughout all the test by Rein?

The fraction $\frac1{10}$ can be expressed as the sum of two unit fraction in many ways, for example, $\frac1{30}+\frac1{15}$ and $\frac1{60}+\frac1{12}$. Find the number of ways that $\frac1{2007}$ can be expressed as the sum of two distinct positive unit fractions.

Show that $\frac{(x - y)^7 + (y - z)^7 + (z - x)^7 - (x - y)(y - z)(z - x) ((x - y)^4 + (y - z)^4 + (z - x)^4)} {(x - y)^5 + (y - z)^5 + (z - x)^5} \ge 3$ holds for all triples of distinct integers $x, y, z$. When does equality hold?

Larry initially has a one character string that is either `a', `b', `c', or `d'. Every minute, he chooses a character in the string and: [list] [*] if it's an `a' he can replace it with `ac' or `da', [*] if it's a `b' he can replace it with `cb' or `bd', [*] if it's a `c' he can replace it with `cc' or `ba', [*] if it's a `d' he can replace it with `dd' or `ab'. [/list] Larry does the above process for $10$ minutes. Find the number of possible strings he can end up with that are a permutation of `aabbccccddd'. [i]Individual #14[/i]

For every positive real numbers $a$ and $b$ prove the inequality \[\displaystyle \sqrt{ab} \leq \dfrac{1}{3} \sqrt{\dfrac{a^2+b^2}{2}}+\dfrac{2}{3} \dfrac{2}{\dfrac{1}{a}+\dfrac{1}{b}}.\] [i]A. Khabrov[/i]

(a) Let $a$ and $b$ be positive integers such that $M(a, b) = a - \frac1b +b(b + \frac3a)$ is an integer. Prove that $M(a,b)$ is a square. (b) Find nonzero integers $a$ and $b$ such that $M(a,b)$ is a positive integer, but not a square.

Professor Oak is feeding his $100$ Pokémon. Each Pokémon has a bowl whose capacity is a positive real number of kilograms. These capacities are known to Professor Oak. The total capacity of all the bowls is $100$ kilograms. Professor Oak distributes $100$ kilograms of food in such a way that each Pokémon receives a non-negative integer number of kilograms of food (which may be larger than the capacity of the bowl). The [i]dissatisfaction level[/i] of a Pokémon who received $N$ kilograms of food and whose bowl has a capacity of $C$ kilograms is equal to $\lvert N-C\rvert$. Find the smallest real number $D$ such that, regardless of the capacities of the bowls, Professor Oak can distribute food in a way that the sum of the dissatisfaction levels over all the $100$ Pokémon is at most $D$. [i]Oleksii Masalitin, Ukraine[/i]

Let $ A $ be a ring, $ a\in A, $ and let $ n,k\ge 2 $ be two natural numbers such that $ n\vdots\text{char} (A) $ and $ 1+a=a^k. $ Show that the following propositions are true: [b]a)[/b] $ \forall s\in\mathbb{N}\quad \exists p_0,p_1,\ldots ,p_{k-1}\in\mathbb{Z}_{\ge 0}\quad a^s=\sum_{i=0}^{k-1} p_ia^{i} . $ [b]b)[/b] $ \text{ord} (a)\neq\infty . $

$(BUL 3)$ One hundred convex polygons are placed on a square with edge of length $38 cm.$ The area of each of the polygons is smaller than $\pi cm^2,$ and the perimeter of each of the polygons is smaller than $2\pi cm.$ Prove that there exists a disk with radius $1$ in the square that does not intersect any of the polygons.

Prove that the points $ A_1, A_2, \ldots, A_n $ ($ n \geq 7 $) located on the surface of the sphere lie on a circle if and only if the planes tangent to the surface of the sphere at these points have a common point or are parallel to one straight line.

For positive integers $a$ and $b$, $gcd (a, b)$ denote their greatest common divisor and $lcm (a, b)$ their least common multiple. Determine the number of ordered pairs (a,b) of positive integers satisfying the equation $ab + 63 = 20\, lcm (a, b) + 12\, gcd (a,b)$