This website contains problems from math contests. Problems and corresponding tags were obtained from the Art of Problem Solving website.

Tags were heavily modified to better represent problems.

AND:
OR:
NO:

Found problems: 34

2019 Middle European Mathematical Olympiad, 4

Prove that every integer from $1$ to $2019$ can be represented as an arithmetic expression consisting of up to $17$ symbols $2$ and an arbitrary number of additions, subtractions, multiplications, divisions and brackets. The $2$'s may not be used for any other operation, for example, to form multidigit numbers (such as $222$) or powers (such as $2^2$). Valid examples: $$\left((2\times 2+2)\times 2-\frac{2}{2}\right)\times 2=22 \;\;, \;\; (2\times2\times 2-2)\times \left(2\times 2 +\frac{2+2+2}{2}\right)=42$$ [i]Proposed by Stephan Wagner, Austria[/i]

2019 Middle European Mathematical Olympiad, 1

Determine the smallest and the greatest possible values of the expression $$\left( \frac{1}{a^2+1}+\frac{1}{b^2+1}+\frac{1}{c^2+1}\right)\left( \frac{a^2}{a^2+1}+\frac{b^2}{b^2+1}+\frac{c^2}{c^2+1}\right)$$ provided $a,b$ and $c$ are non-negative real numbers satisfying $ab+bc+ca=1$. [i]Proposed by Walther Janous, Austria [/i]

2021 Middle European Mathematical Olympiad, 8

Prove that there are infinitely many positive integers $n$ such that $n^2$ written in base $4$ contains only digits $1$ and $2$.

2019 Middle European Mathematical Olympiad, 5

Let $ABC$ be an acute-angled triangle such that $AB<AC$. Let $D$ be the point of intersection of the perpendicular bisector of the side $BC$ with the side $AC$. Let $P$ be a point on the shorter arc $AC$ of the circumcircle of the triangle $ABC$ such that $DP \parallel BC$. Finally, let $M$ be the midpoint of the side $AB$. Prove that $\angle APD=\angle MPB$. [i]Proposed by Dominik Burek, Poland[/i]

2021 Middle European Mathematical Olympiad, 4

Let $n \ge 3$ be an integer. Zagi the squirrel sits at a vertex of a regular $n$-gon. Zagi plans to make a journey of $n-1$ jumps such that in the $i$-th jump, it jumps by $i$ edges clockwise, for $i \in \{1, \ldots,n-1 \}$. Prove that if after $\lceil \tfrac{n}{2} \rceil$ jumps Zagi has visited $\lceil \tfrac{n}{2} \rceil+1$ distinct vertices, then after $n-1$ jumps Zagi will have visited all of the vertices. ([i]Remark.[/i] For a real number $x$, we denote by $\lceil x \rceil$ the smallest integer larger or equal to $x$.)

2018 Middle European Mathematical Olympiad, 2

The two figures depicted below consisting of $6$ and $10$ unit squares, respectively, are called staircases. Consider a $2018\times 2018$ board consisting of $2018^2$ cells, each being a unit square. Two arbitrary cells were removed from the same row of the board. Prove that the rest of the board cannot be cut (along the cell borders) into staircases (possibly rotated).

2019 Middle European Mathematical Olympiad, 3

There are $n$ boys and $n$ girls in a school class, where $n$ is a positive integer. The heights of all the children in this class are distinct. Every girl determines the number of boys that are taller than her, subtracts the number of girls that are taller than her, and writes the result on a piece of paper. Every boy determines the number of girls that are shorter than him, subtracts the number of boys that are shorter than him, and writes the result on a piece of paper. Prove that the numbers written down by the girls are the same as the numbers written down by the boys (up to a permutation). [i]Proposed by Stephan Wagner, Austria[/i]

2021 Middle European Mathematical Olympiad, 2

Given a positive integer $n$, we say that a polynomial $P$ with real coefficients is $n$-pretty if the equation $P(\lfloor x \rfloor)=\lfloor P(x) \rfloor$ has exactly $n$ real solutions. Show that for each positive integer $n$ [list=a] [*] there exists an n-pretty polynomial; [*] any $n$-pretty polynomial has a degree of at least $\tfrac{2n+1}{3}$. [/list] ([i]Remark.[/i] For a real number $x$, we denote by $\lfloor x \rfloor$ the largest integer smaller than or equal to $x$.)

2020 Middle European Mathematical Olympiad, 4#

Find all positive integers $n$ for which there exist positive integers $x_1, x_2, \dots, x_n$ such that $$ \frac{1}{x_1^2}+\frac{2}{x_2^2}+\frac{2^2}{x_3^2}+\cdots +\frac{2^{n-1}}{x_n^2}=1.$$

2019 Middle European Mathematical Olympiad, 4

Determine the smallest positive integer $n$ for which the following statement holds true: From any $n$ consecutive integers one can select a non-empty set of consecutive integers such that their sum is divisible by $2019$. [i]Proposed by Kartal Nagy, Hungary[/i]

2019 Middle European Mathematical Olympiad, 2

Let $n\geq 3$ be an integer. We say that a vertex $A_i (1\leq i\leq n)$ of a convex polygon $A_1A_2 \dots A_n$ is [i]Bohemian[/i] if its reflection with respect to the midpoint of $A_{i-1}A_{i+1}$ (with $A_0=A_n$ and $A_1=A_{n+1}$) lies inside or on the boundary of the polygon $A_1A_2\dots A_n$. Determine the smallest possible number of Bohemian vertices a convex $n$-gon can have (depending on $n$). [i]Proposed by Dominik Burek, Poland [/i]

2019 Middle European Mathematical Olympiad, 2

Let $\alpha$ be a real number. Determine all polynomials $P$ with real coefficients such that $$P(2x+\alpha)\leq (x^{20}+x^{19})P(x)$$ holds for all real numbers $x$. [i]Proposed by Walther Janous, Austria[/i]

2022 Middle European Mathematical Olympiad, 1

Find all functions $f: \mathbb R \to \mathbb R$ such that $$f(x+f(x+y))=x+f(f(x)+y)$$ holds for all real numbers $x$ and $y$.

2019 Middle European Mathematical Olympiad, 7

Let $a,b$ and $c$ be positive integers satisfying $a<b<c<a+b$. Prove that $c(a-1)+b$ does not divide $c(b-1)+a$. [i]Proposed by Dominik Burek, Poland[/i]

2021 Middle European Mathematical Olympiad, 1

Determine all real numbers A such that every sequence of non-zero real numbers $x_1, x_2, \ldots$ satisfying \[ x_{n+1}=A-\frac{1}{x_n} \] for every integer $n \ge 1$, has only finitely many negative terms.

2021 Middle European Mathematical Olympiad, 3

Let $n, b$ and $c$ be positive integers. A group of $n$ pirates wants to fairly split their treasure. The treasure consists of $c \cdot n$ identical coins distributed over $b \cdot n$ bags, of which at least $n-1$ bags are initially empty. Captain Jack inspects the contents of each bag and then performs a sequence of moves. In one move, he can take any number of coins from a single bag and put them into one empty bag. Prove that no matter how the coins are initially distributed, Jack can perform at most $n-1$ moves and then split the bags among the pirates such that each pirate gets $b$ bags and $c$ coins.

2019 Middle European Mathematical Olympiad, 3

Let $ABC$ be an acute-angled triangle with $AC>BC$ and circumcircle $\omega$. Suppose that $P$ is a point on $\omega$ such that $AP=AC$ and that $P$ is an interior point on the shorter arc $BC$ of $\omega$. Let $Q$ be the intersection point of the lines $AP$ and $BC$. Furthermore, suppose that $R$ is a point on $\omega$ such that $QA=QR$ and $R$ is an interior point of the shorter arc $AC$ of $\omega$. Finally, let $S$ be the point of intersection of the line $BC$ with the perpendicular bisector of the side $AB$. Prove that the points $P, Q, R$ and $S$ are concyclic. [i]Proposed by Patrik Bak, Slovakia[/i]

2021 Middle European Mathematical Olympiad, 6

Let $ABC$ be a triangle and let $M$ be the midpoint of the segment $BC$. Let $X$ be a point on the ray $AB$ such that $2 \angle CXA=\angle CMA$. Let $Y$ be a point on the ray $AC$ such that $2 \angle AYB=\angle AMB$. The line $BC$ intersects the circumcircle of the triangle $AXY$ at $P$ and $Q$, such that the points $P, B, C$, and $Q$ lie in this order on the line $BC$. Prove that $PB=QC$. [i]Proposed by Dominik Burek, Poland[/i]

2019 Middle European Mathematical Olympiad, 8

Let $N$ be a positive integer such that the sum of the squares of all positive divisors of $N$ is equal to the product $N(N+3)$. Prove that there exist two indices $i$ and $j$ such that $N=F_iF_j$ where $(F_i)_{n=1}^{\infty}$ is the Fibonacci sequence defined as $F_1=F_2=1$ and $F_n=F_{n-1}+F_{n-2}$ for $n\geq 3$. [i]Proposed by Alain Rossier, Switzerland[/i]

2021 Middle European Mathematical Olympiad, 1

Determine all functions $f: \mathbb{R} \to \mathbb{R}$ such that the inequality \[ f(x^2)-f(y^2) \le (f(x)+y)(x-f(y)) \] holds for all real numbers $x$ and $y$.

2010 Middle European Mathematical Olympiad, 9

The incircle of the triangle $ABC$ touches the sides $BC$, $CA$, and $AB$ in the points $D$, $E$ and $F$, respectively. Let $K$ be the point symmetric to $D$ with respect to the incenter. The lines $DE$ and $FK$ intersect at $S$. Prove that $AS$ is parallel to $BC$. [i](4th Middle European Mathematical Olympiad, Team Competition, Problem 5)[/i]

2009 Middle European Mathematical Olympiad, 1

Find all functions $ f: \mathbb{R} \to \mathbb{R}$, such that \[ f(xf(y)) \plus{} f(f(x) \plus{} f(y)) \equal{} yf(x) \plus{} f(x \plus{} f(y))\] holds for all $ x$, $ y \in \mathbb{R}$, where $ \mathbb{R}$ denotes the set of real numbers.

2014 Middle European Mathematical Olympiad, 2

We consider dissections of regular $n$-gons into $n - 2$ triangles by $n - 3$ diagonals which do not intersect inside the $n$-gon. A [i]bicoloured triangulation[/i] is such a dissection of an $n$-gon in which each triangle is coloured black or white and any two triangles which share an edge have different colours. We call a positive integer $n \ge 4$ [i]triangulable[/i] if every regular $n$-gon has a bicoloured triangulation such that for each vertex $A$ of the $n$-gon the number of black triangles of which $A$ is a vertex is greater than the number of white triangles of which $A$ is a vertex. Find all triangulable numbers.

2020 Middle European Mathematical Olympiad, 1#

Let $\mathbb{N}$ be the set of positive integers. Determine all positive integers $k$ for which there exist functions $f:\mathbb{N} \to \mathbb{N}$ and $g: \mathbb{N}\to \mathbb{N}$ such that $g$ assumes infinitely many values and such that $$ f^{g(n)}(n)=f(n)+k$$ holds for every positive integer $n$. ([i]Remark.[/i] Here, $f^{i}$ denotes the function $f$ applied $i$ times i.e $f^{i}(j)=f(f(\dots f(j)\dots ))$.)

2014 Contests, 2

We consider dissections of regular $n$-gons into $n - 2$ triangles by $n - 3$ diagonals which do not intersect inside the $n$-gon. A [i]bicoloured triangulation[/i] is such a dissection of an $n$-gon in which each triangle is coloured black or white and any two triangles which share an edge have different colours. We call a positive integer $n \ge 4$ [i]triangulable[/i] if every regular $n$-gon has a bicoloured triangulation such that for each vertex $A$ of the $n$-gon the number of black triangles of which $A$ is a vertex is greater than the number of white triangles of which $A$ is a vertex. Find all triangulable numbers.