Let $P$ be the set of points in the Euclidean plane, and let $L$ be the set of lines in the same plane. Does there exist an one-to-one mapping (injective function) $f : L \to P$ such that for each $\ell \in L$ we have $f(\ell) \in \ell$?

Let $O$ be the circumcenter and $H$ the orthocenter of an acute triangle $ABC$. Show that there exist points $D$, $E$, and $F$ on sides $BC$, $CA$, and $AB$ respectively such that \[ OD + DH = OE + EH = OF + FH\] and the lines $AD$, $BE$, and $CF$ are concurrent.

Is it possible to place the numbers $0,1,2,\dots,9$ on a circle so that the sum of any three consecutive numbers is a) 13, b) 14, c) 15?

Point $P$ lies outside a circle, and two rays are drawn from $P$ that intersect the circle as shown. One ray intersects the circle at points $A$ and $B$ while the other ray intersects the circle at $M$ and $N$. $AN$ and $MB$ intersect at $X$. Given that $\angle AXB$ measures $127^{\circ}$ and the minor arc $AM$ measures $14^{\circ}$, compute the measure of the angle at $P$. [asy] size(200); defaultpen(fontsize(10pt)); pair P=(40,10),C=(-20,10),K=(-20,-10); path CC=circle((0,0),20), PC=P--C, PK=P--K; pair A=intersectionpoints(CC,PC)[0], B=intersectionpoints(CC,PC)[1], M=intersectionpoints(CC,PK)[0], N=intersectionpoints(CC,PK)[1], X=intersectionpoint(A--N,B--M); draw(CC);draw(PC);draw(PK);draw(A--N);draw(B--M); label("$A$",A,plain.NE);label("$B$",B,plain.NW);label("$M$",M,SE); label("$P$",P,E);label("$N$",N,dir(250));label("$X$",X,plain.N);[/asy]

For a given positive integer $n >2$, let $C_{1},C_{2},C_{3}$ be the boundaries of three convex $n-$ gons in the plane , such that $C_{1}\cap C_{2}, C_{2}\cap C_{3},C_{1}\cap C_{3}$ are finite. Find the maximum number of points of the sets $C_{1}\cap C_{2}\cap C_{3}$.

In the acute triangle $ABC$ the orthocenter $H$ and the center of the circumscribed circle $O$ were noted. The line $AO$ intersects the side $BC$ at the point $D$. A perpendicular drawn to the side $BC$ at the point $D$ intersects the heights from the vertices $B$ and $C$ of the triangle $ABC$ at the points $X$ and $Y$ respectively. Prove that the center of the circumscribed circle $\Delta HXY$ is equidistant from the points $B$ and $C$. (Danilo Hilko)

If $0<a\leq c\leq b$ then $$\frac{(b^{30}-a^{30})(b^{30}-c^{30})}{36b^{10}}\leq \frac{(b^{25}-a^{25})(b^{25}-c^{25})}{25}\leq \frac{(b^{30}-a^{30})(b^{30}-c^{30})}{36(ac)^{10}}$$

Prove that $\frac{5^{125}-1}{5^{25}-1}$ is a composite number.

From among $2^{1/2},$ $3^{1/3},$ $8^{1/8},$ $9^{1/9}$ those which have the greatest and the next to the greatest values, in that order, are \[ \begin{array}{rlrlrlrl} \hbox {(A)}& 3^{1/3},\ 2^{1/2} \quad & \hbox {(B)}& 3^{1/3},\ 8^{1/8} \quad & \hbox {(C)}& 3^{1/3},\ 9^{1/9} \quad & \hbox {(D)}& 8^{1/8},\ 9^{1/9} \\ \hbox {(E)}& \multicolumn{3}{l}{\hbox{None of these}} \end{array} \]

Tom's age is $ T$ years, which is also the sum of the ages of his three children. His age $ N$ years ago was twice the sum of their ages then. What is $ \frac {T}{N}$? $ \textbf{(A)}\ 2 \qquad \textbf{(B)}\ 3 \qquad \textbf{(C)}\ 4 \qquad \textbf{(D)}\ 5 \qquad \textbf{(E)}\ 6$

[b]p1.[/b] Let $a$ be an integer. How many fractions $\frac{a}{100}$ are greater than $\frac17$ and less than $\frac13$ ?. [b]p2.[/b] Justin Bieber invited Justin Timberlake and Justin Shan to eat sushi. There were $5$ different kinds of fish, $3$ different rice colors, and $11$ different sauces. Justin Shan insisted on a spicy sauce. If the probability of a sushi combination that pleased Justin Shan is $6/11$, then how many non-spicy sauces were there? [b]p3.[/b] A palindrome is any number that reads the same forward and backward (for example, $99$ and $50505$ are palindromes but $2020$ is not). Find the sum of all three-digit palindromes whose tens digit is $5$. [b]p4.[/b] Isaac is given an online quiz for his chemistry class in which he gets multiple tries. The quiz has $64$ multiple choice questions with $4$ choices each. For each of his previous attempts, the computer displays Isaac's answer to that question and whether it was correct or not. Given that Isaac is too lazy to actually read the questions, the maximum number of times he needs to attempt the quiz to guarantee a $100\%$ can be expressed as $2^{2^k}$. Find $k$. [b]p5.[/b] Consider a three-way Venn Diagram composed of three circles of radius $1$. The area of the entire Venn Diagram is of the form $\frac{a}{b}\pi +\sqrt{c}$ for positive integers $a$, $b$, $c$ where $a$, $b$ are relatively prime. Find $a+b+c$. (Each of the circles passes through the center of the other two circles) [b]p6.[/b] The sum of two four-digit numbers is $11044$. None of the digits are repeated and none of the digits are $0$s. Eight of the digits from $1-9$ are represented in these two numbers. Which one is not? [b]p7.[/b] Al wants to buy cookies. He can buy cookies in packs of $13$, $15$, or $17$. What is the maximum number of cookies he can not buy if he must buy a whole number of packs of each size? [b]p8.[/b] Let $\vartriangle ABC$ be a right triangle with base $AB = 2$ and hypotenuse $AC = 4$ and let $AD$ be a median of $\vartriangle ABC$. Now, let $BE$ be an altitude in $\vartriangle ABD$ and let $DF$ be an altitude in $\vartriangle ADC$. The quantity $(BE)^2 - (DF)^2$ can be expressed as a common fraction $\frac{a}{b}$ in lowest terms. Find $a + b$. [b]p9.[/b] Let $P(x)$ be a monic cubic polynomial with roots $r$, $s$, $t$, where $t$ is real. Suppose that $r + s + 2t = 8$, $2rs + rt + st = 12$ and $rst = 9$. Find $|P(2)|$. [b]p10.[/b] Let S be the set $\{1, 2,..., 21\}$. How many $11$-element subsets $T$ of $S$ are there such that there does not exist two distinct elements of $T$ such that one divides the other? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

A $ 9\times9\times9$ cube is composed of twenty-seven $ 3\times3\times3$ cubes. The big cube is 'tunneled' as follows: First, the six $ 3\times3\times3$ cubes which make up the center of each face as well as the center of $ 3\times3\times3$ cube are removed. Second, each of the twenty remaining $ 3\times3\times3$ cubes is diminished in the same way. That is, the central facial unit cubes as well as each center cube are removed. [asy] import three; size(4.5cm); triple eye = (6, 9, 5); currentprojection = perspective(eye); real eps = 0.001; for(int i = 0; i < 3; ++i){ for(int j = 0; j < 3; ++j){ for(int k = 0; k < 3; ++k){ if(i == 1 && j == 1) continue; if(j == 1 && k == 1) continue; if(k == 1 && i == 1) continue; draw(shift(i, j, k) * scale(1 - eps, 1 - eps, 1 - eps) * unitcube, gray(0.9), nolight); draw(shift(i, j, k) * (X--(X + Y)--Y--(Y+Z)--Z--(Z + X)--cycle)); draw(shift(i, j, k) * (X + Y + Z--X + Y)); draw(shift(i, j, k) * (X + Y + Z--Y + Z)); draw(shift(i, j, k) * (X + Y + Z--Z + X)); } } } [/asy] The surface area of the final figure is $ \textbf{(A)}\ 384\qquad \textbf{(B)}\ 729\qquad \textbf{(C)}\ 864\qquad \textbf{(D)}\ 1024\qquad \textbf{(E)}\ 1056$

Let F be the midpoint of side BC or triangle ABC. Construct isosceles right triangles ABD and ACE externally on sides AB and AC with the right angles at D and E respectively. Show that DEF is an isosceles right triangle.

Three positive integers $x$ and $y$ are written on the blackboard. Mary records in her notebook the product of any two of them and reduces the third number on the blackboard by $1$. With the new trio of numbers, she repeats the process, and continues until one of the numbers on the blackboard becomes zero. What will be the sum of the numbers in Mary's notebook at that point? (4)

Prove that if $ n $ is an integer, then $$ \frac{n^5}{120} - \frac{n^3}{24} + \frac{n}{30}$$ is also an integer.

Denote by $[a, b]$ the least common multiple of $a$ and $b$. Let $n$ be a positive integer such that $[n, n + 1] > [n, n + 2] >...> [n, n + 35]$. Prove that $[n, n + 35] > [n,n + 36]$.

Let $ABCD$ be a tetrahedron; $B', C', D'$ be the midpoints of the edges $AB, AC, AD$; $G_A, G_B, G_C, G_D$ be the barycentres of the triangles $BCD, ACD, ABD, ABC$, and $G$ be the barycentre of the tetrahedron. Show that $A, G, G_B, G_C, G_D$ are all on a sphere if and only if $A, G, B', C', D'$ are also on a sphere. [i]Dan Brânzei[/i]

The largest whole number such that seven times the number is less than 100 is $\text{(A)} \ 12 \qquad \text{(B)} \ 13 \qquad \text{(C)} \ 14 \qquad \text{(D)} \ 15 \qquad \text{(E)} \ 16$

Let G be an abelian group, $0\leq\varepsilon<1$ and $f : G\to\Bbb R^n$ a function that satisfies the inequality. $$||f(x+y)-f(x)-f(y)|| \leq \varepsilon ||f (y)|| \qquad (x, y)\in G^2$$ Prove that there is an additive function $A : G\to \Bbb R^n$ and a continuous function $\varphi : A (G) \to\Bbb R^n$ such that $f = \varphi\circ A$.

Show that the cube roots of three distinct primes cannot be terms in an arithmetic progression.

The computer "Intel stump-V" can do only one operation with a number: add 1 to it, then rearrange all the zeros in the decimal representation to the end and rearrenge the left digits in any order. (For example from 1004 you could get 1500 or 5100). The number $12345$ was written on the computer and after performing 400 operations, the number 100000 appeared on the screen. How many times has a number with the last digit 0 appeared on the screen?

10000 children came to a camp; every of them is friend of exactly eleven other children in the camp (friendship is mutual). Every child wears T-shirt of one of seven rainbow's colours; every two friends' colours are different. Leaders demanded that some children (at least one) wear T-shirts of other colours (from those seven colours). Survey pointed that 100 children didn't want to change their colours [translator's comment: it means that any of these 100 children (and only them) can't change his (her) colour such that still every two friends' colours will be different]. Prove that some of other children can change colours of their T-shirts such that as before every two friends' colours will be different.

Cozy the Cat and Dash the Dog are going up a staircase with a certain number of steps. However, instead of walking up the steps one at a time, both Cozy and Dash jump. Cozy goes two steps up with each jump (though if necessary, he will just jump the last step). Dash goes five steps up with each jump (though if necessary, he will just jump the last steps if there are fewer than 5 steps left). Suppose the Dash takes 19 fewer jumps than Cozy to reach the top of the staircase. Let $s$ denote the sum of all possible numbers of steps this staircase can have. What is the sum of the digits of $s$? $\textbf{(A) } 9 \qquad\textbf{(B) } 11 \qquad\textbf{(C) } 12 \qquad\textbf{(D) } 13 \qquad\textbf{(E) } 15 $

Suppose there are $2017$ spies, each with $\frac{1}{2017}$th of a secret code. They communicate by telephone; when two of them talk, they share all information they know with each other. What is the minimum number of telephone calls that are needed for all 2017 people to know all parts of the code?

Let $a,b\in\mathbb{R}_+$ such that $a+b=1$. Find the minimum value of the following expression: \[E(a,b)=3\sqrt{1+2a^2}+2\sqrt{40+9b^2}.\]