Found problems: 85335
Let numbers $1,2,3,...,2010$ stand in a row at random. Consider row, obtain by next rule:
For any number we sum it and it's number in a row (For example for row $( 2,7,4)$ we consider a row $(2+1;7+2;4+3)=(3;9;7)$ );
Proved, that in resulting row we can found two equals numbers, or two numbers, which is differ by $2010$
Let $A_1$ and $B_1$ be internal points lying on the sides $BC$ and $AC$ of the triangle $ABC$ respectively and segments $AA_1$ and $BB_1$ meet at $O$. The areas of the triangles $AOB_1,AOB$ and $BOA_1$ are distinct prime numbers and the area of the quadrilateral $A_1OB_1C$ is an integer. Find the least possible value of the area of the triangle $ABC$, and argue the existence of such a triangle.
Let $\alpha_1,\alpha_2,\dots,\alpha_6$ be a fixed labeling of the complex roots of $x^6-1$. Find the number of permutations $\{\alpha_{i_1},\alpha_{i_2},\dots,\alpha_{i_6}\}$ of these roots such that if $P(\alpha_1, \dots, \alpha_6) = 0$, then $P(\alpha_{i_1},\dots,\alpha_{i_6}) = 0$, where $P$ is any polynomial with rational coefficients.
Point ${D}$ lies on the side ${BC}$ of $\vartriangle ABC$. The circumcenters of $\vartriangle ADC$ and $\vartriangle BAD$ are ${O_1}$ and ${O_2}$, respectively and ${O_1O_2\parallel AB}$. The orthocenter of $\vartriangle ADC$is ${H}$ and ${AH=O_1O_2}.$ Find the angles of $\vartriangle ABC$ if $2m\left( \angle C \right)=3m\left( \angle B \right).$
Let $I$ be the incenter of a non-isosceles triangle $ABC$. The line $AI$ intersects the circumcircle of the triangle $ABC$ at $A$ and $D$. Let $M$ be the middle point of the arc $BAC$. The line through the point $I$ perpendicular to $AD$ intersects $BC$ at $F$. The line $MI$ intersects the circle $BIC$ at $N$.
Prove that the line $FN$ is tangent to the circle $BIC$.
In the plane are given $2000$ congruent triangles of area $1$, which are all images of one triangle under translations. Each of these triangles contains the centroid of every other triangle. Prove that the union of these triangles has area less than $22/9$.
Let $S$ be the set of words made from the letters $a,b$ and $c$. The equivalence relation $\sim$ on $S$ satisfies
\[uu \sim u \]
\[u \sim v \Rightarrow uw \sim vw \; \text{and} \; wu \sim wv\]
for all words $u, v$ and $w$. Prove that every word in $S$ is equivalent to a word of length $\leq 8$.
Let $ a,b,c>0$ prove that:\[
\frac{a^{3}}{(a+b)^{3}}+\frac{b^{3}}{(b+c)^{3}}+\frac{c^{3}}{(c+a)^{3}}\geq
\frac{3}{8} \]
Good luck! :D
Theo Travel, who has $5$ children, has already visited $8$ countries of the eurozone. From every country, he brought $5$ not necessarily distinct coins home. Moreover, among these $40$ coins there are exactly $5$ of every value ($1,2,5,10,20,$ and $50$ ct, $1$ and $2$ euro). He wants to give each child $8$ coins such that they are from different countries and that each child gets the same amount of money. Is this always possible?
Let $\lambda$ be a real number. Suppose that if \(ABCD\) is any convex cyclic quadrilateral such that \(AC=4\), \(BD=5\), and \(\overline{AB}\perp\overline{CD}\), then the area of $ABCD$ is at least $\lambda$. Then the greatest possible value of $\lambda$ is $\frac{m}{n}$, where $m$ and $n$ are positive integers with $\gcd(m,n)=1$. Compute $100m+n$.
[i]Proposed by Eric Shen[/i]
In an acute-angled triangle $ABC, E$ and $F$ are the feet of the altitudes from $B$ and $C$, and $G$ and $H$ are the projections of $B$ and $C$ on $EF$, respectively. Prove that $HE = FG$.
Suppose that $x$, $y$, and $z$ are complex numbers of equal magnitude that satisfy
\[x+y+z = -\frac{\sqrt{3}}{2}-i\sqrt{5}\]
and
\[xyz=\sqrt{3} + i\sqrt{5}.\]
If $x=x_1+ix_2, y=y_1+iy_2,$ and $z=z_1+iz_2$ for real $x_1,x_2,y_1,y_2,z_1$ and $z_2$ then
\[(x_1x_2+y_1y_2+z_1z_2)^2\]
can be written as $\tfrac{a}{b}$ for relatively prime positive integers $a$ and $b$. Compute $100a+b.$
Show that the equation $a^{2}b^{2}+b^{2}c^{2}+3b^{2}-c^{2}-a^{2}=2005$ has no integer solutions.
[i]Arnoldo Aguilar, El Salvador[/i]
For a positive integer $n$, we consider an $n \times n$ board and tiles with dimensions $1 \times 1, 1 \times 2, ..., 1 \times n$. In how many ways exactly can $\frac12 n (n + 1)$ cells of the board are colored red, so that the red squares can all be covered by placing the $n$ tiles all horizontally, but also by placing all $n$ tiles vertically?
Two colorings that are not identical, but by rotation or reflection from the board into each other count as different.
A set of points is marked on the plane, with the property that any three marked points can be covered with a disk of radius $1$. Prove that the set of all marked points can be covered with a disk of radius $1$.
Let $P(x), Q(x)$ be distinct polynomials of degree $2020$ with non-zero coefficients. Suppose that they have $r$ common real roots counting multiplicity and $s$ common coefficients. Determine the maximum possible value of $r + s$.
[i]Demetres Christofides, Cyprus[/i]
The vertices of $\triangle ABC$ are labeled in counter-clockwise order, and its sides have lengths $CA = 2022$, $AB = 2023$, and $BC = 2024$. Rotate $B$ $90^\circ$ counter-clockwise about $A$ to get a point $B'$. Let $D$ be the orthogonal projection of $B'$ unto line $AC$, and let $M$ be the midpoint of line segment $BB'$. Then ray $BM$ intersects the circumcircle of $\triangle CDM$ at a point $N \neq M$. Compute $MN$.
[i]Proposed by Thomas Lam[/i]
[u]Round 1[/u]
[b]p1.[/b] Five children, Aisha, Baesha, Cosha, Dasha, and Erisha, competed in running, jumping, and throwing. In each event, first place was won by someone from Renton, second place by someone from Seattle, and third place by someone from Tacoma. Aisha was last in running, Cosha was last in jumping, and Erisha was last in throwing. Could Baesha and Dasha be from the same city?
[b]p2.[/b] Fifty-five Brits and Italians met in a coffee shop, and each of them ordered either coffee or tea. Brits tell the truth when they drink tea and lie when they drink coffee; Italians do it the other way around. A reporter ran a quick survey:
Forty-four people answered “yes” to the question, “Are you drinking coffee?”
Thirty-three people answered “yes” to the question, “Are you Italian?”
Twenty-two people agreed with the statement, “It is raining outside.”
How many Brits in the coffee shop are drinking tea?
[b]p3.[/b] Doctor Strange is lost in a strange house with a large number of identical rooms, connected to each other in a loop. Each room has a light and a switch that could be turned on and off. The lights might initially be on in some rooms and off in others. How can Dr. Strange determine the number of rooms in the house if he is only allowed to switch lights on and off?
[b]p4.[/b] Fifty street artists are scheduled to give solo shows with three consecutive acts: juggling, drumming, and gymnastics, in that order. Each artist will spend equal time on each of the three activities, but the lengths may be different for different artists. At least one artist will be drumming at every moment from dawn to dusk. A new law was just passed that says two artists may not drum at the same time. Show that it is possible to cancel some of the artists' complete shows, without rescheduling the rest, so that at least one show is going on at every moment from dawn to dusk, and the schedule complies with the new law.
[b]p5.[/b] Alice and Bob split the numbers from $1$ to $12$ into two piles with six numbers in each pile. Alice lists the numbers in the first pile in increasing order as $a_1 < a_2 < a_3 < a_4 < a_5 < a_6$ and Bob lists the numbers in the second pile in decreasing order $b_1 > b_1 > b_3 > b_4 > b_5 > b_6$. Show that no matter how they split the numbers, $$|a_1 -b_1| + |a_2 -b_2| + |a_3 -b_3| + |a_4 -b_4| + |a_5 -b_5| + |a_6 -b_6| = 36.$$
[u]Round 2[/u]
[b]p6.[/b] The Martian alphabet has ? letters. Marvin writes down a word and notices that within every sub-word (a contiguous stretch of letters) at least one letter occurs an odd number of times. What is the length of the longest possible word he could have written?
[b]p7.[/b] For a long space journey, two astronauts with compatible personalities are to be selected from $24$ candidates. To find a good fit, each candidate was asked $24$ questions that required a simple yes or no answer. Two astronauts are compatible if exactly $12$ of their answers matched (that is, both answered yes or both answered no). Miraculously, every pair of these $24$ astronauts was compatible! Show that there were exactly $12$ astronauts whose answer to the question “Can you repair a flux capacitor?” was exactly the same as their answer to the question “Are you afraid of heights?” (that is, yes to both or no to both).
PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].
A function $f:\mathbb{N} \to \mathbb{N}$ is given. If $a,b$ are coprime, then $f(ab)=f(a)f(b)$. Also, if $m,k$ are primes (not necessarily different), then $$f(m+k-3)=f(m)+f(k)-f(3).$$ Find all possible values of $f(11)$.
A quadrilateral that has consecutive sides of lengths $70, 90, 130$ and $110$ is inscribed in a circle and also has a circle inscribed in it. The point of tangency of the inscribed circle to the side of length $130$ divides that side into segments of lengths $x$ and $y$. Find $|x-y|$.
$ \textbf{(A)}\ 12 \qquad\textbf{(B)}\ 13 \qquad\textbf{(C)}\ 14 \qquad\textbf{(D)}\ 15 \qquad\textbf{(E)}\ 16 $
Let $p$ be a prime satisfying $p^2\mid 2^{p-1}-1$, and let $n$ be a positive integer. Define
\[ f(x) = \frac{(x-1)^{p^n}-(x^{p^n}-1)}{p(x-1)}. \]
Find the largest positive integer $N$ such that there exist polynomials $g(x)$, $h(x)$ with integer coefficients and an integer $r$ satisfying $f(x) = (x-r)^N g(x) + p \cdot h(x)$.
[i]Proposed by Victor Wang[/i]
Let $P$ be a convex planar polygon with equal angles. Let $l_1,\cdots, l_n$ be its sides. Show that a necessary and sufficient condition for $P$ to be regular is that the sum of the ratios $\frac{l_i}{l_{i+1}} (i = 1,\cdots, n; l_{n+1}= l_1)$ equals the number of sides.
Let $p(n) = n^4-6n^2-160$. If $a_n$ is the least odd prime dividing $q(n) = |p(n-30) \cdot p(n+30)|$, find $\sum_{n=1}^{2017} a_n$. ($a_n = 3$ if $q(n) = 0$.)
Let $k$, $m$ and $n$ be integers such that $1<n \leq m-1 \leq k$. Find maximum size of subset $S$ of set $\{1,2,...,k\}$ such that sum of any $n$ different elements from $S$ is not:
$a)$ equal to $m$,
$b)$ exceeding $m$
Druv has a $33 \times 33$ grid of unit squares, and he wants to color each unit square with exactly one of three distinct colors such that he uses all three colors and the number of unit squares with each color is the same. However, he realizes that there are internal sides, or unit line segments that have exactly one unit square on each side, with these two unit squares having different colors. What is the minimum possible number of such internal sides?