Found problems: 85335
Is it possible to find $p,q,r\in\mathbb Q$ such that $p+q+r=0$ and $pqr=1$?
[i]Proposed by Máté Weisz, Cambridge[/i]
A rectangle of size $ m \times n$ has been filled completely by trominoes (a tromino is an L-shape consisting of 3 unit squares).
There are four ways to place a tromino
1st way: let the "corner" of the L be on top left
2nd way: let the "corner" of the L be on top right
3rd way: let the "corner" of the L be on bottom left
4th way: let the "corner" of the L be on bottom right
Prove that the difference between the number of trominoes placed in the 1st and the 4th way is divisible by $ 3$.
Medians $ BD$ and $ CE$ of triangle $ ABC$ are perpendicular, $ BD \equal{} 8$, and $ CE \equal{} 12$. The area of triangle $ ABC$ is
[asy]defaultpen(linewidth(.8pt));
dotfactor=4;
pair A = origin;
pair B = (1.25,1);
pair C = (2,0);
pair D = midpoint(A--C);
pair E = midpoint(A--B);
pair G = intersectionpoint(E--C,B--D);
dot(A);dot(B);dot(C);dot(D);dot(E);dot(G);
label("$A$",A,S);label("$B$",B,N);label("$C$",C,S);label("$D$",D,S);label("$E$",E,NW);label("$G$",G,NE);
draw(A--B--C--cycle);
draw(B--D);
draw(E--C);
draw(rightanglemark(C,G,D,3));[/asy]$ \textbf{(A)}\ 24\qquad \textbf{(B)}\ 32\qquad \textbf{(C)}\ 48\qquad \textbf{(D)}\ 64\qquad \textbf{(E)}\ 96$
Side $ AC$ of right triangle $ ABC$ is divide into $ 8$ equal parts. Seven line segments parallel to $ BC$ are drawn to $ AB$ from the points of division. If $ BC \equal{} 10$, then the sum of the lengths of the seven line segments:
$ \textbf{(A)}\ \text{cannot be found from the given information} \qquad
\textbf{(B)}\ \text{is }{33}\qquad
\textbf{(C)}\ \text{is }{34}\qquad
\textbf{(D)}\ \text{is }{35}\qquad
\textbf{(E)}\ \text{is }{45}$
A castle has a number of halls and $n$ doors. Every door leads into another hall or outside. Every hall has at least two doors. A knight enters the castle. In any hall, he can choose any door for exit except the one he
just used to enter that hall. Find a strategy allowing the knight to get outside after visiting no more than $2n$ halls (a hall is counted each time it is entered).
Positive numbers $x_1,\ldots,x_n$ satisfy
$$\frac1{1+x_1}+\frac1{1+x_2}+\ldots+\frac1{1+x_n}=1.$$Prove that
$$\sqrt{x_1}+\sqrt{x_2}+\ldots+\sqrt{x_n}\ge(n-1)\left(\frac1{\sqrt{x_1}}+\frac1{\sqrt{x_2}}+\ldots+\frac1{\sqrt{x_n}}\right).$$
Let $ABC$ be an isosceles triangle, and point $D$ in its interior such that $$D \hat{B} C=30^\circ, D \hat{B}A=50^\circ, D \hat{C}B=55^\circ$$
(a) Prove that $\hat B=\hat C=80^\circ$.
(b) Find the measure of the angle $D \hat{A} C$.
Let $n$ be a natural number. A sequence $x_1,x_2, \cdots ,x_{n^2}$ of $n^2$ numbers is called $n-\textit{good}$ if each $x_i$ is an element of the set $\{1,2,\cdots ,n\}$ and the ordered pairs $\left(x_i,x_{i+1}\right)$ are all different for $i=1,2,3,\cdots ,n^2$ (here we consider the subscripts modulo $n^2$). Two $n-$good sequences $x_1,x_2,\cdots ,x_{n^2}$ and $y_1,y_2,\cdots ,y_{n^2}$ are called $\textit{similar}$ if there exists an integer $k$ such that $y_i=x_{i+k}$ for all $i=1,2,\cdots,n^2$ (again taking subscripts modulo $n^2$). Suppose that there exists a non-trivial permutation (i.e., a permutation which is different from the identity permutation) $\sigma$ of $\{1,2,\cdots ,n\}$ and an $n-$ good sequence $x_1,x_2,\cdots,x_{n^2}$ which is similar to $\sigma\left(x_1\right),\sigma\left(x_2\right),\cdots ,\sigma\left(x_{n^2}\right)$. Show that $n\equiv 2\pmod{4}$.
If $a@b=\dfrac{a^3-b^3}{a-b}$, for how many real values of $a$ does $a@1=0$?
Let $ m$ and $ n$ be two positive integers. Let $ a_1$, $ a_2$, $ \ldots$, $ a_m$ be $ m$ different numbers from the set $ \{1, 2,\ldots, n\}$ such that for any two indices $ i$ and $ j$ with $ 1\leq i \leq j \leq m$ and $ a_i \plus{} a_j \leq n$, there exists an index $ k$ such that $ a_i \plus{} a_j \equal{} a_k$. Show that
\[ \frac {a_1 \plus{} a_2 \plus{} ... \plus{} a_m}{m} \geq \frac {n \plus{} 1}{2}.
\]
Let $n$ be a natural number. There are $n$ blue points , $n$ red points and one green point on the circle . Prove that it is possible to draw $n$ lengths whose ends are in the given points, so that a maximum of one segment emerges from each point, no more than two segments intersect and the endpoints of none of the segments are blue and red points.
[hide=original wording]Нека je ? природан број. На кружници се налази ? плавих, ? црвених и једна зелена тачка. Доказати да је могуће повући ? дужи чији су крајеви у датим тачкама, тако да из сваке тачке излази максимално једна дуж, никоје две дужи се не сијеку и крајње тачке ниједне од дужи нису плава и црвена тачка.[/hide]
Given a scalene triangle $\vartriangle ABC$ with orthocenter $H$ and circumcenter $O$. The exterior angle bisector of $\angle BAC$ intersects circumcircle of $\vartriangle ABC$ at $N \ne A$. Let $D$ be another intersection of $HN$ and the circumcircle of $\vartriangle ABC$. The line passing through $O$, which is parallel to $AN$, intersects $AB,AC$ at $E, F$, respectively. Prove that $DH$ bisects the angle $\angle EDF$.
[img]https://3.bp.blogspot.com/-F1mFwojG_I0/XnYNR8ofqSI/AAAAAAAALeo/zge24WF0EO8umPAaXprKAeXJHAj7pr6tQCK4BGAYYCw/s1600/imoc2019g5.png[/img]
Find all functions $ f: \mathbb{Z}\setminus\{0\}\to \mathbb{Q}$ such that for all $ x,y \in \mathbb{Z}\setminus\{0\}$:
\[ f \left( \frac{x+y}{3}\right) =\frac{f(x)+f(y)}{2}, \; \; x, y \in \mathbb{Z}\setminus\{0\}\]
We have $k$ switches arranged in a row, and each switch points up, down, left, or right. Whenever three successive switches all point in different directions, all three may be simultaneously turned so as to point in the fourth direction. Prove that this operation cannot be repeated infinitely many times.
Let ABC with orthocenter $H$ and circumcenter $O$ be an acute scalene triangle satisfying
$AB = AM$ where $M$ is the midpoint of $BC$. Suppose $Q$ and $K$ are points on $(ABC)$ distinct from
A satisfying $\angle AQH = 90$
and $\angle BAK = \angle CAM$. Let $N$ be the midpoint of $AH$.
• Let $I$ be the intersection of $B\text{-midline}$ and $A\text{-altitude}$ Prove that $IN = IO$.
• Prove that there is point $P$ on the symmedian lying on circle with center $B$ and radius $BM$
such that $(APN)$ is tangent to $AB$.
[i]Proposed by Krutarth Shah[/i]
Let $k$ be a circle centered at $M$ and let $t$ be a tangentline to $k$ through some point $T\in k$. Let $P$ be a point on $t$ and let $g\neq t$ be a line through $P$ intersecting $k$ at $U$ and $V$. Let $S$ be the point on $k$ bisecting the arc $UV$ not containing $T$ and let $Q$ be the the image of $P$ under a reflection over $ST$.
Prove that $Q$, $T$, $U$ and $V$ are vertices of a trapezoid.
Find the greatest positive integer $n$ such that there exist positive integers $a_1, a_2, ..., a_n$ for which the following holds $a_{k+2} = \dfrac{(a_{k+1}+a_k)(a_{k+1}+1)}{a_k}$ for all $1 \le k \le n-2$.
[i]Proposed by Mykhailo Shtandenko and Oleksii Masalitin[/i]
Let side $BC$ of $\bigtriangleup ABC$ be the diameter of a semicircle which cuts $AB$ and $AC$ at $D$ and $E$ respectively. $F$ and $G$ are the feet of the perpendiculars from $D$ and $E$ to $BC$ respectively. $DG$ and $EF$ intersect at $M$. Prove that $AM \perp BC$.
Prove that if the length and breadth of a rectangle are both odd integers, then there does not exist a point $P$ inside the rectangle such that each of the distances from $P$ to the 4 corners of the rectangle is an integer.
A sphere is touched by all the four sides of a (space) quadrilateral. Prove that all the four touching points are in the same plane.
Given $n \ge 2$ points on a circle, Alice and Bob play the following game. Initially, a tile is placed on one of the points and no segment is drawn.
The players alternate in turns, with Alice to start. In a turn, a player moves the tile from its current position $P$ to one of the $n-1$ other points $Q$ and draws the segment $PQ$. This move is not allowed if the segment $PQ$ is already drawn. If a player cannot make a move, the game is over and the opponent wins.
Determine, for each $n$, which of the two players has a winning strategy.
Given a triangle $ABC$ with the are $1$. Let $A',B'$ and $C' $ are the midpoints of the sides $[BC], [CA]$ and $[AB]$ respectively. What is the minimal possible area of the common part of two triangles $A'B'C'$ and $KLM$, if the points $K,L$ and $M$ are lying on the segments $[AB'], [CA']$ and $[BC']$ respectively?
Let $ABCDEF$ be a regular hexagon and $M\in (DE)$, $N\in(CD)$ such that $m (\widehat {AMN}) = 90^\circ$ and $AN = CM \sqrt {2}$. Find the value of $\frac{DM}{ME}$.
The Princeton University Band plays a setlist of 8 distinct songs, 3 of which are tiring to play. If the Band can't play any two tiring songs in a row, how many ways can the band play its 8 songs?
In an acute-angled triangle $ABC$, the altitudes intersect at point $H$, and point $K$ is the foot of the altitude drawn from the vertex $A$. Circle $c$ passing through points $A$ and $K$ intersects sides $AB$ and $AC$ at points $M$ and $N$, respectively. The line passing through point $A$ and parallel to line $BC$ intersects the circumcircles of triangles $AHM$ and $AHN$ for second time, respectively, at points $X$ and $Y$. Prove that $ | X Y | = | BC |$.