On every card of a deck of cards a regular 17-gon is displayed with all sides and diagonals, and the vertices are numbered from 1 through 17. On every card all edges (sides and diagonals) are colored with a color 1,2,...,105 such that the following property holds: for every 15 vertices of the 17-gon the 105 edges connecting these vertices are colored with different colors on at least one of the cards. What is the minimum number of cards in the deck?

Let $M$ be the midpoint of the side $AD$ of the square $ABCD.$ Consider the equilateral triangles $DFM{}$ and $BFE{}$ such that $F$ lies in the interior of $ABCD$ and the lines $EF$ and $BC$ are concurrent. Denote by $P{}$ the midpoint of $ME.$ Prove that" [list=a] [*]The point $P$ lies on the line $AC.$ [*]The halfline $PM$ is the bisector of the angle $APF.$ [/list] [i]Adrian Bud[/i]

Two equal isosceles triangles $ABC$ and $ADB$, with $C$ and $D$ located in different halfplanes with respect to the line $AB$, share the base $AB$. The midpoints of $AC$ and $BC$ are denoted by $E$ and $F$ respectively. Show that $DE$ and $DF$ divide $AB$ into three equal parts length.

We assign to any quadrilateral $ ABCD $ the centers of the circles circumscribed in the triangles $ BCD $, $ CDA $, $ DAB $, $ ABC $. Prove that if the vertices of a convex quadrilateral $ Q $ do not lie on the circle, then a) the four points assigned to quadrilateral Q in the above manner are the vertices of the convex quadrilateral. Let us denote this quadrilateral by $ t(Q) $, b) the vertices of the quadrilateral $ t(Q) $ do not lie on the circle, c) quadrilaterals $ Q $ and $ t(t(Q) $ are similar.

You have a $10 \times 10$ grid. A "move" on the grid consists of moving $7$ squares to the right and $3$ squares down. In case of exiting by a line, it continues at the beginning (left) of the same line and in case of ending a column, it continues at the beginning of the same column (above). Where should we start so that after $1996$ moves we end up in a corner?

Let $ x$ and $ y$ positive real numbers such that $ (1\plus{}x)(1\plus{}y)\equal{}2$. Show that $ xy\plus{}\frac{1}{xy}\geq\ 6$

For a prime $p$, let $\mathbb{F}_p$ denote the integers modulo $p$, and let $\mathbb{F}_p[x]$ be the set of polynomials with coefficients in $\mathbb{F}_p$. Find all $p$ for which there exists a quartic polynomial $P(x) \in \mathbb{F}_p[x]$ such that for all integers $k$, there exists some integer $\ell$ such that $P(\ell) \equiv k \pmod p$. (Note that there are $p^4(p-1)$ quartic polynomials in $\mathbb{F}_p[x]$ in total.) [i]Aprameya Tripathy[/i]

Given a rational number $a \neq 0$, find all functions $f:\mathbb{Q} \rightarrow \mathbb{Q}$ such that $$f(f(x)+ay)=af(y)+x$$ for all rational $x, y$.

Find every real values that $a$ can assume such that $$\begin{cases} x^3 + y^2 + z^2 = a\\ x^2 + y^3 + z^2 = a\\ x^2 + y^2 + z^3 = a \end{cases}$$ has a solution with $x, y, z$ distinct real numbers.

Positive real numbers $a, b, c$ satisfy $\frac{1}{a} +\frac{1}{b} +\frac{1}{c} = 3.$ Prove the inequality \[\frac{1}{\sqrt{a^3+ b}}+\frac{1}{\sqrt{b^3 + c}}+\frac{1}{\sqrt{c^3 + a}}\leq \frac{3}{\sqrt{2}}.\]

A list of 9 real numbers consists of $1$, $2.2 $, $3.2 $, $5.2 $, $6.2 $, $7$, as well as $x, y,z$ with $x\leq y\leq z$. The range of the list is $7$, and the mean and median are both positive integers. How many ordered triples $(x,y,z)$ are possible? $ \textbf{(A) }1 \qquad \textbf{(B) }2 \qquad \textbf{(C) }3 \qquad \textbf{(D) }4 \qquad \textbf{(E) infinitely many}\qquad $

An "unfair" coin has a $2/3$ probability of turning up heads. If this coin is tossed $50$ times, what is the probability that the total number of heads is even? $ \textbf{(A)}\ 25\left(\frac{2}{3}\right)^{50}\qquad\textbf{(B)}\ \frac{1}{2}\left(1 - \frac{1}{3^{50}}\right)\qquad\textbf{(C)}\ \frac{1}{2}\qquad\textbf{(D)}\ \frac{1}{2}\left(1 + \frac{1}{3^{50}}\right)\qquad\textbf{(E)}\ \frac{2}{3} $

The sequence $a_1,a_2,\dots$ of integers satisfies the conditions: (i) $1\le a_j\le2015$ for all $j\ge1$, (ii) $k+a_k\neq \ell+a_\ell$ for all $1\le k<\ell$. Prove that there exist two positive integers $b$ and $N$ for which\[\left\vert\sum_{j=m+1}^n(a_j-b)\right\vert\le1007^2\]for all integers $m$ and $n$ such that $n>m\ge N$. [i]Proposed by Ivan Guo and Ross Atkins, Australia[/i]

Let $ABC$ be a right angled triangle with $\angle A = 90^o$and $BC = a$, $AC = b$, $AB = c$. Let $d$ be a line passing trough the incenter of triangle and intersecting the sides $AB$ and $AC$ in $P$ and $Q$, respectively. (a) Prove that $$b \cdot \left( \frac{PB}{PA}\right)+ c \cdot \left( \frac{QC}{QA}\right) =a$$ (b) Find the minimum of $$\left( \frac{PB}{PA}\right)^ 2+\left( \frac{QC}{QA}\right)^ 2$$

Let $a,b,c$ be the lengths of the sides of a triangle, and $\alpha, \beta, \gamma$ respectively, the angles opposite these sides. Prove that if \[ a+b=\tan{\frac{\gamma}{2}}(a\tan{\alpha}+b\tan{\beta}) \] the triangle is isosceles.

Equilateral triangle $ABC$ is inscribed in a circle with radius $6$. Find the area of the region enclosed by $AB$, $AC$, and the minor arc $BC$.

[b]p1.[/b] Consider a parallelogram $ABCD$ with sides of length $a$ and $b$, where $a \ne b$. The four points of intersection of the bisectors of the interior angles of the parallelogram form a rectangle $EFGH$. A possible configuration is given below. Show that $$\frac{Area(ABCD)}{Area(EFGH)}=\frac{2ab}{(a - b)^2}$$ [img]https://cdn.artofproblemsolving.com/attachments/e/a/afaf345f2ef7c8ecf4388918756f0b56ff20ef.png[/img] [b]p2.[/b] A metal wire of length $4\ell$ inches (where $\ell$ is a positive integer) is used as edges to make a cardboard rectangular box with surface area $32$ square inches and volume $8$ cubic inches. Suppose that the whole wire is used. (i) Find the dimension of the box if $\ell= 9$, i.e., find the length, the width, and the height of the box without distinguishing the different orders of the numbers. Justify your answer. (ii) Show that it is impossible to construct such a box if $\ell = 10$. [b]p3.[/b] A Pythagorean n-tuple is an ordered collection of counting numbers $(x_1, x_2,..., x_{n-1}, x_n)$ satisfying the equation $$x^2_1+ x^2_2+ ...+ x^2_{n-1} = x^2_{n}.$$ For example, $(3, 4, 5)$ is an ordinary Pythagorean $3$-tuple (triple) and $(1, 2, 2, 3)$ is a Pythagorean $4$-tuple. (a) Given a Pythagorean triple $(a, b, c)$ show that the $4$-tuple $(a^2, ab, bc, c^2)$ is Pythagorean. (b) Extending part (a) or using any other method, come up with a procedure that generates Pythagorean $5$-tuples from Pythagorean $3$- and/or $4$-tuples. Few numerical examples will not suffice. You have to find a method that will generate infinitely many such $5$-tuples. (c) Find a procedure to generate Pythagorean $6$-tuples from Pythagorean $3$- and/or $4$- and/or $5$-tuples. Note. You can assume without proof that there are infinitely many Pythagorean triples. [b]p4.[/b] Consider the recursive sequence defined by $x_1 = a$, $x_2 = b$ and $$x_{n+2} =\frac{x_{n+1} + x_n - 1}{x_n - 1}, n \ge 1 .$$ We call the pair $(a, b)$ the seed for this sequence. If both $a$ and $b$ are integers, we will call it an integer seed. (a) Start with the integer seed $(2, 2019)$ and find $x_7$. (b) Show that there are infinitely many integer seeds for which $x_{2020} = 2020$. (c) Show that there are no integer seeds for which $x_{2019} = 2019$. [b]p5.[/b] Suppose there are eight people at a party. Each person has a certain amount of money. The eight people decide to play a game. Let $A_i$, for $i = 1$ to $8$, be the amount of money person $i$ has in his/her pocket at the beginning of the game. A computer picks a person at random. The chosen person is eliminated from the game and their money is put into a pot. Also magically the amount of money in the pockets of the remaining players goes up by the dollar amount in the chosen person's pocket. We continue this process and at the end of the seventh stage emerges a single person and a pot containing $M$ dollars. What is the expected value of $M$? The remaining player gets the pot and the money in his/her pocket. What is the expected value of what he/she takes home? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

There are 2008 bags numbered from 1 to 2008, with 2008 frogs in each one of them. Two people play in turns. A play consists in selecting a bag and taking out of it any number of frongs (at least one), leaving $ x$ frogs in it ($ x\geq 0$). After each play, from each bag with a number higher than the selected one and having more than $ x$ frogs, some frogs scape until there are $ x$ frogs in the bag. The player that takes out the last frog from bag number 1 looses. Find and explain a winning strategy.

What is the number of ways in which one can choose $60$ unit squares from a $11 \times 11$ chessboard such that no two chosen squares have a side in common?

For how many pairs of consecutive integers in $\{1000,1001,1002,\ldots,2000\}$ is no carrying required when the two integers are added?

Let $n$ be a fixed positive integer and fix a point $O$ in the plane. There are $n$ lines drawn passing through the point $O$. Determine the largest $k$ (depending on $n$) such that we can always color $k$ of the $n$ lines red in such a way that no two red lines are perpendicular to each other. [i]Proposed by Nikola Velov[/i]

A right triangle has the property that it's sides are pairwise relatively prime positive integers and that the ratio of it's area to it's perimeter is a perfect square. Find the minimum possible area of this triangle.

Let $n$ be a positive integer. Determine the smallest possible value of $1-n+n^2-n^3+\dots+n^{1000}$. [i]Proposed by Evan Chen[/i]

$\vartriangle ABC$ is an isosceles triangle with $AB = AC$. Let $M$ be the midpoint of $BC$ and $E$ be the point on AC such that $AE :CE = 5 : 3$. Let $X$ be the intersection of $BE$ and $AM$. Given that the area of $\vartriangle CM X$ is $15$, find the area of $\vartriangle ABC$.

The integers $1, 2, 3,. . . , 2016$ are written in a board. You can choose any pair of numbers in the board and replace them with their average. For example, you can replace $1$ and $2$ with $1.5$, or you can replace $1$ and $3$ with a second copy of $2$. After such replacements, the board will have only one number. (a) Prove that there is a sequence of substitutions that will make let the final number be $2$. (b) Prove that there is a sequence of substitutions that will make let the final number be $1000$.