Find all positive integers $n,k$ satisfying: $$ n^3 -5n+10 =2^k $$

Let $ABC$ be an acute-angled triangle with altitude $AT = h$. The line passing through its circumcenter $O$ and incenter $I$ meets the sides $AB$ and $AC$ at points $F$ and $N$, respectively. It is known that $BFNC$ is a cyclic quadrilateral. Find the sum of the distances from the orthocenter of $ABC$ to its vertices.

Find all non-negative solutions to the equation $2013^x+2014^y=2015^z$

Given a positive integer $k$, let $s(k)$ denote the sum of the digits of $k$. Let $a_1$, $a_2$, $a_3$, $...$ denote the strictly increasing sequence of all positive integers $n$ such that $s(7n + 1) = 7s(n) + 1$. Compute $a_{2023}$.

Prove that among $20$ consecutive positive integers there is an integer $d$ such that for every positive integer $n$ the following inequality holds $$n \sqrt{d} \left\{n \sqrt {d} \right \} > \dfrac{5}{2}$$ where by $\left \{x \right \}$ denotes the fractional part of the real number $x$. The fractional part of the real number $x$ is defined as the difference between the largest integer that is less than or equal to $x$ to the actual number $x$. [i](Serbia)[/i]

The edge lengths of a tetrahedron are a, b, c, d, e, f, the areas of its faces are S1, S2, S3, S4, and its volume is V . Prove that 2 [S1 S2 S3 S4](1/2) > 3V [abcdef](1/6) this problem comes from: http://www.imomath.com/othercomp/jkasfvgkusa/MonMO99.pdf I was just wondering if someone could write it in LATEX form. [color=red]_____________________________________ EDIT by moderator: If you type[/color] [code]The edge lengths of a tetrahedron are $a, b, c, d, e, f,$ the areas of its faces are $S_1, S_2, S_3, S_4,$ and its volume is $V.$ Prove that $2 \sqrt{S_1 S_2 S_3 S_4} > 3V \sqrt[6]{abcdef}$[/code] [color=red]it shows up as:[/color] The edge lengths of a tetrahedron are $ a, b, c, d, e, f,$ the areas of its faces are $ S_1, S_2, S_3, S_4,$ and its volume is $ V.$ Prove that $ 2 \sqrt{S_1 S_2 S_3 S_4} > 3V \sqrt[6]{abcdef}$

Give an example of a sequence of continuous functions on $\mathbb R$ converging pointwise to $0$ which is not uniformly convergent on any nonempty open set.

For a positive integer \( n \geq 6 \), find the smallest integer \( S(n) \) such that any graph with \( n \) vertices and at least \( S(n) \) edges must contain at least two disjoint cycles (cycles with no common vertices).

Pawns and rooks are placed on a $2019\times 2019$ chessboard, with at most one piece on each of the $2019^2$ squares. A rook [i]can see[/i] another rook if they are in the same row or column and all squares between them are empty. What is the maximal number $p$ for which $p$ pawns and $p+2019$ rooks can be placed on the chessboard in such a way that no two rooks can see each other?

You are eating at a fancy restaurant with a person you wish to impress. For some reason, you think that eating at least one spicy course and one meat-filled course will impress the person. The meal is five courses, with four options for each course. Each course has one option that is spicy and meat-filled, one option that is just spicy, one that is just meat-filled, and one that is neither spicy nor meat-filled. How many possible meals can you have?

Triangle $ABC$ has side lengths $AB = 5$, $BC = 9$, and $AC = 6$. Define the incircle of $ABC$ to be $C_1$. Then, define $C_i$ for $i > 1$ to be externally tangent to $C_{i-1}$ and tangent to $AB$ and $BC$. Compute the sum of the areas of all circles $C_n$.

Find the smallest constant $C > 0$ for which the following statement holds: among any five positive real numbers $a_1,a_2,a_3,a_4,a_5$ (not necessarily distinct), one can always choose distinct subscripts $i,j,k,l$ such that \[ \left| \frac{a_i}{a_j} - \frac {a_k}{a_l} \right| \le C. \]

Let $M$ be a subset of $\mathbb{R}$ such that the following conditions are satisfied: a) For any $x \in M, n \in \mathbb{Z}$, one has that $x+n \in \mathbb{M}$. b) For any $x \in M$, one has that $-x \in M$. c) Both $M$ and $\mathbb{R}$ \ $M$ contain an interval of length larger than $0$. For any real $x$, let $M(x) = \{ n \in \mathbb{Z}^{+} | nx \in M \}$. Show that if $\alpha,\beta$ are reals such that $M(\alpha) = M(\beta)$, then we must have one of $\alpha + \beta$ and $\alpha - \beta$ to be rational.

Let \( \mathbb{R} \) denote the set of real numbers. Find all functions \( f: \mathbb{R} \to \mathbb{R} \) such that \[ f(x^2) - y f(y) = f(x+y)(f(x) - y) \] for all real numbers \( x \) and \( y \).

Let $S$ be the set of integers that can be written in the form $50m + 3n$ where $m$ and $n$ are non-negative integers. For example $3, 50, 53$ are all in $S$. Find the sum of all positive integers not in $S$.

Show that the GCD of three consecutive triangular numbers is 1.

Let $O$ be the circumcenter of an acute triangle $ABC$ and $A_1$ a point of the minor arc $BC$ of the circle $ABC$ . Let $A_2$ and $A_3$ be points on sides $AB$ and $AC$ respectively such that $\angle BA_1A_2=\angle OAC$ and $\angle CA_1A_3=\angle OAB$ . Points $B_2, B_3, C_2$ and $C_3$ are similarly constructed, with $B_2$ in $BC, B_3$ in $AB, C_2$ in $AC$ and $C_3$ in $BC$. Prove that lines $A_2A_3, B_2B_3$ and $C_2C_3$ are concurrent.

We divide a convex $2009$-gon in triangles using non-intersecting diagonals. One of these diagonals is colored green. It is allowed the following operation: for two triangles $ABC$ and $BCD$ from the dividing/separating with a common side $BC$ if the replaced diagonal was green it loses its color and the replacing diagonal becomes green colored. Prove that if we choose any diagonal in advance it can be colored in green after applying the operation described finite number of times.

Prove that: $\sqrt{10+\sqrt{24}+\sqrt{40}+\sqrt{60}}=\sqrt{2}+\sqrt3+\sqrt5$

Let $ABC$ be a triangle with no right angle, $E$ on the line $BC$ such that $\angle AEB = \angle BAC$ and $\Delta_A$ the perpendicular to $BC$ at $E$. Let the circle $\gamma$ with diameter $BC$ intersect $BA$ again at $D$. For each point $M$ on $\gamma$ ($M$ is distinct from $B$), the line $BM$ meets $\Delta_A$ at $M'$ and the line $AM$ meets $\gamma$ again at $M''$. (a) Show that $p(A) = AM' \times DM''$ is independent of the chosen $M$. (b) Keeping $B,C$ fixed, and let $A$ vary. Show that $\frac{p(A)}{d(A,\Delta_A)}$ is independent of $A$. Michel Bataille

Given $n$ points, some of them connected by non-intersecting segments. You can reach every point from every one, moving along the segments, and there is no couple, connected by two different ways. Prove that the total number of the segments is $(n-1)$.

In a factory, square tables of $ 40 \times 40$ are tiled with four tiles of size $ 20 \times 20$. All tiles are the same and decorated in the same way with an asymmetric pattern such as the letter $ J$. How many different types of tables can be produced in this way?

In a triangle $ABC$, $\angle B = 70^o$, $\angle C = 50^o$. A point $M$ is taken on the side $AB$ such that $\angle MCB = 40^o$ , and a point $N$ is taken on the side $AC$ such that $\angle NBC = 50^o$. Find $\angle NMC$.

Let $M$ be a map made of several cities linked to each other by flights. We say that there is a route between two cities if there is a nonstop flight linking these two cities. For each city to the $M$ denote by $M_a$ the map formed by the cities that have a route to and routes linking these cities together ( to not part of $M_a$). The cities of $M_a$ are divided into two sets so that the number of routes linking cities of different sets is maximum; we call this number the cut of $M_a$. Suppose that for every cut of $M_a$ , it is strictly less than two thirds of the number of routes $M_a$ . Show that for any coloring of the $M$ routes with two colors there are three cities of $M$ joined by three routes of the same color.

A is a two-digit number and B is a three-digit number such that A increased by B% equals B reduced by A%. Find all possible pairs (A, B).