Found problems: 85335
2018 South East Mathematical Olympiad, 1
Assume $c$ is a real number. If there exists $x\in[1,2]$ such that $\max\left\{\left |x+\frac cx\right |, \left |x+\frac cx + 2\right |\right\}\geq 5$, please find the value range of $c$.
2023 Auckland Mathematical Olympiad, 7
In a square of area $1$ there are situated $2024$ polygons whose total area is greater than $2023$. Prove that they have a point in common.
2005 Croatia National Olympiad, 1
Find all possible digits $x, y, z$ such that the number $\overline{13xy45z}$ is divisible
by $792.$
2009 Iran MO (3rd Round), 4
4-Point $ P$ is taken on the segment $ BC$ of the scalene triangle $ ABC$ such that $ AP \neq AB,AP \neq AC$.$ l_1,l_2$ are the incenters of triangles $ ABP,ACP$ respectively. circles $ W_1,W_2$ are drawn centered at $ l_1,l_2$ and with radius equal to $ l_1P,l_2P$,respectively. $ W_1,W_2$ intersects at $ P$ and $ Q$. $ W_1$ intersects $ AB$ and $ BC$ at $ Y_1( \mbox{the intersection closer to B})$ and $ X_1$,respectively. $ W_2$ intersects $ AC$ and $ BC$ at $ Y_2(\mbox{the intersection closer to C})$ and $ X_2$,respectively.PROVE THE CONCURRENCY OF $ PQ,X_1Y_1,X_2Y_2$.
1969 IMO Longlists, 64
$(USS 1)$ Prove that for a natural number $n > 2, (n!)! > n[(n - 1)!]^{n!}.$
1996 Tuymaada Olympiad, 4
Given a segment of length $7\sqrt3$ .
Is it possible to use only compass to construct a segment of length $\sqrt7$?
2023 China Western Mathematical Olympiad, 2
In a certain country there are $2023$ islands and $2022$ bridges, such that every bridge connects two different islands and any two islands have at most one bridge in common, and from any island, using bridges one can get to any other island. If in any three islands there is an island with bridges connected to each of the other two islands, call these three islands an "island group". We know that any two "island group"s have at least $1$ common island. What is the minimum number of islands with only $1$ bridge connected to it?
2019 Indonesia MO, 2
Given $19$ red boxes and $200$ blue boxes filled with balls. None of which is empty.
Suppose that every red boxes have a maximum of $200$ balls and every blue boxes have a maximum of $19$ balls.
Suppose that the sum of all balls in the red boxes is less than the sum of all the balls in the blue boxes.
Prove that there exists a subset of the red boxes and a subset of the blue boxes such that their sum is the same.
2017 Princeton University Math Competition, 9
The set $\{(x, y) \in R^2| \lfloor x + y\rfloor \cdot \lceil x + y\rceil = (\lfloor x\rfloor + \lceil y \rceil ) (\lceil x \rceil + \lfloor y\rfloor), 0 \le x, y \le 100\}$ can be thought of as a collection of line segments in the plane. If the total length of those line segments is $a + b\sqrt{c}$ for $c$ squarefree, find $a + b + c$.
($\lfloor z\rfloor$ is the greatest integer less than or equal to $z$, and $\lceil z \rceil$ is the least integer greater than or equal to $z$, for $z \in R$.)
2001 Estonia National Olympiad, 1
John had to solve a math problem in the class. While cleaning the blackboard, he accidentally erased a part of his problem as well: the text that remained on board was $37 \cdot(72 + 3x) = 14**45$, where $*$ marks an erased digit. Show that John can still solve his problem, knowing that $x$ is an integer
1910 Eotvos Mathematical Competition, 3
The lengths of sides $CB$ and $CA$ of $\vartriangle ABC$ are $a$ and $b$, and the angle between them is $\gamma = 120^o$. Express the length of the bisector of $\gamma$ in terms of $a$ and $b$.
2018 Stanford Mathematics Tournament, 2
Consider a game played on the integers in the closed interval $[1, n]$. The game begins with some tokens placed in $[1, n]$. At each turn, tokens are added or removed from$ [1, n]$ using the following rule: For each integer $k \in [1, n]$, if exactly one of $k - 1$ and $k + 1$ has a token, place a token at $k$ for the next turn, otherwise leave k blank for the next turn.
We call a position [i]static [/i] if no changes to the interval occur after one turn. For instance, the trivial position with no tokens is static because no tokens are added or removed after a turn (because there are no tokens). Find all non-trivial static positions.
2018 Brazil National Olympiad, 1
We say that a polygon $P$ is [i]inscribed[/i] in another polygon $Q$ when all vertices of $P$ belong to perimeter of $Q$. We also say in this case that $Q$ is [i]circumscribed[/i] to $P$. Given a triangle $T$, let $l$ be the maximum value of the side of a square inscribed in $T$ and $L$ be the minimum value of the side of a square circumscribed to $T$. Prove that for every triangle $T$ the inequality $L/l \ge 2$ holds and find all the triangles $T$ for which the equality occurs.
2019 Bosnia and Herzegovina Junior BMO TST, 1
Let $x,y,z$ be real numbers ( $x \ne y$, $y\ne z$, $x\ne z$) different from $0$. If $\frac{x^2-yz}{x(1-yz)}=\frac{y^2-xz}{y(1-xz)}$, prove that the following relation holds:
$$x+y+z=\frac{1}{x}+\frac{1}{y}+\frac{1}{z}.$$
2022 Balkan MO Shortlist, C5
Given is a cube of side length $2021$. In how many different ways is it possible to add somewhere on the boundary of this cube a $1\times 1\times 1$ cube in such a way that the new shape can be filled in with $1\times 1\times k$ shapes, for some natural number $k$, $k\geq 2$?
2013 Kazakhstan National Olympiad, 1
Find maximum value of
$|a^2-bc+1|+|b^2-ac+1|+|c^2-ba+1|$ when $a,b,c$ are reals in $[-2;2]$.
2016 Tournament Of Towns, 1
$100$ children stand in a line each having $100$ candies. In one move, one of them may take some of their candies and distribute them to a non-empty set of the remaining children. After what least number of moves can it happen that no two children have the same number of candies?
[i](N. Chernyatevya)[/i]
(Translated from [url=http://sasja.shap.homedns.org/Turniry/TG/index.html]here.[/url])
1961 IMO Shortlist, 2
Let $ a$, $ b$, $ c$ be the sides of a triangle, and $ S$ its area. Prove:
\[ a^{2} \plus{} b^{2} \plus{} c^{2}\geq 4S \sqrt {3}
\]
In what case does equality hold?
1996 IberoAmerican, 1
Given a natural number $n \geq 2$, consider all the fractions of the form $\frac{1}{ab}$, where $a$ and $b$ are natural numbers, relative primes and such that:
$a < b \leq n$,
$a+b>n$.
Show that for each $n$, the sum of all this fractions are $\frac12$.
2017 Bundeswettbewerb Mathematik, 1
For which integers $n \geq 4$ is the following procedure possible? Remove one number of the integers $1,2,3,\dots,n+1$ and arrange them in a sequence $a_1,a_2,\dots,a_n$ such that of the $n$ numbers \[ |a_1-a_2|,|a_2-a_3|,\dots,|a_{n-1}-a_n|,|a_n-a_1| \] no two are equal.
2014 AIME Problems, 7
Let $f(x) = (x^2+3x+2)^{\cos(\pi x)}$. Find the sum of all positive integers $n$ for which \[\left| \sum_{k=1}^n \log_{10} f(k) \right| = 1.\]
1999 Switzerland Team Selection Test, 3
Find all functions $f : R -\{0\} \to R$ that satisfy $\frac{1}{x}f(-x)+ f\left(\frac{1}{x}\right)= x$ for all $x \ne 0$.
2023-IMOC, G2
$P$ is a point inside $\triangle ABC$. $AP, BP, CP$ intersects $BC, CA, AB$ at $D, E, F$, respectively. $AD$ meets $(ABC)$ again at $D_1$. $S$ is a point on $(ABC)$. Lines $AS$, $EF$ intersect at $T$, lines $TP, BC$ intersect at $K$, and $KD_1$ meets $(ABC)$ again at $X$. Prove that $S, D, X$ are colinear.
LMT Guts Rounds, 2020 F24
In the Oxtingnle math team, there are $5$ students, numbered $1$ to $5$, all of which either always tell the truth or always lie. When Marpeh asks the team about how they did in a $10$ question competition, each student $i$ makes $5$ separate statements (so either they are all false or all true): "I got problems $i+1$ to $2i$, inclusive, wrong", and then "Student $j$ got both problems $i$ and $2i$ correct" for all $j \neq i$. What is the most problems the team could have gotten correctly?
[i]Proposed by Jeff Lin[/i]
1996 Canadian Open Math Challenge, 8
Determine all pairs of integers $(x,y)$ which satisfy the equation
\[ 6x^2-3xy-13x+5y = -11 \]