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

Let $ABC$ be an acute-angled triangle with circumcenter $O$. Let $O_1$ and $O_2$ be the circumcenters of triangles $ABO$ and $ACO$, respectively. The circumcircle of $\triangle AO_1O_2$ intersects segment $BC$ at two distinct points $P$ and $Q$, with the four points $B, P, Q, C$ appearing in this order along $BC$. Let $O_3$ be the circumcenter of $\triangle OPQ$. Prove that points $A, O, O_3$ are collinear.
A polynomial $P(x)$ is a \emph{base-$n$ polynomial} if it is of the form $a_dx^d+a_{d-1}x^{d-1}+\cdots + a_1x+a_0$, where each $a_i$ is an integer between $0$ and $n-1$ inclusive and $a_d>0$. Find the largest positive integer $n$ such that for any real number $c$, there exists at most one base-$n$ polynomial $P(x)$ for which $P(\sqrt 2+\sqrt 3)=c$. [i]Proposed by James Lin.[/i]
In a scalene triangle $ABC$ with incenter $I$, the incircle is tangent to sides $CA$ and $AB$ at points $E$ and $F$. The tangents to the circumcircle of triangle $AEF$ at $E$ and $F$ meet at $S$. Lines $EF$ and $BC$ intersect at $T$. Prove that the circle with diameter $ST$ is orthogonal to the nine-point circle of triangle $BIC$. [i]Proposed by Evan Chen[/i]
Consider the sequence $s_0 = (1, 2008)$. Define new sequences $s_i$ inductively by inserting the sum of each pair of adjacent terms in $s_{i-1}$ between them — for instance, $s_1 = (1, 2009, 2008)$. For some $n, s_n$ has exactly one term that appears twice. Find this repeated term.
If a,b,c positive numbers and such that $a+\sqrt{b+\sqrt{c}}=c+\sqrt{b+\sqrt{a}}$. Prove that if $a\neq c$ then $40ac<1$.
We call an infinite set $S\subseteq\mathbb{N}$ good if for all parwise different integers $a,b,c\in S$, all positive divisors of $\frac{a^c-b^c}{a-b}$ are in $S$. for all positive integers $n>1$, prove that there exists a good set $S$ such that $n \not \in S$. Proposed by Seyed Reza Hosseini Dolatabadi
A deck of eight cards has cards numbered $1, 2, 3, 4, 5, 6, 7, 8$, in that order, and a deck of five cards has cards numbered $1, 2, 3, 4, 5$, in that order. The two decks are riffle-shuffled together to form a deck with $13$ cards with the cards from each deck in the same order as they were originally. Thus, numbers on the cards might end up in the order $1122334455678$ or $1234512345678$ but not $1223144553678$. Find the number of possible sequences of the $13$ numbers.
Let $ABCDEF$ be a convex hexagon containing a point $P$ in its interior such that $PABC$ and $PDEF$ are congruent rectangles with $PA = BC = P D = EF$ (and $AB = PC = DE = PF$). Let $\ell$ be the line through the midpoint of $AF$ and the circumcentre of $PCD$. Prove that $\ell$ passes through $P$.
Incircle of triangle $ ABC$ touches $ AB,AC$ at $ P,Q$. $ BI, CI$ intersect with $ PQ$ at $ K,L$. Prove that circumcircle of $ ILK$ is tangent to incircle of $ ABC$ if and only if $ AB\plus{}AC\equal{}3BC$.
Length of edges of regular triangle $ABC$ are $4$, $D\in BC,E\in CA,F\in AB$, satisfying: $|AE|=|BF|=|CD|=1$. $BE\cap CF=R, CF\cap AD=Q, AD\cap BE=S$. $P$ is a point inside $\triangle RQS$ or on its sides. Note that $x=d(P,BC),y=d(P,CA),z=d(P,AB)$. [b](a)[/b] $xyz$ get its minumum value when $P=R$ (or$Q,S$). [b](b)[/b] Calculate the minumum value of $xyz$.
A hexagon is inscribed in a circle. Five of the sides have length 81 and the sixth, denoted by $\overline{AB}$, has length 31. Find the sum of the lengths of the three diagonals that can be drawn from $A$.
A region is bounded by semicircular arcs constructed on the side of a square whose sides measure $ 2/\pi $, as shown. What is the perimeter of this region? [asy] size(90); defaultpen(linewidth(0.7)); filldraw((0,0)--(2,0)--(2,2)--(0,2)--cycle,gray(0.5)); filldraw(arc((1,0),1,180,0, CCW)--cycle,gray(0.7)); filldraw(arc((0,1),1,90,270)--cycle,gray(0.7)); filldraw(arc((1,2),1,0,180)--cycle,gray(0.7)); filldraw(arc((2,1),1,270,90, CCW)--cycle,gray(0.7));[/asy] $ \textbf{(A) }\frac {4}\pi\qquad\textbf{(B) }2\qquad\textbf{(C) }\frac {8}\pi\qquad\textbf{(D) }4\qquad\textbf{(E) }\frac{16}{\pi} $
Let $a_1,a_2,a_3,\ldots$ be an infinite sequence where for all positive integers $i$, $a_i$ is chosen to be a random positive integer between $1$ and $2016$, inclusive. Let $S$ be the set of all positive integers $k$ such that for all positive integers $j<k$, $a_j\neq a_k$. (So $1\in S$; $2\in S$ if and only if $a_1\neq a_2$; $3\in S$ if and only if $a_1\neq a_3$ and $a_2\neq a_3$; and so on.) In simplest form, let $\dfrac{p}{q}$ be the expected number of positive integers $m$ such that $m$ and $m+1$ are in $S$. Compute $pq$.
Let $p(x)$ be a polynomial of degree 4 with leading coefficients 1. Suppose $p(1)=1$, $p(2)=2$, $p(3)=3$, $p(4)=4$. Then $p(5)=$ [list=1] [*] 5 [*] $\frac{25}{6}$ [*] 29 [*] 35 [/list]
Let $M$ be a set of six distinct positive integers whose sum is $60$. These numbers are written on the faces of a cube, one number to each face. A [i]move[/i] consists of choosing three faces of the cube that share a common vertex and adding $1$ to the numbers on those faces. Determine the number of sets $M$ for which it’s possible, after a finite number of moves, to produce a cube all of whose sides have the same number.
The leader of an IMO team chooses positive integers $n$ and $k$ with $n > k$, and announces them to the deputy leader and a contestant. The leader then secretly tells the deputy leader an $n$-digit binary string, and the deputy leader writes down all $n$-digit binary strings which differ from the leader’s in exactly $k$ positions. (For example, if $n = 3$ and $k = 1$, and if the leader chooses $101$, the deputy leader would write down $001, 111$ and $100$.) The contestant is allowed to look at the strings written by the deputy leader and guess the leader’s string. What is the minimum number of guesses (in terms of $n$ and $k$) needed to guarantee the correct answer?
Let $P(x)$ = $a_0+a_1x+a_2x^2+\cdots +a_nx^n$ be a polynomial in which $a_i$ is non-negative integer for each $i \in$ {$0,1,2,3,....,n$} . If $P(1) = 4$ and $P(5) = 136$, what is the value of $P(3)$?
Let $ABCD$ be a square with side length $100$. A circle with centre $C$ and radius $CD$ is drawn. Another circle of radius $r$, lying inside $ABCD$, is drawn to touch this circle externally and such that the circle also touches $AB$ and $AD$. If $r=m+n\sqrt{k}$, where $m,n$ are integers and $k$ is a prime number, find the value of $\frac{m+n}k$.
Two real numbers $x$ and $y$ are such that $8y^4+4x^2y^2+4xy^2+2x^3+2y^2+2x=x^2+1$. Find all possible values of $x+2y^2$
Prove, that for any positive real numbers $a, b, c$ who satisfy $a^2+b^2+c^2=1$ the following inequality holds. $\sqrt{\frac{1}{a}-a}+\sqrt{\frac{1}{b}-b}+\sqrt{\frac{1}{c}-c} \geq \sqrt{2a}+\sqrt{2b}+\sqrt{2c}$
First $20$ positive integers are written on a board. It is known that, after you erase a number from the board, there exists a number that is equal to the arithmetic mean of the rest of the numbers left on the board. Find all the numbers that could've been erased.
Let $S$ be a set with six elements. Let $P$ be the set of all subsets of $S.$ Subsets $A$ and $B$ of $S$, not necessarily distinct, are chosen independently and at random from $P$. the probability that $B$ is contained in at least one of $A$ or $S-A$ is $\frac{m}{n^{r}},$ where $m$, $n$, and $r$ are positive integers, $n$ is prime, and $m$ and $n$ are relatively prime. Find $m+n+r.$ (The set $S-A$ is the set of all elements of $S$ which are not in $A.$)
There is an equilateral triangle with side $d{}$ and a point $P{}$ such that the distances from $P{}$ to the vertices of the triangle are positive numbers $a, b, c$. Prove that there exist a point $Q{}$ and an equilateral triangle with side $a{}$, such that the distances from $Q{}$ to the vertices of this triangle are $b, c, d$. [i]Alexandr Evnin[/i]
The side-lengths of two equilaterals $ABC$ and $KLM$ are $1$ and $1/4$, respectively. And triangle $KLM$ located inside triangle $ABC$. Denote by $\Sigma$ the sum of the distances from $A$ to lines $KL, LM$ and $MK$. Find the location of triangle $KLM$ when $\Sigma$ is maximal.
Let $ABCD$ be a trapezoid with $AB \parallel CD$. A point $T$ which is inside the trapezoid satisfies $ \angle ATD = \angle CTB$. Let line $AT$ intersects circumcircle of $ACD$ at $K$ and line $BT$ intersects circumcircle of $BCD$ at $L$.($K \neq A$ , $L \neq B$) Prove that $KL \parallel AB$.