Put $S = 2^1 + 3^5 + 4^9 + 5^{13} + ... + 505^{2013} + 506^{2017}$. The last digit of $S$ is (A): $1$ (B): $3$ (C): $5$ (D): $7$ (E): None of the above.

There are $20$ people in a certain community. $10$ of them speak English, $10$ of them speak German, and $10$ of them speak French. We call a [i]committee[/i] to a $3$-subset of this community if there is at least one who speaks English, at least one who speaks German, and at least one who speaks French in this subset. At most how many commitees are there in this community? $ \textbf{(A)}\ 120 \qquad\textbf{(B)}\ 380 \qquad\textbf{(C)}\ 570 \qquad\textbf{(D)}\ 1020 \qquad\textbf{(E)}\ 1140 $

Show that in a non-equilateral triangle, the following statements are equivalent: $(a)$ The angles of the triangle are in arithmetic progression. $(b)$ The common tangent to the Nine-point circle and the Incircle is parallel to the Euler Line.

For $n \in \mathbb{N}$, consider non-negative valued functions $f$ on $\{1,2, \cdots , n\}$ satisfying $f(i) \geqslant f(j)$ for $i>j$ and $\sum_{i=1}^{n} (i+ f(i))=2023.$ Choose $n$ such that $\sum_{i=1}^{n} f(i)$ is at least. How many such functions exist in that case?

The function ƒ. which is defined for all real numbers satisfies: $$f(x+y)+f(x-y)=2f(x)+2f(y)$$ Prove that $f(0) = 0$, $f(-x) = f(x)$, $f(2x) = 4 f (x)$, $$f(x + y + z) = f(x + y) + f(y + z) + f(z + x) -f(x) - f(y) -f(z).$$

Let $ a_0$, $ a_1$, $ a_2$, $ \ldots$ be a sequence of positive integers such that the greatest common divisor of any two consecutive terms is greater than the preceding term; in symbols, $ \gcd (a_i, a_{i \plus{} 1}) > a_{i \minus{} 1}$. Prove that $ a_n\ge 2^n$ for all $ n\ge 0$. [i]Proposed by Morteza Saghafian, Iran[/i]

Show that every positive integer is a sum of one or more numbers of the form $2^r3^s,$ where $r$ and $s$ are nonnegative integers and no summand divides another. (For example, $23=9+8+6.)$

Prove that if the four faces of a tetrahedron are of the same area they are equal.

5 blocks of volume 1 cm$^3$, 1 cm$^3$, 1 cm$^3$, 1 cm$^3$ and 4 cm$^3$ are placed one above another to form a structure as shown in the figure. Suppose sum of surface areas of upper face of each is 48 cm$^2$ . Determine the minimum possible height of the whole structure.

A pair of positive integers $m, n$ is called [i]guerrera[/i], if there exists positive integers $a, b, c, d$ such that $m=ab$, $n=cd$ and $a+b=c+d$. For example the pair $8, 9$ is [i]guerrera[/i] cause $8= 4 \cdot 2$, $9= 3 \cdot 3$ and $4+2=3+3$. We paint the positive integers if the following order: We start painting the numbers $3$ and $5$. If a positive integer $x$ is not painted and a positive $y$ is painted such that the pair $x, y$ is [i]guerrera[/i], we paint $x$. Find all positive integers $x$ that can be painted.

We have $n>2$ non-zero integers such that each one of them is divisible by the sum of the other $n-1$ numbers. Prove that the sum of all the given numbers is zero.

The lines with equations $ax-2y=c$ and $2x+by=-c$ are perpendicular and intersect at $(1, -5)$. What is $c$? $\textbf{(A) } -13\qquad \textbf{(B) } -8\qquad \textbf{(C) } 2\qquad \textbf{(D) } 8\qquad \textbf{(E) } 13$

A board that has some of its squares painted black is called [i]acceptable [/i] if there are no four black squares that form a $2 \times 2$ subboard. Find the largest real number $\lambda$ such that for every positive integer $n$ the following proposition holds: mercy: if an $n \times n$ board is acceptable and has fewer than $\lambda n^2$ dark squares, then an additional square black can be painted so that the board is still acceptable.

On the last afternoon of the Kubik family vacation, Michael puts down a copy of $\textit{Mathematical Olympiad Challenges}$ and goes out to play tennis. Wendy notices the book and decides to see if there are a few problems in it that she can solve. She decides to focus her energy on one problem in particular: \[\begin{array}{l}\text{Given 69 distinct positive integers not exceeding 100, prove that one can}\\\text{choose four of them }a,b,c,d\text{ such that }a<b<c\text{ and } a+b+c=d. \text{ Is this}\\\text{statement true for 68 numbers?}\end{array}\] After some time working on the problem, Wendy finally feels like she has a grip on the solution. When Michael returns, she explains her solutions to him. "Well done!" he tells her. "Now, see if you can solve this generalization. Consider the set \[S=\{1,2,3,\ldots,2007,2008\}.\] Find the smallest value of $t$ such that given any subset $T$ of $S$ where $|T|=t$, then there are necessarily distinct $a,b,c,d\in T$ for which $a+b+c=d$." Find the answer to Michael's generalization.

Given collinear points $A,B,C$ such that $AB = BC$. How can you construct a point $D$ on $AB$ such that $AD = 2DB$, using only a straightedge? (You are not allowed to measure distances)

At the theater children get in for half price. The price for $5$ adult tickets and $4$ child tickets is $\$24.50$. How much would $8$ adult tickets and $6$ child tickets cost? $\textbf{(A) }\$35\qquad \textbf{(B) }\$38.50\qquad \textbf{(C) }\$40\qquad \textbf{(D) }\$42\qquad \textbf{(E) }\$42.50$

Points $X$ and $Y$ are the midpoints of arcs $AB$ and $BC$ of the circumscribed circle of triangle $ABC$. Point $T$ lies on side $AC$. It turned out that the bisectors of the angles $ATB$ and $BTC$ pass through points $X$ and $Y$ respectively. What angle $B$ can be in triangle $ABC$?

Prove that any polynomial of the form $1+a_nx^n + a_{n+1}x^{n+1} + \cdots + a_kx^k$ ($k\ge n$) has at least $n-2$ non-real roots (counting multiplicity), where the $a_i$ ($n\le i\le k$) are real and $a_k\ne 0$. [i]David Yang.[/i]

1. Let $ABC$ be an acute-angled triangle with $AB\neq AC$. The circle with diameter $BC$ intersects the sides $AB$ and $AC$ at $M$ and $N$ respectively. Denote by $O$ the midpoint of the side $BC$. The bisectors of the angles $\angle BAC$ and $\angle MON$ intersect at $R$. Prove that the circumcircles of the triangles $BMR$ and $CNR$ have a common point lying on the side $BC$.

Find the largest prime that divides $1\cdot 2\cdot 3+2\cdot 3\cdot 4+\cdots +44\cdot 45\cdot 46$

Several zeros, ones and twos are written on the blackboard. An anonymous clean in turn pairs of different numbers, writing, instead of cleaned, the number not equal to each. ($0$ instead of pair $\{1,2\}, 1$ instead of $\{0,2\}, 2$ instead of $\{0,1\}$). Prove that if there remains one number only, it does not depend on the processing order.

A triangle $ABC$ is inscribed in a circle $\omega$. A variable line $\ell$ chosen parallel to $BC$ meets segments $AB$, $AC$ at points $D$, $E$ respectively, and meets $\omega$ at points $K$, $L$ (where $D$ lies between $K$ and $E$). Circle $\gamma_1$ is tangent to the segments $KD$ and $BD$ and also tangent to $\omega$, while circle $\gamma_2$ is tangent to the segments $LE$ and $CE$ and also tangent to $\omega$. Determine the locus, as $\ell$ varies, of the meeting point of the common inner tangents to $\gamma_1$ and $\gamma_2$. [i](Russia) Vasily Mokin and Fedor Ivlev[/i]

Prove the following statement: If a polynomial $f(x)$ with real coefficients takes only nonnegative values, then there exists a positive integer $n$ and polynomials $g_1(x), g_2(x),\cdots, g_n(x)$ such that \[f(x) = g_1(x)^2 + g_2(x)^2 +\cdots+ g_n(x)^2\]

Find all positive integers $n$ such that the equation $\frac{1}{x} + \frac{1}{y} = \frac{1}{n}$ has exactly $2011$ positive integer solutions $(x,y)$ where $x \leq y$.

Let $p_n(k)$ be the number of permutations of the set $\{1,2,3,\ldots,n\}$ which have exactly $k$ fixed points. Prove that $\sum_{k=0}^nk p_n(k)=n!$.[i](IMO Problem 1)[/i] [b][i]Original formulation [/i][/b] Let $S$ be a set of $n$ elements. We denote the number of all permutations of $S$ that have exactly $k$ fixed points by $p_n(k).$ Prove: (a) $\sum_{k=0}^{n} kp_n(k)=n! \ ;$ (b) $\sum_{k=0}^{n} (k-1)^2 p_n(k) =n! $ [i]Proposed by Germany, FR[/i]