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: 85335

1958 Czech and Slovak Olympiad III A, 4

Consider positive numbers $d,v$ such that $d>v$. Moreover, consider two perpendicular skew lines $p,q$ of distance $v$ (that is direction vectors of both lines are orthogonal and $\min_{X\in p,Y\in q}XY = v$). Finally, consider all line segments $PQ$ such that $P\in p, Q\in q, PQ=d$. a) Find the locus of all points $P$. b) Find the locus of all midpoints of segments $PQ$.

2015 German National Olympiad, 4

Let $k$ be a positive integer. Define $n_k$ to be the number with decimal representation $70...01$ where there are exactly $k$ zeroes. Prove the following assertions: a) None of the numbers $n_k$ is divisible by $13$. b) Infinitely many of the numbers $n_k$ are divisible by $17$.

2013 Bangladesh Mathematical Olympiad, 4

Tags: algebra
Higher Secondary P4 If the fraction $\dfrac{a}{b}$ is greater than $\dfrac{31}{17}$ in the least amount while $b<17$, find $\dfrac{a}{b}$.

LMT Team Rounds 2021+, A15 B20

Tags:
Andy and Eddie play a game in which they continuously flip a fair coin. They stop flipping when either they flip tails, heads, and tails consecutively in that order, or they flip three tails in a row. Then, if there has been an odd number of flips, Andy wins, and otherwise Eddie wins. Given that the probability that Andy wins is $\frac{m}{n}$, where $m$ and $n$ are relatively prime positive integers, find $m+n$. [i]Proposed by Anderw Zhao and Zachary Perry[/i]

2007 Ukraine Team Selection Test, 11

We have $ n \geq 2$ lamps $ L_{1}, . . . ,L_{n}$ in a row, each of them being either on or off. Every second we simultaneously modify the state of each lamp as follows: if the lamp $ L_{i}$ and its neighbours (only one neighbour for $ i \equal{} 1$ or $ i \equal{} n$, two neighbours for other $ i$) are in the same state, then $ L_{i}$ is switched off; – otherwise, $ L_{i}$ is switched on. Initially all the lamps are off except the leftmost one which is on. $ (a)$ Prove that there are infinitely many integers $ n$ for which all the lamps will eventually be off. $ (b)$ Prove that there are infinitely many integers $ n$ for which the lamps will never be all off.

2006 China Team Selection Test, 1

$ABCD$ is a trapezoid with $AB || CD$. There are two circles $\omega_1$ and $\omega_2$ is the trapezoid such that $\omega_1$ is tangent to $DA$, $AB$, $BC$ and $\omega_2$ is tangent to $BC$, $CD$, $DA$. Let $l_1$ be a line passing through $A$ and tangent to $\omega_2$(other than $AD$), Let $l_2$ be a line passing through $C$ and tangent to $\omega_1$ (other than $CB$). Prove that $l_1 || l_2$.

2009 Poland - Second Round, 3

For every integer $n\ge 3$ find all sequences of real numbers $(x_1,x_2,\ldots ,x_n)$ such that $\sum_{i=1}^{n}x_i=n$ and $\sum_{i=1}^{n} (x_{i-1}-x_i+x_{i+1})^2=n$, where $x_0=x_n$ and $x_{n+1}=x_1$.

2005 District Olympiad, 2

Let $ABC$ be a triangle inscribed in a circle of center $O$ and radius $R$. Let $I$ be the incenter of $ABC$, and let $r$ be the inradius of the same triangle, $O\neq I$, and let $G$ be its centroid. Prove that $IG\perp BC$ if and only if $b=c$ or $b+c=3a$.

2021-2022 OMMC, 8

Isaac repeatedly flips a fair coin. Whenever a particular face appears for the $2n+1$th time, for any nonnegative integer $n$, he earns a point. The expected number of flips it takes for Isaac to get $10$ points is $\tfrac ab$ for coprime positive integers $a$ and $b$. Find $a + b$. [i]Proposed by Isaac Chen[/i]

2019 Germany Team Selection Test, 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.

1968 All Soviet Union Mathematical Olympiad, 099

Tags: geometry , diagonal
The difference between the maximal and the minimal diagonals of the regular $n$-gon equals to its side ( $n > 5$ ). Find $n$.

1988 Romania Team Selection Test, 16

The finite sets $A_1$, $A_2$, $\ldots$, $A_n$ are given and we denote by $d(n)$ the number of elements which appear exactly in an odd number of sets chosen from $A_1$, $A_2$, $\ldots$, $A_n$. Prove that for any $k$, $1\leq k\leq n$ the number \[{ d(n) - \sum\limits^n_{i=1} |A_i| + 2\sum\limits_{ i<j} |A_i \cap A_j | - \cdots + (-1)^k2^{k-1} \sum\limits_{i_1 <i_2 <\cdots < i_k} | A_{i_1} \cap A_{i_2} \cap \cdots \cap A_{i_k}}| \] is divisible by $2^k$. [i]Ioan Tomescu, Dragos Popescu[/i]

2017 India IMO Training Camp, 1

Suppose $f,g \in \mathbb{R}[x]$ are non constant polynomials. Suppose neither of $f,g$ is the square of a real polynomial but $f(g(x))$ is. Prove that $g(f(x))$ is not the square of a real polynomial.

2022-23 IOQM India, 15

Let $x,y$ be real numbers such that $xy=1$. Let $T$ and $t$ be the largest and smallest values of the expression \\ $\hspace{2cm} \frac{(x+y)^2-(x-y)-2}{(x+y)^2+(x-y)-2}$\\. \\ If $T+t$ can be expressed in the form $\frac{m}{n}$ where $m,n$ are nonzero integers with $GCD(m,n)=1$, find the value of $m+n$.

1998 National Olympiad First Round, 4

$ x,y,z\in \mathbb R$, find the minimal value of $ f\left(x,y,z\right) = 2x^{2} + 5y^{2} + 10z^{2} - 2xy - 4yz - 6zx + 3$. $\textbf{(A)}\ 0 \qquad\textbf{(B)}\ 3 \qquad\textbf{(C)}\ -3 \qquad\textbf{(D)}\ 1 \qquad\textbf{(E)}\ \text{None}$

2013 India IMO Training Camp, 2

An integer $a$ is called friendly if the equation $(m^2+n)(n^2+m)=a(m-n)^3$ has a solution over the positive integers. [b]a)[/b] Prove that there are at least $500$ friendly integers in the set $\{ 1,2,\ldots ,2012\}$. [b]b)[/b] Decide whether $a=2$ is friendly.

LMT Speed Rounds, 8

To celebrate the $20$th LMT, the LHSMath Team bakes a cake. Each of the $n$ bakers places $20$ candles on the cake. When they count, they realize that there are $(n -1)!$ total candles on the cake. Find $n$. [i]Proposed by Christopher Cheng[/i]

2000 Mongolian Mathematical Olympiad, Problem 6

In a triangle $ABC$, the angle bisector at $A,B,C$ meet the opposite sides at $A_1,B_1,C_1$, respectively. Prove that if the quadrilateral $BA_1B_1C_1$ is cyclic, then $$\frac{AC}{AB+BC}=\frac{AB}{AC+CB}+\frac{BC}{BA+AC}.$$

1997 Vietnam Team Selection Test, 2

Tags: algebra , logarithm
Find all pairs of positive real numbers $ (a, b)$ such that for every $ n \in\mathbb{N}^*$ and every real root $ x_n$ of the equation $ 4n^2x \equal{} \log_2(2n^2x \plus{} 1)$ we always have $ a^{x_n} \plus{} b^{x_n} \ge 2 \plus{} 3x_n$.

2024 Pan-African, 2

Tags: geometry
In triangle $ABC$,let $M$ be the midpoint of the side $BC$,and $N$ is the midpoint of the segment $AM$,the circle going through $N$ and tangent the line $AC$ at $A$ intersects the segment $AB$ again in $P$. prove that the circumcircle of triangle $BPM$ is tangent the line $AM$

1988 Putnam, A3

Tags:
Determine, with proof, the set of real numbers $x$ for which \[ \sum_{n=1}^\infty \left( \frac{1}{n} \csc \frac{1}{n} - 1 \right)^x \] converges.

2012 USA TSTST, 7

Triangle $ABC$ is inscribed in circle $\Omega$. The interior angle bisector of angle $A$ intersects side $BC$ and $\Omega$ at $D$ and $L$ (other than $A$), respectively. Let $M$ be the midpoint of side $BC$. The circumcircle of triangle $ADM$ intersects sides $AB$ and $AC$ again at $Q$ and $P$ (other than $A$), respectively. Let $N$ be the midpoint of segment $PQ$, and let $H$ be the foot of the perpendicular from $L$ to line $ND$. Prove that line $ML$ is tangent to the circumcircle of triangle $HMN$.

2010 Paenza, 3

Let $(x_n)_{n \in \mathbb{N}}$ be the sequence defined as $x_n = \sin(2 \pi n! e)$ for all $n \in \mathbb{N}$. Compute $\lim_{n \to \infty} x_n$.

2014 ELMO Shortlist, 6

Tags: inequalities
Let $a,b,c$ be positive reals such that $a+b+c=ab+bc+ca$. Prove that \[ (a+b)^{ab-bc}(b+c)^{bc-ca}(c+a)^{ca-ab} \ge a^{ca}b^{ab}c^{bc}. \][i]Proposed by Sammy Luo[/i]

2005 Spain Mathematical Olympiad, 1

Let $a$ and $b$ be integers. Demonstrate that the equation $$(x-a)(x-b)(x-3) +1 = 0$$ has an integer solution.