From an equilateral triangle with side 2014 we cut off another equilateral triangle with side 214, such that both triangles have one common vertex and two of the side of the smaller triangles lie on two of the side of the bigger triangle. Is it possible to cover this figure with figures in the picture without overlapping (rotation is allowed) if all figures are made of equilateral triangles with side 1? Explain the answer! [asy] import olympiad; unitsize(20); pair A,B,C,D,E,F,G,H; A=(0,0); B=(1,0); C=rotate(60)*B; D=rotate(60)*C; E=rotate(60)*D; F=rotate(60)*E; G=rotate(60)*F; draw(A--B); draw(A--C); draw(A--D); draw(A--E); draw(A--F); draw(A--G); draw(B--C--D--E--F--G--B); A=(2,0); B=A+(1,0); C=A+rotate(60)*(B-A); D=A+rotate(60)*(C-A); E=A+rotate(120)*(D-A); F=A+rotate(60)*(E-A); G=2*F-E; H=2*C-D; draw(A--D--C--A--B--C--H--B--G--F--E--A--F--B); A=(4,0); B=A+(1,0); C=A+rotate(-60)*(B-A); D=B+rotate(60)*(C-B); E=B+rotate(60)*(D-B); F=B+rotate(60)*(E-B); G=E+rotate(60)*(D-E); H=E+rotate(60)*(G-E); draw(A--B--C--A); draw(C--D--B); draw(D--E--B); draw(B--F--E); draw(E--G--D); draw(E--H--G); A=(8.5,0.5); B=A+(1,0); C=A+rotate(60)*(B-A); D=A+rotate(60)*(C-A); E=A+rotate(60)*(D-A); F=A+rotate(60)*(E-A); G=A+rotate(60)*(F-A); H=G+rotate(60)*(F-G); draw(A--B); draw(A--C); draw(A--D); draw(A--E); draw(A--F); draw(A--G); draw(B--C); draw(D--E--F--G--B); draw(G--H--F);[/asy]

Inscribed hexagon $AB_1CA_1BC_1$ is given. Circle $\omega$ is inscribed in both triangles $ABC$ and $A_1B_1C_1$ and touches segments $AB$ and $A_1B_1$ at points $D$ and $D_1$ respectively. Prove that if $\angle ACD = \angle BCD_1$, then $\angle A_1C_1D_1 = \angle B_1C_1D$.

Suppose $a$ is a real number such that $\sin(\pi \cdot \cos a) = \cos(\pi \cdot \sin a)$. Evaluate $35 \sin^2(2a) + 84 \cos^2(4a)$.

Find all functions $f : (0, +\infty) \to \mathbb{R}$ satisfying the following conditions: $(i)$ $f(x) + f(\frac{1}{x}) = 1$ for all $x> 0$; $(ii)$ $f(xy + x + y) = f(x)f(y)$ for all $x, y> 0$.

In the Martian language every finite sequence of letters of the Latin alphabet letters is a word. The publisher “Martian Words” makes a collection of all words in many volumes. In the first volume there are only one-letter words, in the second, two-letter words, etc., and the numeration of the words in each of the volumes continues the numeration of the previous volume. Find the word whose numeration is equal to the sum of numerations of the words Prague, Olympiad, Mathematics.

Does there exist a function $f:\mathbb{Z}\to\mathbb{Z}$ such that $f(x+f(y))=f(x)-y$ for all integers $x$ and $y$?

Triangles $ABC$ and $DEF$ have pairwise parallel sides: $EF \| BC, FD \| CA$, and $DE \| AB$. The line $m_A$ is the reflection of $EF$ through $BC$, similarly $m_B$ is the reflection of $FD$ through $CA$, and $m_C$ the reflection of $DE$ through $AB$. Assume that the lines $m_A, m_B$, and $m_C$ meet in a common point. What is the ratio between the areas of triangles $ABC$ and $DEF$?

Find all polynomials $f(x)$ with integer coefficients such that $f(n)$ and $f(2^{n})$ are co-prime for all natural numbers $n$.

In triangle $ABC$, $I$ is the incenter. We have chosen points $P,Q,R$ on segments $IA,IB,IC$ respectively such that $IP\cdot IA=IQ \cdot IB=IR\cdot IC$. Prove that the points $I$ and $O$ belong to Euler line of triangle $PQR$ where $O$ is circumcenter of $ABC$.

A positive number $\dfrac{m}{n}$ has the property that it is equal to the ratio of $7$ plus the number’s reciprocal and $65$ minus the number’s reciprocal. Given that $m$ and $n$ are relatively prime positive integers, find $2m + n$.

Find all continuous functions $f\colon [0;1] \to R$ such that \[\int_{0}^{1}f(x)dx = 2\int_{0}^{1}(f(x^{4}))^{2}dx+\frac{2}{7}\]

Let $0<x_1<1$ and $x_{n+1}=x_n(1-x_n), n=1,2,3, \dots$. Show that $$\lim_{n \to \infty} nx_n=1.$$

Let $ABC$ be an acute triangle. Let $\omega$ be a circle whose centre $L$ lies on the side $BC$. Suppose that $\omega$ is tangent to $AB$ at $B'$ and $AC$ at $C'$. Suppose also that the circumcentre $O$ of triangle $ABC$ lies on the shorter arc $B'C'$ of $\omega$. Prove that the circumcircle of $ABC$ and $\omega$ meet at two points. [i]Proposed by Härmel Nestra, Estonia[/i]

Find the number of pairs of real numbers $(x,y)$ such that $x^4+y^4=4xy-2$.

Compute $$\int_0^13x^2dx.$$

Find the number of $16$-tuples $(x_1, x_2,..., x_{16})$ such that (i) $x_i = \pm 1$ for $i = 1,..., 16$, (ii) $0 \le x_1 + x_2 +... + x_r < 4$, for $r = 1, 2,... , 15$, (iii) $x_1 + x_2 +...+ x_{10} = 4$

Prove that between every $27$ different positive integers , less than $100$, there exist some two which are[color=red] NOT [/color]relative prime. [u]babis[/u]

How many integers less than $400$ have exactly $3$ factors that are perfect squares?

Find the number of positive integers $n \le 600$ whose value can be uniquely determined when the values of $\left\lfloor \frac n4\right\rfloor$, $\left\lfloor\frac n5\right\rfloor$, and $\left\lfloor\frac n6\right\rfloor$ are given, where $\lfloor x \rfloor$ denotes the greatest integer less than or equal to the real number $x$.

A quadrilateral $ABCD$ is inscribed in a circle and its two diagonals $AC,BD$ meet at $G$. Let $M$ be the center of $CD, E,F$ be the points on $BC, AD$ respectively such that $ME \parallel AC$ and $MF \parallel BD$. Point $H$ is the projection of $G$ onto $CD$. The circumcircle of $MEF$ meets $CD$ at $N$ distinct from $M$. Prove that $MN = MH$ Tran Quang Hung, Nguyen Le Phuoc, Thanh Xuan, Hanoi

[u]Round 1[/u] [b]p1.[/b] Alex is on a week-long mining quest. Each morning, she mines at least $1$ and at most $10$ diamonds and adds them to her treasure chest (which already contains some diamonds). Every night she counts the total number of diamonds in her collection and finds that it is divisible by either $22$ or $25$. Show that she miscounted. [b]p2.[/b] Hermione set out a row of $11$ Bertie Bott’s Every Flavor Beans for Ron to try. There are $5$ chocolateflavored beans that Ron likes and $6$ beans flavored like earwax, which he finds disgusting. All beans look the same, and Hermione tells Ron that a chocolate bean always has another chocolate bean next to it. What is the smallest number of beans that Ron must taste to guarantee he finds a chocolate one? [b]p3.[/b] There are $101$ pirates on a pirate ship: the captain and $100$ crew. Each pirate, including the captain, starts with $1$ gold coin. The captain makes proposals for redistributing the coins, and the crew vote on these proposals. The captain does not vote. For every proposal, each crew member greedily votes “yes” if he gains coins as a result of the proposal, “no” if he loses coins, and passes otherwise. If strictly more crew members vote “yes” than “no,” the proposal takes effect. The captain can make any number of proposals, one after the other. What is the largest number of coins the captain can accumulate? [b]p4.[/b] There are $100$ food trucks in a circle and $10$ gnomes who sample their menus. For the first course, all the gnomes eat at different trucks. For each course after the first, gnome #$1$ moves $1$ truck left or right and eats there; gnome #$2$ moves $2$ trucks left or right and eats there; ... gnome #$10$ moves $10$ trucks left or right and eats there. All gnomes move at the same time. After some number of courses, each food truck had served at least one gnome. Show that at least one gnome ate at some food truck twice. [b]p5.[/b] The town of Lumenville has $100$ houses and is preparing for the math festival. The Tesla wiring company lays lengths of power wire in straight lines between the houses so that power flows between any two houses, possibly by passing through other houses.The Edison lighting company hangs strings of lights in straight lines between pairs of houses so that each house is connected by a string to exactly one other. Show that however the houses are arranged, the Edison company can always hang their strings of lights so that the total length of the strings is no more than the total length of the power wires the Tesla company used. [img]https://cdn.artofproblemsolving.com/attachments/9/2/763de9f4138b4dc552247e9316175036c649b6.png[/img] [u]Round 2[/u] [b]p6.[/b] What is the largest number of zeros that could appear at the end of $1^n + 2^n + 3^n + 4^n$, where n can be any positive integer? [b]p7.[/b] A tennis academy has $2023$ members. For every group of 1011 people, there is a person outside of the group who played a match against everyone in it. Show there is someone who has played against all $2022$ other members. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

If $x$ is a real number such that $x^2 -x$ is an integer, and for some $n \ge 3$, $x^n -x$ is also an integer, prove that $x$ is an integer.

Let $ABCD$ be a parallelogram. A variable line $g$ through the vertex $A$ intersects the rays $BC$ and $DC$ at the points $X$ and $Y$, respectively. Let $K$ and $L$ be the $A$-excenters of the triangles $ABX$ and $ADY$. Show that the angle $\measuredangle KCL$ is independent of the line $g$. [i]Proposed by Vyacheslev Yasinskiy, Ukraine[/i]

Suppose that the positive integers $ a$ and $ b$ satisfy the equation $ a^b\minus{}b^a\equal{}1008$ Prove that $ a$ and $ b$ are congruent modulo 1008.

Maureen is keeping track of the mean of her quiz scores this semester. If Maureen scores an $11$ on the next quiz, her mean will increase by $1$. If she scores an $11$ on each of the next three quizzes, her mean will increase by $2$. What is the mean of her quiz scores currently? $\textbf{(A) }4\qquad\textbf{(B) }5\qquad\textbf{(C) }6\qquad\textbf{(D) }7\qquad\textbf{(E) }8$