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

Points $P$ and $Q$ on sides $AB$ and $AC$ of triangle $ABC$ are such that $PB = QC$. Prove that $PQ < BC$.
A sphere is inscribed in a tetrahedron and each point of contact of the sphere with the four faces is joined to the vertices of the face containing the point. Show that the four sets of three angles so formed are identical.
Stacy has $d$ dollars. She enters a mall with $10$ shops and a lottery stall. First she goes to the lottery and her money is doubled, then she goes into the first shop and spends $1024$ dollars. After that she alternates playing the lottery and getting her money doubled (Stacy always wins) then going into a new shop and spending $\$1024$. When she comes out of the last shop she has no money left. What is the minimum possible value of $d$?
Let $M$ be a point on the arc $AB$ of the circumcircle of the triangle $ABC$ which does not contain $C$. Suppose that the projections of $M$ onto the lines $AB$ and $BC$ lie on the sides themselves, not on their extensions. Denote these projections by $X$ and $Y$, respectively. Let $K$ and $N$ be the midpoints of $AC$ and $XY$, respectively. Prove that $\angle MNK=90^{\circ}$ .
Let $ABCD$ be a trapezoid with $AB \parallel CD$ and $AD = BD$. Let $M$ be the midpoint of $AB,$ and let $P \neq C$ be the second intersection of the circumcircle of $\triangle BCD$ and the diagonal $AC.$ Suppose that $BC = 27, CD = 25,$ and $AP = 10.$ If $MP = \tfrac {a}{b}$ for relatively prime positive integers $a$ and $b,$ compute $100a + b$.
Triangle $ABC$ is inscribed in circle $\omega$ with $AB = 5$, $BC = 7$, and $AC = 3$. The bisector of angle $A$ meets side $BC$ at $D$ and circle $\omega$ at a second point $E$. Let $\gamma$ be the circle with diameter $DE$. Circles $\omega$ and $\gamma$ meet at $E$ and a second point $F$. Then $AF^2 = \frac mn$, where m and n are relatively prime positive integers. Find $m + n$.
In a fixed plane, consider a convex quadrilateral $ABCD$. Choose a point $O$ in the plane and let $K, L, M$, and $N$ be the circumcentres of triangles $AOB, BOC, COD$, and $DOA$, respectively. Prove that there exists exactly one point $O$ in the plane such that $KLMN$ is a parallelogram.
Find $\lim_{t\rightarrow 1^-} (1-t) \sum_{n=1}^{\infty}\frac{t^n}{1+t^n}$.
Prove that for every $n \in N$ there exists exactly one sequence of $2n + 1$ consecutive numbers, such that the sum of the squares of the first $n+1$ numbers is equal to the sum of the squares of the last $n$ numbers. Also express the smallest number of that sequence in terms of $n$.
Let $A_1 , A_2 ,\ldots, A_{1066}$ be subsets of a finite set $X$ such that $|A_i | > \frac{1}{2} |X|$ for $1\leq i \leq 1066.$ Prove that there exist ten elements $x_1 ,x_2 ,\ldots , x_{10}$ of $X$ such that every $A_i $ contains at least one of $x_1 , x_2 ,\ldots, x_{10}.$
Let $x_1,x_2,\ldots,x_n$ be arbitrary real numbers. Prove the inequality \[ \frac{x_1}{1+x_1^2} + \frac{x_2}{1+x_1^2 + x_2^2} + \cdots + \frac{x_n}{1 + x_1^2 + \cdots + x_n^2} < \sqrt{n}. \]
Given a natural number $k> 1$. Prove that if through any edge of the graph $G$ passes less than $[e(k-1)! - 1]$ simple cycles, then the vertices of this graph can be colored with $k$ colors in the correct way.
In a triangle $ABC$ two points, $C_1$ and $A_1$ are marked on the sides $AB$ and $BC$ respectively (the points do not coincide with the vertices). Let $K$ be the midpoint of $A_1C_1$ and $I$ be the incentre of the triangle $ABC$. Given that the quadrilateral $A_1BC_1I$ is cyclic, prove that the angle $AKC$ is obtuse.
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.
Is there sequence $(a_n)$ of natural numbers, such that differences $\{a_{n+1}-a_n\}$ take every natural value and only one time and differences $\{a_{n+2}-a_n\}$ take every natural value greater $2015$ and only one time ? [i]A. Golovanov[/i]
Let $\{a_n\}_{n=1}^{\infty}$ be a sequence of positive integers for which \[ a_{n+2} = \left[\frac{2a_n}{a_{n+1}}\right]+\left[\frac{2a_{n+1}}{a_n}\right]. \] Prove that there exists a positive integer $m$ such that $a_m=4$ and $a_{m+1} \in\{3,4\}$. [b]Note.[/b] $[x]$ is the greatest integer not exceeding $x$.
A chessboard $1000 \times 1000$ is covered by dominoes $1 \times 10$ that can be rotated. We don't know which is the cover, but we are looking for it. For this reason, we choose a few $N$ cells of the chessboard, for which we know the position of the dominoes that cover them. Which is the minimum $N$ such that after the choice of $N$ and knowing the dominoed that cover them, we can be sure and for the rest of the cover? (Bulgaria)
Do there exist pairwise distinct rational numbers $x, y$ and $z$ such that \[\frac{1}{(x - y)^2}+\frac{1}{(y - z)^2}+\frac{1}{(z - x)^2}= 2014?\]
On the plane are $n$ paper disks of radius $1$ whose boundaries all pass through a certain point, which lies inside the region covered by the disks. Find the perimeter of this region. (P Kozhevnikov)
A team of four students goes to LMT, and each student brings a lunch. However, on the bus, the students’ lunches get mixed up, and during lunch time, each student chooses a random lunch to eat (no two students may eat the same lunch). What is the probability that each student chooses his or her own lunch correctly?
Find all pairs $ (x,y)$ of real numbers which satisfy $ x^3\minus{}y^3\equal{}4(x\minus{}y)$ and $ x^3\plus{}y^3\equal{}2(x\plus{}y)$.
Let $\omega (n)$ denote the number of prime divisors of the integer $n>1$. Find the least integer $k$ such that the inequality $2^{\omega (n) } \leq k \cdot n^{\frac 1 4}$ holds for all $n > 1.$ Pierre.
A bag contains $12$ marbles: $3$ red, $4$ green, and $5$ blue. Repeatedly draw marbles with replacement until you draw two marbles of the same color in a row. What is the expected number of times that you will draw a marble?
The sequence $a_1,a_2,\dots$ of positive integers obeys the following two conditions: [list] [*] For all positive integers $m,n$, it happens that $a_m\cdot a_n=a_{mn}$ [*] There exist infinite positive integers $n$ such that $(a_1,a_2,\dots,a_n)$ is a permutation of $(1,2,\dots,n)$ [/list] Prove that $a_n=n$ for all positive integers $n$. [i]Proposed by José Alejandro Reyes González[/i]
Given $ n \geq 3$, $ n$ is a integer. Prove that: \[ (2^n \minus{} 2) \cdot \sqrt{2i\minus{}1} \geq \left( \sum_{j\equal{}0}^{i\minus{}1}C_n^j \plus{} C_{n\minus{}1}^{i\minus{}1} \right) \cdot \sqrt{n}\] where if $ n$ is even, then $ \displaystyle 1 \leq i \leq \frac{n}{2}$; if $ n$ is odd, then $ \displaystyle 1 \leq i \leq \frac{n\minus{}1}{2}$.