Found problems: 85335
The diagonals of the inscribed quadrangle $ABCD$ intersect at point $K$. Prove that the tangent at point $K$ to the circle circumscribed around the triangle $ABK$ is parallel to $CD$.
(A Zaslavsky)
Let be given an acute triangle $ABC$. Show that there exist unique points $A_1 \in BC$, $B_1 \in CA$, $C_1 \in AB$ such that each of these three points is the midpoint of the segment whose endpoints are the orthogonal projections of the other two points on the corresponding side. Prove that the triangle $A_1B_1C_1$ is similar to the triangle whose side lengths are the medians of $\triangle ABC$.
Find all functions $f:\mathbb R^+ \rightarrow \mathbb R^+$ such that for all positive real numbers $x,y$,
\[x^2[f(x)+f(y)]=(x+y)f(yf(x)).\]
Find the sum of the roots of $\tan^2x-9\tan x+1=0$ that are between $x=0$ and $x=2\pi$ radians.
$ \textbf{(A)}\ \frac{\pi}{2} \qquad\textbf{(B)}\ \pi \qquad\textbf{(C)}\ \frac{3\pi}{2} \qquad\textbf{(D)}\ 3\pi \qquad\textbf{(E)}\ 4\pi $
Let $ABC$ be a triangle, and let $r$ denote its inradius. Let $R_A$ denote the radius of the circle internally tangent at $A$ to the circle $ABC$ and tangent to the line $BC$; the radii $R_B$ and $R_C$ are defined similarly. Show that $\frac{1}{R_A} + \frac{1}{R_B} + \frac{1}{R_C}\leq\frac{2}{r}$.
In acute triangle $ABC$ ($AB \neq AC$), $I$ is its incenter and $J$ is the $A$-excenter. $X, Y$ are on minor arcs $\widehat{AB}$ and $\widehat{AC}$ respectively such that $\angle{AXI}=\angle{AYJ}=90^{\circ}$. $K$ is on line $BC$ such that $KI=KJ$.
Proof that line $AK$ bisects $\overline{XY}$.
Show that there exists a positive real $C$ such that for any naturals $H,N$ satisfying $H \geq 3, N \geq e^{CH}$, for any subset of $\{1,2,\ldots,N\}$ with size $\lceil \frac{CHN}{\ln N} \rceil$, one can find $H$ naturals in it such that the greatest common divisor of any two elements is the greatest common divisor of all $H$ elements.
Andy is planning to flip a fair coin 10 times. Among the 10 flips, Valencia randomly chooses one flip to exchange Andy's fair coin with her special coin which lands on heads with a probability of $\frac{1}{4}$. If the coin is exchanged in a certain flip, then that flip, along with all following flips will be performed with the special coin. The expected number of heads Andy flips can be expressed as $\frac{m}{n}$ where $m$ and $n$ are positive integers. Find $m+n$.
[i]Proposed by Andy Xu[/i]
For each nonzero integer $ n$ find all functions $ f: \mathbb{R} \minus{} \{\minus{}3,0 \} \rightarrow \mathbb{R}$ satisfying:
$ f(x\plus{}3)\plus{}f \left( \minus{}\frac{9}{x} \right)\equal{}\frac{(1\minus{}n)(x^2\plus{}3x\minus{}9)}{9n(x\plus{}3)}\plus{}\frac{2}{n}$ for all $ x \not\equal{} 0,\minus{}3.$
Furthermore, for each fixed $ n$ find all integers $ x$ for which $ f(x)$ is an integer.
Let $C_1$ and $C_2$ be two concentric circles with $C_1$ inside $C_2$. Let $P_1$ and $P_2$ be two points on $C_1$ that are not diametrically opposite. Extend the segment $P_1P_2$ past $P_2$ until it meets the circle $C_2$ in $Q_2$. The tangent to $C_2$ at $Q_2$ and the tangent to $C_1$ at $P_1$ meet in a point $X$. Draw from X the second tangent to $C_2$ which meets $C_2$ at the point $Q_1$. Show that $P_1X$ bisects angle $Q_1P_1Q_2$.
For a class of $20$ students several field trips were arranged. In each trip at least four students participated. Prove that there was a field trip such that each student who participated in it took part in at least $1/17$-th of all field trips.
On a table, cards numbered $1, 2, \ldots , 200$ are laid out in a row in some order, and a line is drawn on the table between some two of them. It is allowed to swap two adjacent cards if the number on the left is greater than the number on the right. After a few such moves, the cards were arranged in ascending order. Prove we have swapped pairs of cards separated by the line no more than 1884 times.
Let $P$ be a cyclic polygon with circumcenter $O$ that does not lie on any diagonal, and let $S$ be the set of points on 2D plane containing $P$ and $O$.
The $\textit{Matcha Sweep Game}$ is a game between two players $A$ and $B$, with $A$ going first, such that each choosing a nonempty subset $T$ of points in $S$ that has not been previously chosen, and such that if $T$ has at least $3$ vertices then $T$ forms a convex polygon. The game ends with all points have been chosen, with the player picking the last point wins.
For which polygons $P$ can $A$ guarantee a win?
[i]Proposed by Anzo Teh Zhao Yang[/i]
Cars A and B travel the same distance. Care A travels half that [i]distance[/i] at $ u$ miles per hour and half at $ v$ miles per hour. Car B travels half the [i]time[/i] at $ u$ miles per hour and half at $ v$ miles per hour. The average speed of Car A is $ x$ miles per hour and that of Car B is $ y$ miles per hour. Then we always have
$ \textbf{(A)}\ x \leq y\qquad
\textbf{(B)}\ x \geq y \qquad
\textbf{(C)}\ x\equal{}y \qquad
\textbf{(D)}\ x<y\qquad
\textbf{(E)}\ x>y$
Consider an infinite series whose $n$-th term is $\pm (1\slash n)$, the $\pm$ signs being determined according
to a pattern that repeats periodically in blocks of eight (there are $2^{8}$ possible patterns).
(a) Show that a sufficient condition for the series to be conditionally convergent is that there
are four "$+$" signs and four "$-$" signs in the block of eight signs.
(b) Is this sufficient condition also necessary?
Show that in a right-angled triangle the bisector of the right angle divides into equal parts the angle between the altitude and the median, drawn from the same vertex.
The real numbers $a_0,a_1,a_2,\ldots$ satisfy $1=a_0\le a_1\le a_2\le\ldots. b_1,b_2,b_3,\ldots$ are defined by $b_n=\sum_{k=1}^n{1-{a_{k-1}\over a_k}\over\sqrt a_k}$.
[b]a.)[/b] Prove that $0\le b_n<2$.
[b]b.)[/b] Given $c$ satisfying $0\le c<2$, prove that we can find $a_n$ so that $b_n>c$ for all sufficiently large $n$.
Let $ a_{ij}$ be nonnegative integers such that $ a_{ij}\equal{}0$ if and only if $ i>j$ and that $ \displaystyle\sum_{j\equal{}1}^{1988}a_{ij}\equal{}1988$ holds for all $ i\equal{}1,...,1988$. Find all real solutions of the system of equations:
$ \displaystyle\sum_{j\equal{}1}^{1988} (1\plus{}a_{ij})x_j\equal{}i\plus{}1, 1 \le i \le 1988$.
If $a,b,c$ are the sides of a triangle, prove that
\[\frac{\sqrt{b+c-a}}{\sqrt{b}+\sqrt{c}-\sqrt{a}}+\frac{\sqrt{c+a-b}}{\sqrt{c}+\sqrt{a}-\sqrt{b}}+\frac{\sqrt{a+b-c}}{\sqrt{a}+\sqrt{b}-\sqrt{c}}\leq 3 \]
[i]Proposed by Hojoo Lee, Korea[/i]
Given three numbers $x, y, z$, and set $x_1 = |x - y|, y_1 = | y -z|, z_1 = |z- x|$.
From $x_1, y_1, z_1$, form in the same fashion the numbers $x_2, y_2, z_2$, and so on.
It is known that $x_n = x, y_n = y, z_n = z$ for some $n$. Find all possible values of $(x, y, z)$.
A pyramid has a base which is an equilateral triangle with side length $300$ centimeters. The vertex of the pyramid is $100$ centimeters above the center of the triangular base. A mouse starts at a corner of the base of the pyramid and walks up the edge of the pyramid toward the vertex at the top. When the mouse has walked a distance of $134$ centimeters, how many centimeters above the base of the pyramid is the mouse?
In a convex quadrilateral $ABCD, AC\perp BD, \angle BCA = 10^o,\angle BDA = 20^o, \angle BAC = 40^o$. Find $\angle BDC$.
The nonzero real numbers $a,b,c$ are such that: $a^2-bc= b^2-ac= c^2-ab= a^3+b^3+c^3$.
Compute the possible values of $a+b+c$.
Let $x, y \in \mathbb{R}^+$. Prove that:
\[
\left( 1 + \frac{1}{x} \right) \left( 1 + \frac{1}{y} \right) \geq \left( 1 + \frac{2}{x + y} \right)^2.
\]
If for an arbitrary permutation $(a_1,a_2,...,a_n)$ of set ${1,2,...,n}$ holds $\frac{{a_k}^2}{a_{k+1}}\leq k+2$,
$k=1,2,...,n-1$, prove that $a_k=k$ for $k=1,2,...,n$