Found problems: 85335
Let $\omega_1$ and $\omega_2$ be circles that intersect at points $A$ and $B$ and let $O_1$ and $O_2$ be their respective centers. We take $M$ in $\omega_1$ and $N$ in $\omega_2$ on the same side as $B$ with respect to segment $O_1O_2$, such that $MO_1\parallel BO_2$ and $BO_1 \parallel NO_2$. Draw the tangents to $\omega_1$ and $\omega_2$ through $M$ and $N$ respectively, which intersect at $K$. Show that $A$, $B$ and $K$ are collinear.
Theseus starts at the point $(0, 0)$ in the plane. If Theseus is standing at the point $(x, y)$ in the plane, he can step one unit to the north to point $(x, y+1)$, one unit to the west to point $(x-1, y)$, one unit to the south to point $(x, y-1)$, or one unit to the east to point $(x+1, y)$. After a sequence of more than two such moves, starting with a step one unit to the south (to point $(0, -1)$), Theseus finds himself back at the point $(0, 0)$. He never visited any point other than $(0, 0)$ more than once, and never visited the point $(0, 0)$ except at the start and end of this sequence of moves.
Let $X$ be the number of times that Theseus took a step one unit to the north, and then a step one unit to the west immediately afterward. Let $Y$ be the number of times that Theseus took a step one unit to the west, and then a step one unit to the north immediately afterward. Prove that $|X - Y| = 1$.
[i]Mitchell Lee[/i]
Every of $n$ guests invited to a dinner has got an invitation denoted by a number from $1$ to $n$. The guests will be sitting around a round table with $n$ seats. The waiter has decided to derve them according to the following rule. At first, he selects one guest and serves him/her at any place. Thereafter, he selects the guests one by one: having chosen a guest, he goes around the table for the number of seats equal to the preceeding guest's invitation number (starting from the seat of the preceeding guest), and serves the guest there.
Find all $n$ for which he can select the guests in such an order to serve all the guests.
Let $a{}$ and $b>1$ be natural numbers. Prove that there exists a natural number $n < b^2$ such that the number $a^n + n$ is divisible by $b{}$.
In acute scalene triangle $ABC$ the external angle bisector of $\angle BAC$ meet $BC$ at point $X$.Lines $l_b$ and $l_c$ which tangents of $B$ and $C$ with respect to $(ABC)$.The line pass through $X$ intersects $l_b$ and $l_c$ at points $Y$ and $Z$ respectively. Suppose $(AYB)\cap(AZC)=N$ and $l_b\cap l_c=D$. Show that $ND$ is angle bisector of $\angle YNZ$.
Proposed by [i]Alireza Haghi[/i]
A point $K$ is chosen on the side $CD$ of a rectangle $ABCD$. From the vertex $B$, the perpendicular $BH$ is dropped to the segment $AK$. The segments $AK$ and $BH$ divide the rectangle into three parts such that each of them has the inscribed circle (see figure). Prove that if the circles tangent to $CD$ are equal then the third circle is also equal to them.
Find all positive integers $m$ for which there exist three positive integers $a,b,c$ such that $abcm=1+a^2+b^2+c^2$.
Let $n \geq 2$ be a positive integer. Consider the following equation: \[ \{x\}+\{2x\}+ \dots + \{nx\} = \lfloor x \rfloor + \lfloor 2x \rfloor + \dots + \lfloor 2nx \rfloor\]
a) For $n=2$, solve the given equation in $\mathbb{R}$.
b) Prove that, for any $n \geq 2$, the equation has at most $2$ real solutions.
A nickel is placed on a table. The number of nickels which can be placed around it, each tangent to it and to two others is:
$ \textbf{(A)}\ 4 \qquad\textbf{(B)}\ 5 \qquad\textbf{(C)}\ 6 \qquad\textbf{(D)}\ 8 \qquad\textbf{(E)}\ 12$
On sides $AB, BC$ and $CA$ of triangle $ABC$ are located points $P, M$ and $K$, respectively, so that $AM, BK$ and $CP$ intersect in one point and the sum of the vectors $\overrightarrow{AM}, \overrightarrow{BK}$ and $\overrightarrow{CP}$ equals $ \overrightarrow{0}$. Prove that $K, M$ and $P$ are midpoints of the sides of triangle $ABC$ on which they are located.
Let $\,S\,$ be a finite set of points in three-dimensional space. Let $\,S_{x},\,S_{y},\,S_{z}\,$ be the sets consisting of the orthogonal projections of the points of $\,S\,$ onto the $yz$-plane, $zx$-plane, $xy$-plane, respectively. Prove that \[ \vert S\vert^{2}\leq \vert S_{x} \vert \cdot \vert S_{y} \vert \cdot \vert S_{z} \vert, \] where $\vert A \vert$ denotes the number of elements in the finite set $A$.
[hide="Note"] Note: The orthogonal projection of a point onto a plane is the foot of the perpendicular from that point to the plane. [/hide]
A positive integer $n$ is [i]brgorable[/i] if it is possible to arrange the numbers $1, 1, 2, 2, ..., n, n$ such that between any two $k$'s there are exactly $k$ numbers (for example, $n=2$ is not brgorable, but $n = 3$ is as demonstrated by $3, 1, 2, 1, 3, 2$). How many brgorable numbers are less than 2019?
A social network has $2019$ users, some pairs of whom are friends. Whenever user $A$ is friends with user $B$, user $B$ is also friends with user $A$. Events of the following kind may happen repeatedly, one at a time:
[list]
[*] Three users $A$, $B$, and $C$ such that $A$ is friends with both $B$ and $C$, but $B$ and $C$ are not friends, change their friendship statuses such that $B$ and $C$ are now friends, but $A$ is no longer friends with $B$, and no longer friends with $C$. All other friendship statuses are unchanged.
[/list]
Initially, $1010$ users have $1009$ friends each, and $1009$ users have $1010$ friends each. Prove that there exists a sequence of such events after which each user is friends with at most one other user.
[i]Proposed by Adrian Beker, Croatia[/i]
Antonio plays a game where he continually flips a fair coin to see the sequence of heads ($H$) and tails ($T$) that he flips. Antonio wins the game if he sees on four consecutive flips the sequence $TTHT$ before he sees the sequence $HTTH$. The probability that Antonio wins the game is $\frac{m}{n}$ , where $m$ and $n$ are relatively prime positive integers. Find $m + n$.
Two circles $C_{1}$ and $C_{2}$ are (externally or internally) tangent at a point $P$. The straight line $D$ is tangent at $A$ to one of the circles and cuts the other circle at the points $B$ and $C$. Prove that the straight line $PA$ is an interior or exterior bisector of the angle $\angle BPC$.
Show that infinitely many positive integers cannot be written as a sum of three fourth powers of integers.
A rectangle has been divided into 8 smaller rectangles as shown below. Given the area of seven of these rectangles, find the area of the shaded rectangle.
[i]Lightning 2.1[/i]
Let $N$ be the number of ways of choosing a subset of $5$ distinct numbers from the set
$${10a+b:1\leq a\leq 5, 1\leq b\leq 5}$$
where $a,b$ are integers, such that no two of the selected numbers have the same units digits and no two have the same tens digit. What is the remainder when $N$ is divided by $73$?
Let $ a_1$, $ a_2$, $ \ldots$, $ a_n$ be distinct positive integers, $ n\ge 3$. Prove that there exist distinct indices $ i$ and $ j$ such that $ a_i \plus{} a_j$ does not divide any of the numbers $ 3a_1$, $ 3a_2$, $ \ldots$, $ 3a_n$.
[i]Proposed by Mohsen Jamaali, Iran[/i]
For a function $f(x)=\ln (1+\sqrt{1-x^2})-\sqrt{1-x^2}-\ln x\ (0<x<1)$, answer the following questions:
(1) Find $f'(x)$.
(2) Sketch the graph of $y=f(x)$.
(3) Let $P$ be a mobile point on the curve $y=f(x)$ and $Q$ be a point which is on the tangent at $P$ on the curve $y=f(x)$ and such that $PQ=1$. Note that the $x$-coordinate of $Q$ is les than that of $P$. Find the locus of $Q$.
Does there exist a function $f: \mathbb{R}\rightarrow \mathbb{R}$ such that:
$f(f(x))=-x$, for all $x\in \mathbb{R}$?
Find the locus of the foot of the perpendicular from the center of a rectangular hyperbola to a tangent. Obtain its equation in polar coordinates and sketch it.
Alex starts with a rooted tree with one vertex (the root). For a vertex $v$, let the size of the subtree of $v$ be $S(v)$. Alex plays a game that lasts nine turns. At each turn, he randomly selects a vertex in the tree, and adds a child vertex to that vertex. After nine turns, he has ten total vertices. Alex selects one of these vertices at random (call the vertex $v_1$). The expected value of $S(v_1)$ is of the form $\tfrac{m}{n}$ for relatively prime positive integers $m, n$. Find $m+n$.
[b]Note:[/b] In a rooted tree, the subtree of $v$ consists of its indirect or direct descendants (including $v$ itself).
[i]Proposed by Yang Liu[/i]
Lucy starts by writing $s$ integer-valued $2022$-tuples on a blackboard. After doing that, she can take any two (not necessarily distinct) tuples $\mathbf{v}=(v_1,\ldots,v_{2022})$ and $\mathbf{w}=(w_1,\ldots,w_{2022})$ that she has already written, and apply one of the following operations to obtain a new tuple:
\begin{align*}
\mathbf{v}+\mathbf{w}&=(v_1+w_1,\ldots,v_{2022}+w_{2022}) \\
\mathbf{v} \lor \mathbf{w}&=(\max(v_1,w_1),\ldots,\max(v_{2022},w_{2022}))
\end{align*}
and then write this tuple on the blackboard.
It turns out that, in this way, Lucy can write any integer-valued $2022$-tuple on the blackboard after finitely many steps. What is the smallest possible number $s$ of tuples that she initially wrote?
Determine all positive integer $a$ such that the equation $2x^2 - 30x + a = 0$ has two prime roots, i.e. both roots are prime numbers.