Consider a triangle $ABC$ and two congruent triangles $A_1B_1C_1$ and $A_2B_2C_2$ which are respectively similar to $ABC$ and inscribed in it: $A_i,B_i,C_i$ are located on the sides of $ABC$ in such a way that the points $A_i$ are on the side opposite to $A$, the points $B_i$ are on the side opposite to $B$, and the points $C_i$ are on the side opposite to $C$ (and the angle at A are equal to angles at $A_i$ etc.). The circumcircles of $A_1B_1C_1$ and $A_2B_2C_2$ intersect at points $P$ and $Q$. Prove that the line $PQ$ passes through the orthocenter of $ABC$.

Let $ a > b > 1$ be relatively prime positive integers. Define the weight of an integer $ c$, denoted by $ w(c)$ to be the minimal possible value of $ |x| \plus{} |y|$ taken over all pairs of integers $ x$ and $ y$ such that \[ax \plus{} by \equal{} c.\] An integer $ c$ is called a [i]local champion [/i]if $ w(c) \geq w(c \pm a)$ and $ w(c) \geq w(c \pm b)$. Find all local champions and determine their number. [i]Proposed by Zoran Sunic, USA[/i]

Let $p$ be a prime number greater than $2$ and let $m, n$ be integers such that: $$\frac{m}{n}=1+\frac{1}{2}+\frac{1}{3}+...+\frac{1}{p-1}.$$ Prove that $p$ divides $m$.

For a positive integer $n$, we dene $D_n$ as the largest integer that is a divisor of $a^n + (a + 1)^n + (a + 2)^n$ for all positive integers $a$. 1. Show that for all positive integers $n$, the number $D_n$ is of the form $3^k$ with $k \ge 0$ an integer. 2. Show that for all integers $k \ge 0$ there exists a positive integer n such that $D_n = 3^k$.

Let $A$ and $B$ be sets such that there are exactly $144$ sets which are subsets of either $A$ or $B$. Determine the number of elements $A \cup B$ has.

A regular heptagon $A_1A_2A_3A_4A_5A_6A_7$ is given. Straight $A_2A_3$ and $A_5A_6$ intersect at point $X$, and straight lines $A_3A_5$ and $A_1A_6$ intersect at point $Y$. Prove that lines $A_1A_2$ and $XY$ are parallel.

The sequence $a_n$ is defined for any $n\geq 10$ by the following inductive rule: [list] [*] $a_{10}=5778$ [*] If $a_n=0$ then $a_{n+1}=0$. [*] If $a_n\neq0$ then $a_{n+1}$ is the number whose base-$(n+1)$ representation equals the base $n$ representation of the number $a_n -1$. [/list] For example, $a_{11}=5\cdot11^3+7\cdot11^2+7\cdot11^1+7\cdot11^0=7586$ $a_{12}=5\cdot12^3+7\cdot12^2+7\cdot12^1+6\cdot12^0=9738$ [list=a] [*] Does there exist $n\geq10$ for which $a_n=0$? [*] Is $a_{1,000,000}=0$? [*] Is $a_{100^{100^{100}}}=0$? [/list]

[b]p1.[/b] A triangle $ABC$ is drawn in the plane. A point $D$ is chosen inside the triangle. Show that the sum of distances $AD+BD+CD$ is less than the perimeter of the triangle. [b]p2.[/b] In a triangle $ABC$ the bisector of the angle $C$ intersects the side $AB$ at $M$, and the bisector of the angle $A$ intersects $CM$ at the point $T$. Suppose that the segments $CM$ and $AT$ divided the triangle $ABC$ into three isosceles triangles. Find the angles of the triangle $ABC$. [b]p3.[/b] You are given $100$ weights of masses $1, 2, 3,..., 99, 100$. Can one distribute them into $10$ piles having the following property: the heavier the pile, the fewer weights it contains? [b]p4.[/b] Each cell of a $10\times 10$ table contains a number. In each line the greatest number (or one of the largest, if more than one) is underscored, and in each column the smallest (or one of the smallest) is also underscored. It turned out that all of the underscored numbers are underscored exactly twice. Prove that all numbers stored in the table are equal to each other. [b]p5.[/b] Two stores have warehouses in which wheat is stored. There are $16$ more tons of wheat in the first warehouse than in the second. Every night exactly at midnight the owner of each store steals from his rival, taking a quarter of the wheat in his rival's warehouse and dragging it to his own. After $10$ days, the thieves are caught. Which warehouse has more wheat at this point and by how much? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Alice and Bob play a game on a Cartesian Coordinate Plane. At the beginning, Alice chooses a lattice point $ \left(x_{0}, y_{0}\right) $ and places a pudding. Then they plays by turns (B goes first) according to the rules a. If $ A $ places a pudding on $ \left(x,y\right) $ in the last round, then $ B $ can only place a pudding on one of $ \left(x+2, y+1\right), \left(x+2, y-1\right), \left(x-2, y+1\right), \left(x-2, y-1\right) $ b. If $ B $ places a pudding on $ \left(x,y\right) $ in the last round, then $ A $ can only place a pudding on one of $ \left(x+1, y+2\right), \left(x+1, y-2\right), \left(x-1, y+2\right), \left(x-1, y-2\right) $ Furthermore, if there is already a pudding on $ \left(a,b\right) $, then no one can place a pudding on $ \left(c,d\right) $ where $ c \equiv a \pmod{n}, d \equiv b \pmod{n} $. 1. Who has a winning strategy when $ n = 2018 $ 1. Who has a winning strategy when $ n = 2019 $

A $8\times 8$ board is divided in dominoes (rectangles with dimensions $1 \times 2$ or $2 \times 1$). [list=a] [*] Prove that the total length of the border between horizontal and vertical dominoes is at most $52$. [*] Determine the maximum possible total length of the border between horizontal and vertical dominoes. [/list] [i]Proposed by B. Frenkin, A. Zaslavsky, E. Arzhantseva[/i]

Find the number of all 6-digits numbers having exactly three odd and three even digits.

Let $n\in\mathbb{N}^*$. Prove that \[ \lim_{x\to 0}\frac{ \displaystyle (1+x^2)^{n+1}-\prod_{k=1}^n\cos kx}{ \displaystyle x\sum_{k=1}^n\sin kx}=\frac{2n^2+n+12}{6n}. \]

Every point with integer coordinates in the plane is the center of a disk with radius $1/1000$. (1) Prove that there exists an equilateral triangle whose vertices lie in different discs. (2) Prove that every equilateral triangle with vertices in different discs has side-length greater than $96$. [i]Radu Gologan, Romania[/i] [hide="Remark"] The "> 96" in [b](b)[/b] can be strengthened to "> 124". By the way, part [b](a)[/b] of this problem is the place where I used [url=http://mathlinks.ro/viewtopic.php?t=5537]the well-known "Dedekind" theorem[/url]. [/hide]

Mable and Nora play a game according to the following steps in order: 1. Mable writes down any 2015 distinct prime numbers in ascending order in a row. The product of these primes is Marble's score. 2. Nora writes down a positive integer 3. Mable draws a vertical line between two adjacent primes she has written in step 1, and compute the product of the prime(s) on the left of the vertical line 4. Nora must add the product obtained by Marble in step 3 to the number she has written in step 2, and the sum becomes Nora's score. If Marble and Nora's scores have a common factor greater than 1, Marble wins, otherwise Nora wins. Who has a winning strategy?

Alex divides a disk into four quadrants with two perpendicular diameters intersecting at the center of the disk. He draws $25$ more lines segments through the disk, drawing each segment by selecting two points at random on the perimeter of the disk in different quadrants and connecting these two points. Find the expected number of regions into which these $27$ line segments divide the disk.

Find the number of integer solutions of $\left[\frac{x}{100} \left[\frac{x}{100}\right]\right]= 5$

In the triangle $ABC$, let $A'$ be the intersection of the perpendicular bisector of $AB$ and the angle bisector of $\angle BAC$ and define $B', C'$ analogously. Prove that a) The triangle $ABC$ is equilateral if and only if $A' =B'.$ b) If $A', B'$ and $C'$ are distinct, we have $\angle B' A' C' = 90^{\circ} - \frac{1}{2} \angle BAC.$

Solve the equation $3^x=2^xy+1$ in positive integers.

[b]p1.[/b] $17$ rooks are placed on an $8\times 8$ chess board. Prove that there must be at least one rook that is attacking at least $2$ other rooks. [b]p2.[/b] In New Scotland there are three kinds of coins: $1$ cent, $6$ cent, and $36$ cent coins. Josh has $99$ of the $36$-cent coins (and no other coins). He is allowed to exchange a $36$ cent coin for $6$ coins of $6$ cents, and to exchange a $6$ cent coin for $6$ coins of $1$ cent. Is it possible that after several exchanges Josh will have $500$ coins? [b]p3.[/b] Find all solutions $a, b, c, d, e, f, g, h, i$ if these letters represent distinct digits and the following multiplication is correct: $\begin{tabular}{ccccc} & & a & b & c \\ x & & & d & e \\ \hline & f & a & c & c \\ + & g & h & i & \\ \hline f & f & f & c & c \\ \end{tabular}$ [b]p4.[/b] Pinocchio rode a bicycle for $3.5$ hours. During every $1$-hour period he went exactly $5$ km. Is it true that his average speed for the trip was $5$ km/h? Explain your reasoning. [b]p5.[/b] Let $a, b, c$ be odd integers. Prove that the equation $ax^2 + bx + c = 0$ cannot have a rational solution. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $ABC$ be a triangle. The tangent in $A$ of the circumcircle of $ABC$ cuts the line $(BC)$ in $X$. Let $A'$ be the symetric of $A$ by $X$ and $C'$ the symetric of $C$ by the line $(AX)$ Prove that the points $A, C', A'$ and $B$ are concyclic.

Compute $$\int_{1/2}^{2} \frac{x^2 + 1}{x^2(x^{2015} + 1)} dx.$$

Henry the donkey has a very long piece of pasta. He takes a number of bites of pasta, each time eating $3$ inches of pasta from the middle of one piece. In the end, he has $10$ pieces of pasta whose total length is $17$ inches. How long, in inches, was the piece of pasta he started with? $\textbf{(A)} ~34\qquad\textbf{(B)} ~38\qquad\textbf{(C)} ~41\qquad\textbf{(D)} ~44\qquad\textbf{(E)} ~47\qquad$

Find all functions $f:\mathbb R_{\ge0}\times\mathbb R_{\ge0}\to\mathbb R_{\ge0}$ such that $1$. $f(x,0)=f(0,x)=x$ for all $x\in\mathbb R_{\ge0}$, $2$. $f(f(x,y),z)=f(x,f(y,z))$ for all $x,y,z\in\mathbb R_{\ge0}$ and $3$. there exists a real $k$ such that $f(x+y,x+z)=kx+f(y,z)$ for all $x,y,z\in\mathbb R_{\ge0}$.

A cunning dragon guards a princess. To overcome the dragon and to win the princess you must solve the following task: The dragon has in some of the fields $i$ the columned hall (see figure) with the numbers $1-8$. Even in the rest of the fields you can place numbers $9-36$. The numbers $1-36$ must be arranged so that any turn that starts with one enters from either the south or the west, and ends up going out towards either the north or east, goes through at least one number from the $5$ table. (On the figure are north, south, east and west indicated by N, S, E and W). Georg wants to win the princess. Is it possible to be done? [img]https://cdn.artofproblemsolving.com/attachments/0/7/2ad1b7f944847ee6d3c614ea6c2656865808e7.png[/img]

Steve plants ten trees every three minutes. If he continues planting at the same rate, how long will it take him to plant 2500 trees? $\textbf{(A)}\ 1~1/4 \qquad \textbf{(B)}\ 3 \qquad \textbf{(C)}\ 5 \qquad \textbf{(D)}\ 10 \qquad \textbf{(E)}\ 12~1/2$