Let $ m$ a positive integer and $ p$ a prime number, both fixed. Define $ S$ the set of all $ m$-uple of positive integers $ \vec{v} \equal{} (v_1,v_2,\ldots,v_m)$ such that $ 1 \le v_i \le p$ for all $ 1 \le i \le m$. Define also the function $ f(\cdot): \mathbb{N}^m \to \mathbb{N}$, that associates every $ m$-upla of non negative integers $ (a_1,a_2,\ldots,a_m)$ to the integer $ \displaystyle f(a_1,a_2,\ldots,a_m) \equal{} \sum_{\vec{v} \in S} \left(\prod_{1 \le i \le m}{v_i^{a_i}} \right)$. Find all $ m$-uple of non negative integers $ (a_1,a_2,\ldots,a_m)$ such that $ p \mid f(a_1,a_2,\ldots,a_m)$. [i](Pierfrancesco Carlucci)[/i]

All of the rectangles in the figure below, which is drawn to scale, are similar to the enclosing rectangle. Each number represents the area of the rectangle. What is length $AB$? [img]https://cdn.artofproblemsolving.com/attachments/3/b/298cf96ec8fc90c438e4936a05c260170eda01.png[/img] $\textbf{(A) }4+4\sqrt5\qquad\textbf{(B) }10\sqrt2\qquad\textbf{(C) }5+5\sqrt5\qquad\textbf{(D) }10\sqrt[4]{8}\qquad\textbf{(E) }20$

Let $P$ be an arbitrary point on the side $BC$ of triangle $ABC$ and let $D$ be the tangency point between the incircle of the triangle $ABC$ and the side $BC$. If $Q$ and $R$ are respectively the incenters in the triangles $ABP$ and $ACP$, prove that $\angle QDR$ is a right angle. Prove that the triangle $QDR$ is isosceles if and only if $P$ is the foot of the altitude from $A$ in the triangle $ABC$.

Let $ABC$ be a scalene triangle and $D$ be the feet of altitude from $A$ to $BC$. Let $I_1$, $I_2$ be incenters of triangles $ABD$ and $ACD$ respectively, and let $H_1$, $H_2$ be orthocenters of triangles $ABI_1$ and $ACI_2$ respectively. The circles $(AI_1H_1)$ and $(AI_2H_2)$ meet again at $X$. The lines $AH_1$ and $XI_1$ meet at $Y$, and the lines $AH_2$ and $XI_2$ meet at $Z$. Suppose the external common tangents of circles $(BI_1H_1)$ and $(CI_2H_2)$ meet at $U$. Prove that $UY=UZ$. [i]Proposed by Ivan Chan Kai Chin[/i]

Prove that the equation $x^3+y^3+z^3=t^4$ has infinitely many solutions in positive integers such that $\gcd(x,y,z,t)=1$. [i]Mihai Pitticari & Sorin Rǎdulescu[/i]

Anja has to write $2014$ integers on the board such that arithmetic mean of any of the three numbers is among those $2014$ numbers. Show that this is possible only when she writes nothing but $2014$ equal integers.

[b]p1.[/b] Compute $2020 \cdot \left( 2^{(0\cdot1)} + 9 - \frac{(20^1)}{8}\right)$. [b]p2.[/b] Nathan has five distinct shirts, three distinct pairs of pants, and four distinct pairs of shoes. If an “outfit” has a shirt, pair of pants, and a pair of shoes, how many distinct outfits can Nathan make? [b]p3.[/b] Let $ABCD$ be a rhombus such that $\vartriangle ABD$ and $\vartriangle BCD$ are equilateral triangles. Find the angle measure of $\angle ACD$ in degrees. [b]p4.[/b] Find the units digit of $2019^{2019}$. [b]p5.[/b] Determine the number of ways to color the four vertices of a square red, white, or blue if two colorings that can be turned into each other by rotations and reflections are considered the same. [b]p6.[/b] Kathy rolls two fair dice numbered from $1$ to $6$. At least one of them comes up as a $4$ or $5$. Compute the probability that the sumof the numbers of the two dice is at least $10$. [b]p7.[/b] Find the number of ordered pairs of positive integers $(x, y)$ such that $20x +19y = 2019$. [b]p8.[/b] Let $p$ be a prime number such that both $2p -1$ and $10p -1$ are prime numbers. Find the sum of all possible values of $p$. [b]p9.[/b] In a square $ABCD$ with side length $10$, let $E$ be the intersection of $AC$ and $BD$. There is a circle inscribed in triangle $ABE$ with radius $r$ and a circle circumscribed around triangle $ABE$ with radius $R$. Compute $R -r$ . [b]p10.[/b] The fraction $\frac{13}{37 \cdot 77}$ can be written as a repeating decimal $0.a_1a_2...a_{n-1}a_n$ with $n$ digits in its shortest repeating decimal representation. Find $a_1 +a_2 +...+a_{n-1}+a_n$. [b]p11.[/b] Let point $E$ be the midpoint of segment $AB$ of length $12$. Linda the ant is sitting at $A$. If there is a circle $O$ of radius $3$ centered at $E$, compute the length of the shortest path Linda can take from $A$ to $B$ if she can’t cross the circumference of $O$. [b]p12.[/b] Euhan and Minjune are playing tennis. The first one to reach $25$ points wins. Every point ends with Euhan calling the ball in or out. If the ball is called in, Minjune receives a point. If the ball is called out, Euhan receives a point. Euhan always makes the right call when the ball is out. However, he has a $\frac34$ chance of making the right call when the ball is in, meaning that he has a $\frac14$ chance of calling a ball out when it is in. The probability that the ball is in is equal to the probability that the ball is out. If Euhan won, determine the expected number of wrong callsmade by Euhan. [b]p13.[/b] Find the number of subsets of $\{1, 2, 3, 4, 5, 6,7\}$ which contain four consecutive numbers. [b]p14.[/b] Ezra and Richard are playing a game which consists of a series of rounds. In each round, one of either Ezra or Richard receives a point. When one of either Ezra or Richard has three more points than the other, he is declared the winner. Find the number of games which last eleven rounds. Two games are considered distinct if there exists a round in which the two games had different outcomes. [b]p15.[/b] There are $10$ distinct subway lines in Boston, each of which consists of a path of stations. Using any $9$ lines, any pair of stations are connected. However, among any $8$ lines there exists a pair of stations that cannot be reached from one another. It happens that the number of stations is minimized so this property is satisfied. What is the average number of stations that each line passes through? [b]p16.[/b] There exist positive integers $k$ and $3\nmid m$ for which $$1 -\frac12 + \frac13 - \frac14 +...+ \frac{1}{53}-\frac{1}{54}+\frac{1}{55}=\frac{3^k \times m}{28\times 29\times ... \times 54\times 55}.$$ Find the value $k$. [b]p17.[/b] Geronimo the giraffe is removing pellets from a box without replacement. There are $5$ red pellets, $10$ blue pellets, and $15$ white pellets. Determine the probability that all of the red pellets are removed before all the blue pellets and before all of the white pellets are removed. [b]p18.[/b] Find the remainder when $$70! \left( \frac{1}{4 \times 67}+ \frac{1}{5 \times 66}+...+ \frac{1}{66\times 5}+ \frac{1}{67\times 4} \right)$$ is divided by $71$. [b]p19.[/b] Let $A_1A_2...A_{12}$ be the regular dodecagon. Let $X$ be the intersection of $A_1A_2$ and $A_5A_{11}$. Given that $X A_2 \cdot A_1A_2 = 10$, find the area of dodecagon. [b]p20.[/b] Evaluate the following infinite series: $$\sum^{\infty}_{n=1}\sum^{\infty}_{m=1} \frac{n \sec^2m -m \tan^2 n}{3^{m+n}(m+n)}$$. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

The excircle of right-angled triangle $ABC$ ($\angle B =90^o$) touches side $BC$ at point $A_1$ and touches line $AC$ in point $A_2$. Line $A_1A_2$ meets the incircle of $ABC$ for the first time at point $A'$, point $C'$ is defined similarly. Prove that $AC||A'C'$.

Let $a, b$ be integers, and let $P(x) = ax^3+bx.$ For any positive integer $n$ we say that the pair $(a,b)$ is $n$-good if $n | P(m)-P(k)$ implies $n | m - k$ for all integers $m, k.$ We say that $(a,b)$ is $very \ good$ if $(a,b)$ is $n$-good for infinitely many positive integers $n.$ [list][*][b](a)[/b] Find a pair $(a,b)$ which is 51-good, but not very good. [*][b](b)[/b] Show that all 2010-good pairs are very good.[/list] [i]Proposed by Okan Tekman, Turkey[/i]

The smallest product one could obtain by multiplying two numbers in the set $\{ -7, -5, -1, 1, 3 \}$ is $\text{(A)}\ -35 \qquad \text{(B)}\ -21 \qquad \text{(C)}\ -15 \qquad \text{(D)}\ -1 \qquad \text{(E)}\ 3$

Does there exist an integer $z$ that can be written in two different ways as $z = x! + y!$, where $x, y$ are natural numbers with $x \le y$ ?

A nonnegative real number is written at every cube's vertex. The sum of those numbers equals to $1$. Two players choose in turn faces of the cube, but they cannot choose the face parallel to already chosen one (the first moves twice, the second -- once). Prove that the first player can provide the number, at the common for three chosen faces vertex, to be not greater than $1/6$.

Find the smallest positive integer $n$ such that \[2^{1989}\; \vert \; m^{n}-1\] for all odd positive integers $m>1$.

During a break, $n$ children at school sit in a circle around their teacher to play a game. The teacher walks clockwise close to the children and hands out candies to some of them according to the following rule. He selects one child and gives him a candy, then he skips the next child and gives a candy to the next one, then he skips 2 and gives a candy to the next one, then he skips 3, and so on. Determine the values of $n$ for which eventually, perhaps after many rounds, all children will have at least one candy each.

Suppose $S$ is a convex figure in plane with area $10$. Consider a chord of length $3$ in $S$ and let $A$ and $B$ be two points on this chord which divide it into three equal parts. For a variable point $X$ in $S-\{A,B\}$, let $A'$ and $B'$ be the intersection points of rays $AX$ and $BX$ with the boundary of $S$. Let $S'$ be those points $X$ for which $AA'>\frac{1}{3} BB'$. Prove that the area of $S'$ is at least $6$. [i]Proposed by Ali Khezeli[/i]

Let $m$ and $n$ are fixed natural numbers and $Oxy$ is a coordinate system in the plane. Find the total count of all possible situations of $n+m-1$ points $P_1(x_1,y_1),P_2(x_2,y_2),\ldots,P_{n+m-1}(x_{n+m-1},y_{n+m-1})$ in the plane for which the following conditions are satisfied: (i) The numbers $x_i$ and $y_i~(i=1,2,\ldots,n+m-1)$ are integers and $1\le x_i\le n,1\le y_i\le m$. (ii) Every one of the numbers $1,2,\ldots,n$ can be found in the sequence $x_1,x_2,\ldots,x_{n+m-1}$ and every one of the numbers $1,2,\ldots,m$ can be found in the sequence $y_1,y_2,\ldots,y_{n+m-1}$. (iii) For every $i=1,2,\ldots,n+m-2$ the line $P_iP_{i+1}$ is parallel to one of the coordinate axes. [i](Ivan Gochev, Hristo Minchev)[/i]

Consider the circle $\Omega$ with radius $9$ and center at the origin $(0,\,0)$, and a disk $\Delta$ with radius $1$ and center at $(r,\,0)$, where $0\leq r\leq 8$. Two points $P$ and $Q$ are chosen independently and uniformly at random on $\Omega$. Which value(s) of $r$ minimize the probability that the chord $\overline{PQ}$ intersects $\Delta$?

As a reward for working for NIMO, Evan divides $100$ indivisible marbles among three of his volunteers: David, Justin, and Michael. (Of course, each volunteer must get at least one marble!) However, Evan knows that, in the middle of the night, Lewis will select a positive integer $n > 1$ and, for each volunteer, steal exactly $\frac 1n$ of his marbles (if possible, i.e. if $n$ divides the number of marbles). In how many ways can Evan distribute the $100$ marbles so that Lewis is unable to steal marbles from every volunteer, regardless of which $n$ he selects? [i]Proposed by Jack Cornish[/i]

Find all tuples $ (x_1,x_2,x_3,x_4,x_5)$ of positive integers with $ x_1>x_2>x_3>x_4>x_5>0$ and $ {\left \lfloor \frac{x_1+x_2}{3} \right \rfloor }^2 + {\left \lfloor \frac{x_2+x_3}{3} \right \rfloor }^2 + {\left \lfloor \frac{x_3+x_4}{3} \right \rfloor }^2 + {\left \lfloor \frac{x_4+x_5}{3} \right \rfloor }^2 = 38.$

The natural numbers $t{}$ and $q{}$ are given. For an integer $s{}$, we denote by $f(s)$ the number of lattice points lying in the triangle with vertices $(0;-t/q), (0; t/q)$ and $(t; ts/q)$. Suppose that $q{}$ divides $rs-1{}$. Prove that $f(r) = f(s)$.

A segment of unit length is cut into eleven smaller segments, each with length of no more than $a$. For what values of $a$, can one guarantee that any three segments form a triangle? [i](4 points)[/i]

The sum of $n > 2$ nonzero real numbers (not necessarily distinct) equals zero. For each of the $2^n - 1$ ways to choose one or more of these numbers, their sums are written in non-increasing order in a row. The first number in the row is $S$. Find the smallest possible value of the second number.

Define the functions $g_k \colon \mathbb{Z} \to \mathbb{Z}$, $g_k(x) = x^k$, where $k$ is a positive integer. Find the set $M_k$ of positive integers $n$ for which there exist injective functions $f_1,f_2, \dots ,f_n \colon \mathbb{Z} \to \mathbb{Z}$ such that $g_k=f_1\cdot f_2 \cdot \ldots \cdot f_n$. (Here, $\cdot$ denotes component-wise function multiplication)

There are $20$ points marked on a circle. Two players take turns drawing chords with ends at marked points that do not intersect the already drawn chords. The one who cannot make the next move loses. Who can secure their win?

$M$ is midpoint of $BC$.$P$ is an arbitary point on $BC$. $C_{1}$ is tangent to big circle.Suppose radius of $C_{1}$ is $r_{1}$ Radius of $C_{4}$ is equal to radius of $C_{1}$ and $C_{4}$ is tangent to $BC$ at P. $C_{2}$ and $C_{3}$ are tangent to big circle and line $BC$ and circle $C_{4}$. [img]http://aycu01.webshots.com/image/4120/2005120338156776027_rs.jpg[/img] Prove : \[r_{1}+r_{2}+r_{3}=R\] ($R$ radius of big circle)