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

There is a finite number of towns in a country. They are connected by one direction roads. It is known that, for any two towns, one of them can be reached from another one. Prove that there is a town such that all remaining towns can be reached from it.
Three faces of a tetrahedron are right triangles, while the fourth is not an obtuse triangle. [i](a) [/i]Prove that a necessary and sufficient condition for the fourth face to be a right triangle is that at some vertex exactly two angles are right. [i](b)[/i] Prove that if all the faces are right triangles, then the volume of the tetrahedron equals one -sixth the product of the three smallest edges not belonging to the same face.
Let $P \in \mathbb{R}[x]$. Suppose that the multiset of real roots (where roots are counted with multiplicity) of $P(x)-x$ and $P^3(x)-x$ are distinct. Prove that for all $n\in \mathbb{N}$, $P^n(x)-x$ has at least $\sigma(n)-2$ distinct real roots. (Here $P^n(x):=P(P^{n-1}(x))$ with $P^1(x) = P(x)$, and $\sigma(n)$ is the sum of all positive divisors of $n$). [i]Proposed by Malay Mahajan[/i]
In the game of Tristack Solitaire, you start with three stacks of cards, each with a different positive integer number of cards. At any time, you can double the number of cards in any one stack of cards by moving cards from exactly one other, larger, stack of cards to the stack you double. You win the game when any two of the three stacks have the same number of cards. For example, if you start with stacks of $3$, $5$, and $7$ cards, then you have three possible legal moves: [list] [*]You may move $3$ cards from the $5$-card stack to the $3$-card stack, leaving stacks of $6$, $2$, and $7$ cards. [*]You may move $3$ cards from the $7$-card stack to the $3$-card stack, leaving stacks of $6,$ $5$, and $4$ cards. [*]You may move $5$ cards from the $7$-card stack to the $5$-card stack, leaving stacks of $3$, $10$, and $2$ cards.[/list] Can you win Tristack Solitaire from any starting position? If so, then give a strategy for winning. If not, then explain why.
How many ordered pairs of positive integers $(m, n)$ satisfy the system \begin{align*} \gcd (m^3, n^2) & = 2^2 \cdot 3^2, \\ \text{LCM} [m^2, n^3] & = 2^4 \cdot 3^4 \cdot 5^6, \end{align*} where $\gcd(a, b)$ and $\text{LCM}[a, b]$ denote the greatest common divisor and least common multiple of $a$ and $b$, respectively?
If $0 < a \leq b$ then$$\frac{2}{\sqrt{3}}\tan^{-1}\left(\frac{2(b^2 - a^2)}{(a^2+2)(b^2+2)}\right)\leq \int \limits_a^b \frac{(x^2+1)(x^2+x+1)}{(x^3 + x^2 + 1) (x^3 + x + 1)}dx\leq \frac{4}{\sqrt{3}}\tan^{-1}\left(\frac{(b-a)\sqrt{3}}{a+b+2(1+ab)}\right)$$
Let us have a line $\ell$ in the space and a point $A$ not lying on $\ell.$ For an arbitrary line $\ell'$ passing through $A$, $XY$ ($Y$ is on $\ell'$) is a common perpendicular to the lines $\ell$ and $\ell'.$ Find the locus of points $Y.$
Let $ABCD$ be a convex quadrilateral and points $E$ and $F$ on sides $AB,CD$ such that \[\tfrac{AB}{AE}=\tfrac{CD}{DF}=n\] If $S$ is the area of $AEFD$ show that ${S\leq\frac{AB\cdot CD+n(n-1)AD^2+n^2DA\cdot BC}{2n^2}}$
Let $ C$ be a circle in plane. Let $ C_1$ and $ C_2$ be nonintersecting circles touching $ C$ internally at points $ A$ and $ B$ respectively. Let $ t$ be a common tangent of $ C_1$ and $ C_2$ touching them at points $ D$ and $ E$ respectively, such that both $ C_1$ and $ C_2$ are on the same side of $ t$. Let $ F$ be the point of intersection of $ AD$ and $ BE$. Show that $ F$ lies on $ C$.
Consider triangle $ABC$ with orthocenter $H$. Let points $M$ and $N$ be the midpoints of segments $BC$ and $AH$. Point $D$ lies on line $MH$ so that $AD\parallel BC$ and point $K$ lies on line $AH$ so that $DNMK$ is cyclic. Points $E$ and $F$ lie on lines $AC$ and $AB$ such that $\angle EHM=\angle C$ and $\angle FHM=\angle B$. Prove that points $D,E,F$ and $K$ lie on a circle. [i]Proposed by Alireza Dadgarnia[/i]
Let $x,y,z$ be positive real numbers satisfying the equations $$xyz=1\text{ and }\frac yz(y-x^2)+\frac zx(z-y^2)+\frac xy(x-z^2)=0$$ What is the minimum value of the ratio of the sum of the largest and smallest numbers among $x,y,z$ to the median of them.
Let $ABCD$ be a rhombus with angle $\angle A = 60^\circ$. Let $E$ be a point, different from $D$, on the line $AD$. The lines $CE$ and $AB$ intersect at $F$. The lines $DF$ and $BE$ intersect at $M$. Determine the angle $\angle BMD$ as a function of the position of $E$ on $AD.$
Let $A_1A_2A_3A_4$ be a non-cyclic quadrilateral. Let $O_1$ and $r_1$ be the circumcentre and the circumradius of the triangle $A_2A_3A_4$. Define $O_2,O_3,O_4$ and $r_2,r_3,r_4$ in a similar way. Prove that \[\frac{1}{O_1A_1^2-r_1^2}+\frac{1}{O_2A_2^2-r_2^2}+\frac{1}{O_3A_3^2-r_3^2}+\frac{1}{O_4A_4^2-r_4^2}=0.\] [i]Proposed by Alexey Gladkich, Israel[/i]
An open half-plane is the set of all points lying to one side of a line, but excluding the points on the line itself. If four open half-planes cover the plane, show that one can select three of them which still cover the plane.
Given that $x$ and $y$ are positive real numbers such that $\frac{5}{x}=\frac{y}{13}=\frac{x}{y}$, find the value of $x^3 + y^3$. Proposed by Ephram Chun
Let $a>0$ be a real number. Find the minimal constant $C_a$ for which the inequality$$\displaystyle C_a\sum_{k=1}^n \frac1{x_k-x_{k-1}} >\sum_{k=1}^n \frac{k+a}{x_k}$$holds for any positive integer $n$ and any sequence $0=x_0<x_1<\cdots <x_n$ of real numbers.
The [i]height[/i] of a positive integer is defined as being the fraction $\frac{s(a)}{a}$, where $s(a)$ is the sum of all the positive divisors of $a$. Show that for every pair of positive integers $N,k$ there is a positive integer $b$ such that the [i]height[/i] of each of $b,b+1,\cdots,b+k$ is greater than $N$.
Let $ABC$ be a triangle with right $\angle A$. Consider points $D \in (AC)$ and $E \in (BD)$ such that $\angle ABC = \angle ECD = \angle CED$. Prove that $BE = 2 \cdot AD$
In a $4\times 4$ grid of unit squares, five squares are chosen at random. The probability that no two chosen squares share a side is $\tfrac mn$ for positive relatively prime integers $m$ and $n$. Find $m+n$. [i]Proposed by David Altizio[/i]
line $l$ through the point $A$ from triangle $ABC$ . Point $X$ is on line $l$.${\omega}_b$ and ${\omega}_c$ are circles that through points $X,A$ and respectively tanget to $AB$ adn $AC$. tangets from $B,C$ respectively to ${\omega}_b$ and ${\omega}_c$ meet them in $Y,Z$. Prove that by changing $X$, the circumcircle of the circle $XYZ$ passes through two fixed points. [i]Proposed by Ali Zamani [/i]
The points $M$ and $N$ are chosen on the angle bisector $AL$ of a triangle $ABC$ such that $\angle ABM=\angle ACN=23^{\circ}$. $X$ is a point inside the triangle such that $BX=CX$ and $\angle BXC=2\angle BML$. Find $\angle MXN$.
There are $256$ players in a tennis tournament who are ranked from $1$ to $256$, with $1$ corresponding to the highest rank and $256$ corresponding to the lowest rank. When two players play a match in the tournament, the player whose rank is higher wins the match with probability $\frac{3}{5}$. In each round of the tournament, the player with the highest rank plays against the player with the second highest rank, the player with the third highest rank plays against the player with the fourth highest rank, and so on. At the end of the round, the players who win proceed to the next round and the players who lose exit the tournament. After eight rounds, there is one player remaining and they are declared the winner. Determine the expected value of the rank of the winner.
Natural $p$ and $q$ are relatively prime. The $[0,1]$ is divided onto $(p+q)$ equal segments. Prove that every segment except two marginal contain exactly one from the $(p+q-2)$ numbers $$\{1/p, 2/p, ... , (p-1)/p, 1/q, 2/q, ... , (q-1)/q\}$$
Let be two real numbers $ \alpha ,\beta $ and two sequences $ \left(x_n \right)_{n\ge 1} ,\left(y_n \right)_{n\ge 1} $ whose smallest periods are $ p,q, $ respectively. Prove that the sequence $ \left( \alpha x_n+\beta y_n\right)_{n\ge 1} $ is periodic if $ \text{gcd}^2 (p,q) | \text{lcm} (p,q) , $ and in this case find its smallest period.
Two circles intersect at two points $A$ and $B$. A line $\ell$ which passes through the point $A$ meets the two circles again at the points $C$ and $D$, respectively. Let $M$ and $N$ be the midpoints of the arcs $BC$ and $BD$ (which do not contain the point $A$) on the respective circles. Let $K$ be the midpoint of the segment $CD$. Prove that $\measuredangle MKN = 90^{\circ}$.