Found problems: 603
Determine the least real number $M$ such that the inequality \[|ab(a^{2}-b^{2})+bc(b^{2}-c^{2})+ca(c^{2}-a^{2})| \leq M(a^{2}+b^{2}+c^{2})^{2}\] holds for all real numbers $a$, $b$ and $c$.
A rectangle $ D$ is partitioned in several ($ \ge2$) rectangles with sides parallel to those of $ D$. Given that any line parallel to one of the sides of $ D$, and having common points with the interior of $ D$, also has common interior points with the interior of at least one rectangle of the partition; prove that there is at least one rectangle of the partition having no common points with $ D$'s boundary.
[i]Author: Kei Irie, Japan[/i]
Prove that it is impossible to draw a convex quadrangle, with one diagonal equal to doubled another, the angle between them $45$ degrees, on the coordinate plane, so, that all the vertices' coordinates would be integers.
Consider a $100\times 100$ square unit lattice $\textbf{L}$ (hence $\textbf{L}$ has $10000$ points). Suppose $\mathcal{F}$ is a set of polygons such that all vertices of polygons in $\mathcal{F}$ lie in $\textbf{L}$ and every point in $\textbf{L}$ is the vertex of exactly one polygon in $\mathcal{F}.$ Find the maximum possible sum of the areas of the polygons in $\mathcal{F}.$
[i]Michael Ren and Ankan Bhattacharya, USA[/i]
Let $A$, $B$, $C$, and $D$ be points in the coordinate plane on the hyperbola $\tfrac{x^{2}}{20}-\tfrac{y^{2}}{24}=1$ such that $ABCD$ is a rhombus whose diagonals intersect at the origin. Find the greatest real number that is less than $BD^{2}$ for all such rhombi.
Let $P$ be a point in the plane of triangle $ABC$ such that the segments $PA$, $PB$, and $PC$ are the sides of an obtuse triangle. Assume that in this triangle the obtuse angle opposes the side congruent to $PA$. Prove that $\angle BAC$ is acute.
A sequence $ (a_1,b_1)$, $ (a_2,b_2)$, $ (a_3,b_3)$, $ \ldots$ of points in the coordinate plane satisfies \[ (a_{n \plus{} 1}, b_{n \plus{} 1}) \equal{} (\sqrt {3}a_n \minus{} b_n, \sqrt {3}b_n \plus{} a_n)\hspace{3ex}\text{for}\hspace{3ex} n \equal{} 1,2,3,\ldots.\] Suppose that $ (a_{100},b_{100}) \equal{} (2,4)$. What is $ a_1 \plus{} b_1$?
$ \textbf{(A)}\\minus{} \frac {1}{2^{97}} \qquad
\textbf{(B)}\\minus{} \frac {1}{2^{99}} \qquad
\textbf{(C)}\ 0 \qquad
\textbf{(D)}\ \frac {1}{2^{98}} \qquad
\textbf{(E)}\ \frac {1}{2^{96}}$
Let $ABC$ be a triangle with $AB=5$, $BC=6$, $CA=7$. Let $D$ be a point on ray $AB$ beyond $B$ such that $BD=7$, $E$ be a point on ray $BC$ beyond $C$ such that $CE=5$, and $F$ be a point on ray $CA$ beyond $A$ such that $AF=6$. Compute the area of the circumcircle of $DEF$.
[i]Proposed by James Lin.[/i]
The positive integers from $1$ to $n^2$ are placed arbitrarily on the squares of a chess board with dimensions $n\times n$. Prove that there are two adjacent squares (having a common vertex or a common side) such that the difference between the numbers placed on them is not less than $n + 1$.
(N Sedrakyan, Yerevan)
What is the minimum value of \[\sqrt {x^2 - 4x + 7 - 2\sqrt 2} + \sqrt {x^2 - 8x + 27 - 6\sqrt 2}\] where $x$ is a real number?
$
\textbf{(A)}\ 2
\qquad\textbf{(B)}\ 3\sqrt 2
\qquad\textbf{(C)}\ 1 + \sqrt 2
\qquad\textbf{(D)}\ 2\sqrt 2
\qquad\textbf{(E)}\ \text{None of above}
$
Let $B = (-1, 0)$ and $C = (1, 0)$ be fixed points on the coordinate plane. A nonempty, bounded subset $S$ of the plane is said to be [i]nice[/i] if
$\text{(i)}$ there is a point $T$ in $S$ such that for every point $Q$ in $S$, the segment $TQ$ lies entirely in $S$; and
$\text{(ii)}$ for any triangle $P_1P_2P_3$, there exists a unique point $A$ in $S$ and a permutation $\sigma$ of the indices $\{1, 2, 3\}$ for which triangles $ABC$ and $P_{\sigma(1)}P_{\sigma(2)}P_{\sigma(3)}$ are similar.
Prove that there exist two distinct nice subsets $S$ and $S'$ of the set $\{(x, y) : x \geq 0, y \geq 0\}$ such that if $A \in S$ and $A' \in S'$ are the unique choices of points in $\text{(ii)}$, then the product $BA \cdot BA'$ is a constant independent of the triangle $P_1P_2P_3$.
Let $S$ be a square of side length $1$. Two points are chosen independently at random on the sides of $S$. The probability that the straight-line distance between the points is at least $\tfrac12$ is $\tfrac{a-b\pi}c$, where $a$, $b$, and $c$ are positive integers and $\gcd(a,b,c)=1$. What is $a+b+c$?
$\textbf{(A) }59\qquad\textbf{(B) }60\qquad\textbf{(C) }61\qquad\textbf{(D) }62\qquad\textbf{(E) }63$
In the coordinate plane the points with both coordinates being rational numbers are called rational points. For any positive integer $n$, is there a way to use $n$ colours to colour all rational points, every point is coloured one colour, such that any line segment with both endpoints being rational points contains the rational points of every colour?
Circle $\omega$ is inscribed in unit square $PLUM$, and points $I$ and $E$ lie on $\omega$ such that $U,I,$ and $E$ are collinear. Find, with proof, the greatest possible area for $\triangle PIE$.
In a city, there are some buildings. We say the building $A$ is dominant to the building $B$ if the line that connects upside of $A$ to upside of $B$ makes an angle more than $45^{\circ}$ with earth. We want to make a building in a given location. Suppose none of the buildings are dominant to each other. Prove that we can make the building with a height such that again, none of the buildings are dominant to each other. (Suppose the city as a horizontal plain and each building as a perpendicular line to the plain.)
A flea jumps in a straight numbered line. It jumps first from point $0$ to point $1$. Afterwards, if its last jump was from $A$ to $B$, then the next jump is from $B$ to one of the points $B + (B - A) - 1$, $B + (B - A)$, $B + (B-A) + 1$.
Prove that if the flea arrived twice at the point $n$, $n$ positive integer, then it performed at least $\lceil 2\sqrt n\rceil$ jumps.
Let $ ABC$ be an isosceles triangle with $ AB \equal{} AC$. $ M$ is the midpoint of $ BC$ and $ O$ is the point on the line $ AM$ such that $ OB$ is perpendicular to $ AB$. $ Q$ is an arbitrary point on $ BC$ different from $ B$ and $ C$. $ E$ lies on the line $ AB$ and $ F$ lies on the line $ AC$ such that $ E, Q, F$ are distinct and collinear. Prove that $ OQ$ is perpendicular to $ EF$ if and only if $ QE \equal{} QF$.
A block of wood has the shape of a right circular cylinder with radius $6$ and height $8$, and its entire surface has been painted blue. Points $A$ and $B$ are chosen on the edge on one of the circular faces of the cylinder so that $\overarc{AB}$ on that face measures $120^\circ$. The block is then sliced in half along the plane that passes through point $A$, point $B$, and the center of the cylinder, revealing a flat, unpainted face on each half. The area of one of those unpainted faces is $a\cdot\pi + b\sqrt{c}$, where $a$, $b$, and $c$ are integers and $c$ is not divisible by the square of any prime. Find $a+b+c$.
[asy]import three; import solids;
size(8cm);
currentprojection=orthographic(-1,-5,3);
picture lpic, rpic;
size(lpic,5cm);
draw(lpic,surface(revolution((0,0,0),(-3,3*sqrt(3),0)..(0,6,4)..(3,3*sqrt(3),8),Z,0,120)),gray(0.7),nolight);
draw(lpic,surface(revolution((0,0,0),(-3*sqrt(3),-3,8)..(-6,0,4)..(-3*sqrt(3),3,0),Z,0,90)),gray(0.7),nolight);
draw(lpic,surface((3,3*sqrt(3),8)..(-6,0,8)..(3,-3*sqrt(3),8)--cycle),gray(0.7),nolight);
draw(lpic,(3,-3*sqrt(3),8)..(-6,0,8)..(3,3*sqrt(3),8));
draw(lpic,(-3,3*sqrt(3),0)--(-3,-3*sqrt(3),0),dashed);
draw(lpic,(3,3*sqrt(3),8)..(0,6,4)..(-3,3*sqrt(3),0)--(-3,3*sqrt(3),0)..(-3*sqrt(3),3,0)..(-6,0,0),dashed);
draw(lpic,(3,3*sqrt(3),8)--(3,-3*sqrt(3),8)..(0,-6,4)..(-3,-3*sqrt(3),0)--(-3,-3*sqrt(3),0)..(-3*sqrt(3),-3,0)..(-6,0,0));
draw(lpic,(6*cos(atan(-1/5)+3.14159),6*sin(atan(-1/5)+3.14159),0)--(6*cos(atan(-1/5)+3.14159),6*sin(atan(-1/5)+3.14159),8));
size(rpic,5cm);
draw(rpic,surface(revolution((0,0,0),(3,3*sqrt(3),8)..(0,6,4)..(-3,3*sqrt(3),0),Z,230,360)),gray(0.7),nolight);
draw(rpic,surface((-3,3*sqrt(3),0)..(6,0,0)..(-3,-3*sqrt(3),0)--cycle),gray(0.7),nolight);
draw(rpic,surface((-3,3*sqrt(3),0)..(0,6,4)..(3,3*sqrt(3),8)--(3,3*sqrt(3),8)--(3,-3*sqrt(3),8)--(3,-3*sqrt(3),8)..(0,-6,4)..(-3,-3*sqrt(3),0)--cycle),white,nolight);
draw(rpic,(-3,-3*sqrt(3),0)..(-6*cos(atan(-1/5)+3.14159),-6*sin(atan(-1/5)+3.14159),0)..(6,0,0));
draw(rpic,(-6*cos(atan(-1/5)+3.14159),-6*sin(atan(-1/5)+3.14159),0)..(6,0,0)..(-3,3*sqrt(3),0),dashed);
draw(rpic,(3,3*sqrt(3),8)--(3,-3*sqrt(3),8));
draw(rpic,(-3,3*sqrt(3),0)..(0,6,4)..(3,3*sqrt(3),8)--(3,3*sqrt(3),8)..(3*sqrt(3),3,8)..(6,0,8));
draw(rpic,(-3,3*sqrt(3),0)--(-3,-3*sqrt(3),0)..(0,-6,4)..(3,-3*sqrt(3),8)--(3,-3*sqrt(3),8)..(3*sqrt(3),-3,8)..(6,0,8));
draw(rpic,(-6*cos(atan(-1/5)+3.14159),-6*sin(atan(-1/5)+3.14159),0)--(-6*cos(atan(-1/5)+3.14159),-6*sin(atan(-1/5)+3.14159),8));
label(rpic,"$A$",(-3,3*sqrt(3),0),W);
label(rpic,"$B$",(-3,-3*sqrt(3),0),W);
add(lpic.fit(),(0,0));
add(rpic.fit(),(1,0));[/asy]
A hunter and an invisible rabbit play a game on an infinite square grid. First the hunter fixes a colouring of the cells with finitely many colours. The rabbit then secretly chooses a cell to start in. Every minute, the rabbit reports the colour of its current cell to the hunter, and then secretly moves to an adjacent cell that it has not visited before (two cells are adjacent if they share an edge). The hunter wins if after some finite time either:[list][*]the rabbit cannot move; or
[*]the hunter can determine the cell in which the rabbit started.[/list]Decide whether there exists a winning strategy for the hunter.
[i]Proposed by Aron Thomas[/i]
We say that a function $f: \mathbb{Z}_{\ge 0} \times \mathbb{Z}_{\ge 0} \to \mathbb{Z}$ is [i]great[/i] if for any nonnegative integers $m$ and $n$,
\[f(m + 1, n + 1) f(m, n) - f(m + 1, n) f(m, n + 1) = 1.\]
If $A = (a_0, a_1, \dots)$ and $B = (b_0, b_1, \dots)$ are two sequences of integers, we write $A \sim B$ if there exists a great function $f$ satisfying $f(n, 0) = a_n$ and $f(0, n) = b_n$ for every nonnegative integer $n$ (in particular, $a_0 = b_0$).
Prove that if $A$, $B$, $C$, and $D$ are four sequences of integers satisfying $A \sim B$, $B \sim C$, and $C \sim D$, then $D \sim A$.
[i]Ankan Bhattacharya[/i]
Let $n\geq 2$ be an integer and let $a_1, a_2, \ldots, a_n$ be positive real numbers with sum $1$. Prove that $$\sum_{k=1}^n \frac{a_k}{1-a_k}(a_1+a_2+\cdots+a_{k-1})^2 < \frac{1}{3}.$$
Let $\triangle ABC$ be an equilateral triangle with side length $1$ and $M$ be the midpoint of side $AC$. Let $N$ be the foot of the perpendicular from $M$ to side $AB$. The angle bisector of angle $\angle BAC$ intersects $MB$ and $MN$ at $X$ and $Y$, respectively. If the area of triangle $\triangle MXY$ is $\mathcal{A}$, and $\mathcal{A}^2$ can be expressed as a common fraction in the form $\tfrac{m}{n}$ where $m$ and $n$ are relatively prime positive integers, find $m + n$.
In $\triangle ABC$, $AC = BC$, and point $D$ is on $\overline{BC}$ so that $CD = 3 \cdot BD$. Let $E$ be the midpoint of $\overline{AD}$. Given that $CE = \sqrt{7}$ and $BE = 3$, the area of $\triangle ABC$ can be expressed in the form $m\sqrt{n}$, where $m$ and $n$ are positive integers and $n$ is not divisible by the square of any prime. Find $m+n$.
In parallelogram $ ABCD$, point $ M$ is on $ \overline{AB}$ so that $ \frac{AM}{AB} \equal{} \frac{17}{1000}$ and point $ N$ is on $ \overline{AD}$ so that $ \frac{AN}{AD} \equal{} \frac{17}{2009}$. Let $ P$ be the point of intersection of $ \overline{AC}$ and $ \overline{MN}$. Find $ \frac{AC}{AP}$.
Let $ABC$ be a triangle with incenter $I$ and let $D$ be an arbitrary point on the side $BC$. Let the line through $D$ perpendicular to $BI$ intersect $CI$ at $E$. Let the line through $D$ perpendicular to $CI$ intersect $BI$ at $F$. Prove that the reflection of $A$ across the line $EF$ lies on the line $BC$.