Given an $\triangle ABC$ isoceles with base $BC$ we note with $M$ the midpoint of said base. Let $X$ be any point on the shortest arc $AM$ of the circumcircle of $\triangle ABM$ and let $T$ be a point on the inside $\angle BMA$ such that $\angle TMX = 90^o$ and $TX = BX$. Show that $\angle MTB - \angle CTM$ does not depend on $X$.

A "[size=100][i]walking sequence[/i][/size]" is a sequence of integers with $a_{i+1} = a_i \pm 1$ for every $i$ .Show that there exists a sequence $b_1, b_2, . . . , b_{2016}$ such that for every walking sequence $a_1, a_2, . . . , a_{2016}$ where $1 \leq a_i \leq1010$, there is for some $j$ for which $a_j = b_j$ .

Given a positive prime number $p$. Prove that there exist a positive integer $\alpha$ such that $p|\alpha(\alpha-1)+3$, if and only if there exist a positive integer $\beta$ such that $p|\beta(\beta-1)+25$.

If $i^2=-1$, then $(i-i^{-1})^{-1}=$ $ \textbf{(A)}\ 0 \qquad\textbf{(B)}\ -2i \qquad\textbf{(C)}\ 2i \qquad\textbf{(D)}\ -\frac{i}{2} \qquad\textbf{(E)}\ \frac{i}{2}$

Evaluate $1^3-2^3+3^3-4^3+5^3-\cdots+101^3$.

Set $S$ to be a subset of size $68$ of $\{1,2,...,2015\}$. Prove that there exist $3$ pairwise disjoint, non-empty subsets $A,B,C$ such that $|A|=|B|=|C|$ and $\sum_{a\in A}a=\sum_{b\in B}b=\sum_{c\in C}c$

Let $N$ be a positive integer. Two persons play the following game. The first player writes a list of positive integers not greater than $25$, not necessarily different, such that their sum is at least $200$. The second player wins if he can select some of these numbers so that their sum $S$ satisfies the condition $200-N\le S\le 200+N$. What is the smallest value of $N$ for which the second player has a winning strategy?

(Russia 1195) If x, y > 0, prove that x/(x^4 + y^2) + y/(y^4 + x^2) <= 1/(xy) Thoughts? By the way, this was in Kiran Kedlaya's MOP notes and said to be from Russia 1995, but John Scholes' Kalva archive doesn't have this problem under Russia 1995. Odd. Hint: [hide]This was in the Power Mean Inequality section in the lecture notes.[/hide]

Path graph $U$ is given, and a blindfolded player is standing on one of its vertices. The vertices of $U$ are labeled with positive integers between 1 and $n$, not necessarily in the natural order. In each step of the game, the game master tells the player whether he is in a vertex with degree 1 or with degree 2. If he is in a vertex with degree 1, he has to move to its only neighbour, if he is in a vertex with degree 2, he can decide whether he wants to move to the adjacent vertex with the lower or with the higher number. All the information the player has during the game after $k$ steps are the $k$ degrees of the vertices he visited and his choice for each step. Is there a strategy for the player with which he can decide in finitely many steps how many vertices the path has?

Let $ ABC$ be a triangle. A circle $ P$ is internally tangent to the circumcircle of triangle $ ABC$ at $ A$ and tangent to $ BC$ at $ D$. Let $ AD$ meets the circumcircle of $ ABC$ agin at $ Q$. Let $ O$ be the circumcenter of triangle $ ABC$. If the line $ AO$ bisects $ \angle DAC$, prove that the circle centered at $ Q$ passing through $ B$, circle $ P$, and the perpendicular line of $ AD$ from $ B$, are all concurrent.

[b]p1.[/b] A canoeist is paddling upstream in a river when she passes a log floating downstream,, She continues upstream for awhile, paddling at a constant rate. She then turns around and goes downstream and paddles twice as fast. She catches up to the same log two hours after she passed it. How long did she paddle upstream? [b]p2.[/b] Let $g(x) =1-\frac{1}{x}$ and define $g_1(x) = g(x)$ and $g_{n+1}(x) = g(g_n(x))$ for $n = 1,2,3, ...$. Evaluate $g_3(3)$ and $g_{1982}(l982)$. [b]p3.[/b] Let $Q$ denote quadrilateral $ABCD$ where diagonals $AC$ and $BD$ intersect. If each diagonal bisects the area of $Q$ prove that $Q$ must be a parallelogram. [b]p4.[/b] Given that: $a_1, a_2, ..., a_7$ and $b_1, b_2, ..., b_7$ are two arrangements of the same seven integers, prove that the product $(a_1-b_1)(a_2-b_2)...(a_7-b_7)$ is always even. [b]p5.[/b] In analyzing the pecking order in a finite flock of chickens we observe that for any two chickens exactly one pecks the other. We decide to call chicken $K$ a king provided that for any other chicken $X, K$ necks $X$ or $K$ pecks a third chicken $Y$ who in turn pecks $X$. Prove that every such flock of chickens has at least one king. Must the king be unique? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $AA_1$, $BB_1$, $CC_1$ be the altitudes of acute angled triangle $ABC$. $A_2$ be the touching point of the incircle of triangle $AB_1C_1$ with $B_1C_1$, points $B_2$, $C_2$ be defined similarly. Prove that the lines $A_1A_2$, $B_1B_2$, $C_1C_2$ concur.

Let $ABCDEF$ be a convex hexagon all of whose sides are tangent to a circle $\omega$ with centre $O$. Suppose that the circumcircle of triangle $ACE$ is concentric with $\omega$. Let $J$ be the foot of the perpendicular from $B$ to $CD$. Suppose that the perpendicular from $B$ to $DF$ intersects the line $EO$ at a point $K$. Let $L$ be the foot of the perpendicular from $K$ to $DE$. Prove that $DJ=DL$. [i]Proposed by Japan[/i]

Let right $\triangle ABC$ have $AC = 3$, $BC = 4$, and right angle at $C$. Let $D$ be the projection from $C$ to $\overline{AB}$. Let $\omega$ be a circle with center $D$ and radius $\overline{CD}$, and let $E$ be a variable point on the circumference of $\omega$. Let $F$ be the reflection of $E$ over point $D$, and let $O$ be the center of the circumcircle of $\triangle ABE$. Let $H$ be the intersection of the altitudes of $\triangle EFO$. As $E$ varies, the path of $H$ traces a region $\mathcal R$. The area of $\mathcal R$ can be written as $\tfrac{m\pi}{n}$, where $m$ and $n$ are relatively prime positive integers. Find $\sqrt{m}+\sqrt{n}$. [i]Proposed by ApraTrip[/i]

Points $A$ and $B$ are fixed points in the plane such that $AB = 1$. Find the area of the region consisting of all points $P$ such that $\angle APB > 120^o$

Let us denote with $S(n)$ the sum of all the digits of $n$. a) Is there such an $n$ that $n+S(n)=1980$? b) Prove that at least one of two arbitrary successive natural numbers is representable as $n + S(n)$ for some third number $n$.

A convex $N\text{-gon}$ is divided by diagonals into triangles so that no two diagonals intersect inside the polygon. The triangles are painted in black and white so that any two triangles are painted in black and white so that any two triangles with a common side are painted in different colors. For each $N$ find the maximal difference between the numbers of black and white triangles.

On the plane is a set of at least four points. If any one point from this set is removed, the resulting set has an axis of symmetry. Is it necessarily true that the whole set has an axis of symmetry?

Find all functions $f: \mathbb{Z}\to \mathbb{Z}$ such that for all $m,n\in \mathbb{Z}$: \[f(m+f(n)) = f(m)+n.\]

Let $a,b,c$ be positive real numbers. Find all real solutions $(x,y,z)$ of the system: \[ ax+by=(x-y)^{2} \\ by+cz=(y-z)^{2} \\ cz+ax=(z-x)^{2}\]

Given an isosceles triangle $ABC$ (with $AB=BC$). A point $X$ is chosen on a side $AC$. Some circle passes through $X$, touches the side $AC$ and intersects the circumcircle of triangle $ABC$ in points $M$ and $N$ such that the segment $MN$ bisects $BX$ and intersects sides $AB$ and $BC$ in points $P$ and $Q$. Prove that the circumcircle of triangle $PBQ$ passes through the circumcentre of triangle $ABC$. [b]proposed by Sergej Berlov[/b]

Let \(S(n)\) denote the sum of the digits of the base-10 representation of an natural number \(n\). For example. \(S(2017) = 2+0+1+7 = 10\). Prove that for all primes \(p\), there exists infinitely many \(n\) which satisfy \(S(n) \equiv n \mod p\).

Solve the equation in the set of natural numbers $xyz+yzt+xzt+xyt = xyzt + 3$

The sides of a triangle with positive area have lengths $ 4$, $ 6$, and $ x$. The sides of a second triangle with positive area have lengths $ 4$, $ 6$, and $ y$. What is the smallest positive number that is [b]not[/b] a possible value of $ |x \minus{} y|$? $ \textbf{(A)}\ 2 \qquad\textbf{(B)}\ 4 \qquad\textbf{(C)}\ 6 \qquad\textbf{(D)}\ 8\qquad\textbf{(E)}\ 10$

Mater is confused and starts going around the track in the wrong direction. He can go around 7 times in an hour. Lightning and Chick start in the same place at Mater and at the same time, both going the correct direction. Lightning can go around 91 times per hour, while Chick can go around 84 times per hour. When Lightning passes Chick for the third time, how many times will he have passed Mater (if Lightning is passing Mater just as he passes Chick for the third time, count this as passing Mater)? [i]Proposed by Matthew Weiss