Found problems: 701
2009 Tuymaada Olympiad, 1
Three real numbers are given. Fractional part of the product of every two of them is $ 1\over 2$. Prove that these numbers are irrational.
[i]Proposed by A. Golovanov[/i]
2021 China Team Selection Test, 5
Find the smallest real $\alpha$, such that for any convex polygon $P$ with area $1$, there exist a point $M$ in the plane, such that the area of convex hull of $P\cup Q$ is at most $\alpha$, where $Q$ denotes the image of $P$ under central symmetry with respect to $M$.
2009 Today's Calculation Of Integral, 401
For real number $ a$ with $ |a|>1$, evaluate $ \int_0^{2\pi} \frac{d\theta}{(a\plus{}\cos \theta)^2}$.
1975 Chisinau City MO, 110
Prove that any centrally symmetric convex octagon has a diagonal passing through the center of symmetry that is not parallel to any of its sides.
1997 Turkey Junior National Olympiad, 2
Let $ABC$ be a triangle with $|AB|=|AC|=26$, $|BC|=20$. The altitudes of $\triangle ABC$ from $A$ and $B$ cut the opposite sides at $D$ and $E$, respectively. Calculate the radius of the circle passing through $D$ and tangent to $AC$ at $E$.
2007 All-Russian Olympiad, 8
Given an undirected graph with $N$ vertices. For any set of $k$ vertices, where $1\le k\le N$, there are at most $2k-2$ edges, which join vertices of this set. Prove that the edges may be coloured in two colours so that each cycle contains edges of both colours. (Graph may contain multiple edges).
[i]I. Bogdanov, G. Chelnokov[/i]
2012 NIMO Problems, 8
Bob has invented the Very Normal Coin (VNC). When the VNC is flipped, it shows heads $\textstyle\frac{1}{2}$ of the time and tails $\textstyle\frac{1}{2}$ of the time - unless it has yielded the same result five times in a row, in which case it is guaranteed to yield the opposite result. For example, if Bob flips five heads in a row, then the next flip is guaranteed to be tails.
Bob flips the VNC an infinite number of times. On the $n$th flip, Bob bets $2^{-n}$ dollars that the VNC will show heads (so if the second flip shows heads, Bob wins $\$0.25$, and if the third flip shows tails, Bob loses $\$0.125$).
Assume that dollars are infinitely divisible. Given that the first flip is heads, the expected number of dollars Bob is expected to win can be expressed as $\frac{a}{b}$ for relatively prime positive integers $a, b$. Compute $100a + b$.
[i]Proposed by Lewis Chen[/i]
2000 IMC, 5
Find all functions $\mathbb{R}^+\rightarrow\mathbb{R}^+$ for which we have for all $x,y\in \mathbb{R}^+$ that $f(x)f(yf(x))=f(x+y)$.
2013 ELMO Shortlist, 10
Let $AB=AC$ in $\triangle ABC$, and let $D$ be a point on segment $AB$. The tangent at $D$ to the circumcircle $\omega$ of $BCD$ hits $AC$ at $E$. The other tangent from $E$ to $\omega$ touches it at $F$, and $G=BF \cap CD$, $H=AG \cap BC$. Prove that $BH=2HC$.
[i]Proposed by David Stoner[/i]
2019 Hong Kong TST, 2
Let $ABC$ be a triangle with $AB=AC$, and let $M$ be the midpoint of $BC$. Let $P$ be a point such that $PB<PC$ and $PA$ is parallel to $BC$. Let $X$ and $Y$ be points on the lines $PB$ and $PC$, respectively, so that $B$ lies on the segment $PX$, $C$ lies on the segment $PY$, and $\angle PXM=\angle PYM$. Prove that the quadrilateral $APXY$ is cyclic.
2010 All-Russian Olympiad Regional Round, 9.4
In triangle $ABC$, $\angle A =60^o$. Let $BB_1$ and $CC_1$ be angle bisectors of this triangle. Prove that the point symmetrical to vertex $A$ with respect to line $B_1C_1$ lies on side $BC$.
1990 AMC 8, 3
What fraction of the square is shaded?
[asy]
draw((0,0)--(0,3)--(3,3)--(3,0)--cycle);
draw((0,2)--(2,2)--(2,0)); draw((0,1)--(1,1)--(1,0)); draw((0,0)--(3,3));
fill((0,0)--(0,1)--(1,1)--cycle,grey);
fill((1,0)--(1,1)--(2,2)--(2,0)--cycle,grey);
fill((0,2)--(2,2)--(3,3)--(0,3)--cycle,grey);[/asy]
$ \text{(A)}\ \frac{1}{3}\qquad\text{(B)}\ \frac{2}{5}\qquad\text{(C)}\ \frac{5}{12}\qquad\text{(D)}\ \frac{3}{7}\qquad\text{(E)}\ \frac{1}{2} $
2014 France Team Selection Test, 5
Let $\omega$ be the circumcircle of a triangle $ABC$. Denote by $M$ and $N$ the midpoints of the sides $AB$ and $AC$, respectively, and denote by $T$ the midpoint of the arc $BC$ of $\omega$ not containing $A$. The circumcircles of the triangles $AMT$ and $ANT$ intersect the perpendicular bisectors of $AC$ and $AB$ at points $X$ and $Y$, respectively; assume that $X$ and $Y$ lie inside the triangle $ABC$. The lines $MN$ and $XY$ intersect at $K$. Prove that $KA=KT$.
2014 NIMO Problems, 2
Two points $A$ and $B$ are selected independently and uniformly at random along the perimeter of a unit square with vertices at $(0,0)$, $(1,0)$, $(0,1)$, and $(1,1)$. The probability that the $y$-coordinate of $A$ is strictly greater than the $y$-coordinate of $B$ can be expressed as $\tfrac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. Compute $100m+n$.
[i]Proposed by Rajiv Movva[/i]
2009 AMC 10, 5
What is the sum of the digits of the square of $ 111,111,111$?
$ \textbf{(A)}\ 18 \qquad
\textbf{(B)}\ 27 \qquad
\textbf{(C)}\ 45 \qquad
\textbf{(D)}\ 63 \qquad
\textbf{(E)}\ 81$
1983 IMO Longlists, 56
Consider the expansion
\[(1 + x + x^2 + x^3 + x^4)^{496} = a_0 + a_1x + \cdots + a_{1984}x^{1984}.\]
[b](a)[/b] Determine the greatest common divisor of the coefficients $a_3, a_8, a_{13}, \ldots , a_{1983}.$
[b](b)[/b] Prove that $10^{340 }< a_{992} < 10^{347}.$
2007 AMC 12/AHSME, 16
Each face of a regular tetrahedron is painted either red, white or blue. Two colorings are considered indistinguishable if two congruent tetrahedra with those colorings can be rotated so that their appearances are identical. How many distinguishable colorings are possible?
$ \textbf{(A)}\ 15 \qquad \textbf{(B)}\ 18 \qquad \textbf{(C)}\ 27 \qquad \textbf{(D)}\ 54 \qquad \textbf{(E)}\ 81$
2002 Junior Balkan Team Selection Tests - Romania, 4
Let $ABCD$ be a unit square. For any interior points $M,N$ such that the line $MN$ does not contain a vertex of the square, we denote by $s(M,N)$ the least area of the triangles having their vertices in the set of points $\{ A,B,C,D,M,N\}$. Find the least number $k$ such that $s(M,N)\le k$, for all points $M,N$.
[i]Dinu Șerbănescu[/i]
1978 IMO Longlists, 4
Two identically oriented equilateral triangles, $ABC$ with center $S$ and $A'B'C$, are given in the plane. We also have $A' \neq S$ and $B' \neq S$. If $M$ is the midpoint of $A'B$ and $N$ the midpoint of $AB'$, prove that the triangles $SB'M$ and $SA'N$ are similar.
2002 Moldova National Olympiad, 4
The circles $ C_1$ and $ C_2$ with centers $ O_1$ and $ O_2$ respectively are externally tangent. Their common tangent not intersecting the segment $ O_1O_2$ touches $ C_1$ at $ A$ and $ C_2$ at $ B$. Let $ C$ be the reflection of $ A$ in $ O_1O_2$ and $ P$ be the intersection of $ AC$ and $ O_1O_2$. Line $ BP$ meets $ C_2$ again at $ L$. Prove that line $ CL$ is tangent to the circle $ C_2$.
2007 Sharygin Geometry Olympiad, 4
A quadrilateral A$BCD$ is inscribed into a circle with center $O$. Points $C', D'$ are the reflections of the orthocenters of triangles $ABD$ and $ABC$ at point $O$. Lines $BD$ and $BD'$ are symmetric with respect to the bisector of angle $ABC$. Prove that lines $AC$ and $AC'$ are symmetric with respect to the bisector of angle $DAB$.
2013 ELMO Shortlist, 6
A $4\times4$ grid has its 16 cells colored arbitrarily in three colors. A [i]swap[/i] is an exchange between the colors of two cells. Prove or disprove that it always takes at most three swaps to produce a line of symmetry, regardless of the grid's initial coloring.
[i]Proposed by Matthew Babbitt[/i]
2015 Peru IMO TST, 14
Let $ n$ be a positive integer and let $ a_1,a_2,\ldots,a_n$ be positive real numbers such that:
\[ \sum^n_{i \equal{} 1} a_i \equal{} \sum^n_{i \equal{} 1} \frac {1}{a_i^2}.
\]
Prove that for every $ i \equal{} 1,2,\ldots,n$ we can find $ i$ numbers with sum at least $ i$.
2009 China Team Selection Test, 1
Given that points $ D,E$ lie on the sidelines $ AB,BC$ of triangle $ ABC$, respectively, point $ P$ is in interior of triangle $ ABC$ such that $ PE \equal{} PC$ and $ \bigtriangleup DEP\sim \bigtriangleup PCA.$ Prove that $ BP$ is tangent of the circumcircle of triangle $ PAD.$
2019 Simurgh, 3
We call a graph symmetric, if we can put its vertices on the plane such that if the edges are segments, the graph has a reflectional symmetry with respect to a line not passing through its vertices. Find the least value of $K$ such that the edges of every graph with $100$ vertices, can be divided into $K$ symmetric subgraphs.