Each point on the plane is colored either red, green, or blue. Prove that there exists an isosceles triangle whose vertices all have the same color.

Let be two natural numbers $ n $ and $ a. $ [b]a)[/b] Prove that there exists an $ n\text{-tuplet} $ of natural numbers $ \left( a_1,a_2,\ldots ,a_n\right) $ that satisfy the following equality. $$ 1+\frac{1}{a} =\prod_{i=1}^n \left( 1+\frac{1}{a_i} \right) $$ [b]b)[/b] Show that there exist only finitely such $ n\text{-tuplets} . $

A gambling student tosses a fair coin. She gains $1$ point for each head that turns up, and gains $2$ points for each tail that turns up. Prove that the probability of the student scoring [i]exactly[/i] $n$ points is $\frac{1}{3}\cdot\left(2+\left(-\frac{1}{2}\right)^{n}\right)$.

We will say that two sets of distinct numbers are $\textit{linked}$ to each other if between any two numbers of each set lies at least one number of the other set. Is it possible to fill the cells of a $100 \times 200$ rectangle with distinct numbers so that any two rows of the rectangle are linked to one another, and any two columns of the rectangle are linked to one another?

An open half-plane is the set of all points lying to one side of a line, but excluding the points on the line itself. If four open half-planes cover the plane, show that one can select three of them which still cover the plane.

Let $ n$ be a positive integer. We consider the set $ P$ of all partitions of $ n$ into a sum of positive integers (the order is irrelevant). For every partition $ \alpha$, let $ a_{k}(\alpha)$ be the number of summands in $ \alpha$ that are equal to $ k, k = 1,2,...,n.$ Prove that $ \sum_{\alpha\in P}\frac{1}{1^{a_{1}(\alpha)}a_{1}(\alpha)!\cdot 2^{a_{2}(\alpha)}a_{2}(\alpha)!...n^{a_{n}(\alpha)}a_{n}(\alpha)!}=1.$

Let $n$ be a positive integer and $M=\{1,2,\ldots, n\}.$ A subset $T\subset M$ is called [i]heavy[/i] if each of its elements is greater or equal than $|T|.$ Let $f(n)$ denote the number of heavy subsets of $M.$ Describe a method for finding $f(n)$ and use it to calculate $f(32).$

Consider the figure below, composed of 16 segments. Prove that there is no curve intersecting each segment exactly once. (The curve may be not closed, may intersect itself, but it is not allowed to touch the segments or to pass through the vertices.) [asy] draw((0,0)--(6,0)--(6,3)--(0,3)--(0,0)); draw((0,3/2)--(6,3/2)); draw((2,0)--(2,3/2)); draw((4,0)--(4,3/2)); draw((3,3/2)--(3,3)); [/asy]

What is the largest possible number of acute angles in an $n$-gon which is not selfintersecting (no two non-adjacent edges interesect)?

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]

We are given a polyhedron with at least $5$ vertices, such that exactly $3$ edges meet in each of the vertices. Prove that we can assign a rational number to every vertex of the given polyhedron such that the following conditions are met: $(i)$ At least one of the numbers assigned to the vertices is equal to $2020$. $(ii)$ For every polygonal face, the product of the numbers assigned to the vertices of that face is equal to $1$.

Every $24$ hours , the minute hand of an ordinary clock completes $24$ revolutions while the hour hand completes $2$. Every $24$ hours , the minute hand of an Italian clock completes $24$ revolutions while the hour hand completes only $1$ . The minute hand of each clock is longer than the hour hand, and "zero hour" is located at the top of the clock's face. How many positions of the two hands can occur on an Italian clock within a $24$-hour period that are possible on an ordinary one? (Folklore)

An Olympiad has 99 tasks. Several participants of the Olympiad are standing in a circle. They all solved different sets of tasks. Any two participants standing side by side do not have a common solved problem, but have a common unsolved one. Prove that the number of participants in the circle does not exceed \[2^{99}-\binom{99}{50}.\]

[b]p1.[/b] The three little pigs are learning about fractions. They particularly like the number x = $1/5$, because when they add the denominator to the numerator, add the denominator to the denominator, and form a new fraction, they obtain $6/10$, which equals $3x$ (so each little pig can have his own $x$). The $101$ Dalmatians hear about this and want their own fraction. Your job is to help them. (a) Find a fraction $y$ such that when the denominator is added to the numerator and also added to the denominator, the result is $101y$. (b) Prove that the fraction $y$ (put into lowest terms) in part (a) is the only fraction in lowest terms with this property. [b]p2.[/b] A small kingdom consists of five square miles. The king, who is not very good at math, wants to divide the kingdom among his $9$ sons. He tells each son to mark out a region of $1$ square mile. Prove that there are two sons whose regions overlap by at least $1/9$ square mile. [b]p3.[/b] Let $\pi (n)$ be the number of primes less than or equal to n. Sometimes $n$ is a multiple of $\pi (n)$. It is known that $\pi (4) = 2$ (because of the two primes $2, 3$) and $\pi (64540) = 6454$. Show that there exists an integer $n$, with $4 < n < 64540$, such that $\pi (n) = n/8$. [b]p4.[/b] Two circles of radii $R$ and $r$ are externally tangent at a point $A$. Their common external tangent is tangent to the circles at $B$ and $C$. Calculate the lengths of the sides of triangle $ABC$ in terms of $R$ and $r$. [img]https://cdn.artofproblemsolving.com/attachments/e/a/e5b79cb7c41e712602ec40edc037234468b991.png[/img] [b]p5.[/b] There are $2005$ people at a meeting. At the end of the meeting, each person who has shaken hands with at most $10$ people is given a red T-shirt with the message “I am unfriendly.” Then each person who has shaken hands only with people who received red T-shirts is given a blue T-shirt with the message “All of my friends are unfriendly.” (Some lucky people might get both red and blue T-shirts, for example, those who shook no one’s hand.) Prove that the number of people who received blue T-shirts is less than or equal to the number of people who received red T-shirts. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Given a triplet we perform on it the following operation. We choose two numbers among them and change them into their sum and product, left number stays unchanged. Can we, starting from triplet $(3,4,5)$ and performing above operation, obtain again a triplet of numbers which are lengths of right triangle?

$3n$ points are given ($n\ge 1$) in the plane, each $3$ of them are not collinear. Prove that there are $n$ distinct triangles with the vertices those points.

Let $n \geq 3$ be a positive integer. Find the maximum number of diagonals in a regular $n$-gon one can select, so that any two of them do not intersect in the interior or they are perpendicular to each other.

Show that the smallest number of colors that is needed for coloring numbers $1, 2,..., 2013$ so that for every two number $a, b$ which is the same color, $ab$ is not a multiple of $2014$, is $3$ colors.

Johann and Nicole are playing a game on the coordinate plane. First, Johann draws any polygon $\mathcal{S}$ and then Nicole can shift $\mathcal{S}$ to wherever she wants. Johann wins if there exists a point with coordinates $(x, y)$ in the interior of $\mathcal{S}$, where $x$ and $y$ are coprime integers. Otherwise, Nicole wins. Determine who has a winning strategy.

Is it possible to choose $1983$ distinct positive integers, all less than or equal to $10^5$, no three of which are consecutive terms of an arithmetic progression?

There are $n$ husbands and wives at a party in the palace. The husbands sit at a round table, and the wives sit at another round tables. The king and queen (not included in the $n$ couples) are going to shake hands with them one by one. Assume that the king starts from a man, and the queen starts from his wife. Consider the following two ways of shaking hands: (i) The king shakes hands with the men one by one clockwise. Each time when the king shakes hands with a man, the queen moves clockwise to his wife and shakes hands with her. Assume that at last when the king gets back to the man he begins with, the queen goes around the table $a$ times. (ii) The queen shakes hands with the women one by one clockwise. Each time when the queen shakes hands with a woman, the king moves clockwise to her husband and shakes hands with him. Assume that at last when the queen gets back to the woman she begins with, the king goes around the table $b$ times. Determine the maximum possible value of $|a-b|$.

Let the decimal representations of numbers $A$ and $B$ be given as: $A = 0.a_1a_2\cdots a_k > 0$, $B = 0.b_1b_2\cdots b_k > 0$ (where $a_k, b_k$ can be 0), and let $S$ be the count of numbers $0.c_1c_2\cdots c_k$ such that $0.c_1c_2\cdots c_k < A$ and $0.c_kc_{k-1}\cdots c_1 < B$ ($c_k, c_1$ can also be 0). (Here, $0.c_1c_2\cdots c_r (c_r \neq 0)$ is considered the same as $0.c_1c_2\cdots c_r0\cdots0$). Prove: $\left| S - 10^k AB \right| \leq 9k.$

Six gamers play a round-robin tournament where each gamer plays one game against each of the other five gamers. In each game there is one winner and one loser where each player is equally likely to win that game, and the result of each game is independent of the results of the other games. The probability that the tournament will end with exactly one gamer scoring more wins than any other player is $\frac{m}{n}$ , where $m$ and $n$ are relatively prime positive integers. Find $m + n$.

In a regular 100-gon, 41 vertices are colored black and the remaining 59 vertices are colored white. Prove that there exist 24 convex quadrilaterals $Q_{1}, \ldots, Q_{24}$ whose corners are vertices of the 100-gon, so that [list] [*] the quadrilaterals $Q_{1}, \ldots, Q_{24}$ are pairwise disjoint, and [*] every quadrilateral $Q_{i}$ has three corners of one color and one corner of the other color. [/list]

For an integer $n\ge 3$ and a permutation $\sigma=(p_{1},p_{2},\cdots ,p_{n})$ of $\{1,2,\cdots , n\}$, we say $p_{l}$ is a $landmark$ point if $2\le l\le n-1$ and $(p_{l-1}-p_{l})(p_{l+1}-p_{l})>0$. For example , for $n=7$,\\ the permutation $(2,7,6,4,5,1,3)$ has four landmark points: $p_{2}=7$, $p_{4}=4$, $p_{5}=5$ and $p_{6}=1$. For a given $n\ge 3$ , let $L(n)$ denote the number of permutations of $\{1,2,\cdots ,n\}$ with exactly one landmark point. Find the maximum $n\ge 3$ for which $L(n)$ is a perfect square.