Is it true that for any positive integer $n>1$, there exists an infinite arithmetic progression $M_n$ of positive integers, such that for any $m \in M_n$, the number $n^m-1$ is not a perfect power (a positive integer is a perfect power if it is of the form $a^b$ for positive integers $a, b>1$)?

You have two blackboards $A$ and $B$. You have to write on them some of the integers greater than or equal to $2$ and less than or equal to $20$ in such a way that each number on blackboard $A$ is co-prime with each number on blackboard $B.$ Determine the maximum possible value of multiplying the number of numbers written in $A$ by the number of numbers written in $B$.

Let $ABC$ be a triangle with $ \widehat{BAC}\neq 90^\circ $. Let $M$ be the midpoint of $BC$. We choose a variable point $D$ on $AM$. Let $(O_1)$ and $(O_2)$ be two circle pass through $ D$ and tangent to $BC$ at $B$ and $C$. The line $BA$ and $CA$ intersect $(O_1),(O_2)$ at $ P,Q$ respectively. [b]a)[/b] Prove that tangent line at $P$ on $(O_1)$ and $Q$ on $(O_2)$ must intersect at $S$. [b]b)[/b] Prove that $S$ lies on a fix line.

2008 persons take part in a programming contest. In one round, the 2008 programmers are divided into two groups. Find the minimum number of groups such that every two programmers ever be in the same group.

All points in a $100 \times 100$ array are colored in one of four colors red, green, blue or yellow in such a way that there are $25$ points of each color in each row and in any column. Prove that there are two rows and two columns such that their four intersection points are all in different colors.

Let $n$ be the answer to this problem. Hexagon $ABCDEF$ is inscribed in a circle of radius $90$. The area of $ABCDEF$ is $8n$, $AB = BC = DE = EF$, and $CD = FA$. Find the area of triangle $ABC$:

A soccer team has 22 available players. A fixed set of 11 players starts the game, while the other 11 are available as substitutes. During the game, the coach may make as many as 3 substitutions, where any one of the 11 players in the game is replaced by one of the substitutes. No player removed from the game may reenter the game, although a substitute entering the game may be replaced later. No two substitutions can happen at the same time. The players involved and the order of the substitutions matter. Let $n$ be the number of ways the coach can make substitutions during the game (including the possibility of making no substitutions). Find the remainder when $n$ is divided by 1000.

Determine all pairs of natural numbers, the components of which have the same number of digits and the double of their product is equal with the number formed by concatenating them.

Find all triples of real numbers $(x, y,z)$ such that $$\begin{cases} x^4 + y^2 + 4 = 5yz \\ y^4 + z^2 + 4 = 5zx \\ z^4 + x^2 + 4 = 5xy\end{cases}$$

Consider $f (n, m)$ the number of finite sequences of $ 1$'s and $0$'s such that each sequence that starts at $0$, has exactly n $0$'s and $m$ $ 1$'s, and there are not three consecutive $0$'s or three $ 1$'s. Show that if $m, n> 1$, then $$f (n, m) = f (n-1, m-1) + f (n-1, m-2) + f (n-2, m-1) + f (n-2, m-2)$$

[b]p1.[/b] Consider a $4 \times 4$ lattice on the coordinate plane. At $(0,0)$ is Mori’s house, and at $(4,4)$ is Mori’s workplace. Every morning, Mori goes to work by choosing a path going up and right along the roads on the lattice. Recently, the intersection at $(2, 2)$ was closed. How many ways are there now for Mori to go to work? [b]p2.[/b] Given two integers, define an operation $*$ such that if a and b are integers, then a $*$ b is an integer. The operation $*$ has the following properties: 1. $a * a$ = 0 for all integers $a$. 2. $(ka + b) * a = b * a$ for integers $a, b, k$. 3. $0 \le b * a < a$. 4. If $0 \le b < a$, then $b * a = b$. Find $2017 * 16$. [b]p3.[/b] Let $ABC$ be a triangle with side lengths $AB = 13$, $BC = 14$, $CA = 15$. Let $A'$, $B'$, $C'$, be the midpoints of $BC$, $CA$, and $AB$, respectively. What is the ratio of the area of triangle $ABC$ to the area of triangle $A'B'C'$? [b]p4.[/b] In a strange world, each orange has a label, a number from $0$ to $10$ inclusive, and there are an infinite number of oranges of each label. Oranges with the same label are considered indistinguishable. Sally has 3 boxes, and randomly puts oranges in her boxes such that (a) If she puts an orange labelled a in a box (where a is any number from 0 to 10), she cannot put any other oranges labelled a in that box. (b) If any two boxes contain an orange that have the same labelling, the third box must also contain an orange with that labelling. (c) The three boxes collectively contain all types of oranges (oranges of any label). The number of possible ways Sally can put oranges in her $3$ boxes is $N$, which can be written as the product of primes: $$p_1^{e_1} p_2^{e_2}... p_k^{e_k}$$ where $p_1 \ne p_2 \ne p_3 ... \ne p_k$ and $p_i$ are all primes and $e_i$ are all positive integers. What is the sum $e_1 + e_2 + e_3 +...+ e_k$? [b]p5.[/b] Suppose I want to stack $2017$ identical boxes. After placing the first box, every subsequent box must either be placed on top of another one or begin a new stack to the right of the rightmost pile. How many different ways can I stack the boxes, if the order I stack them doesn’t matter? Express your answer as $$p_1^{e_1} p_2^{e_2}... p_n^{e_n}$$ where $p_1, p_2, p_3, ... , p_n$ are distinct primes and $e_i$ are all positive integers. PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Point $X$ is taken inside a regular $n$-gon of side length $a$. Let $h_1,h_2,...,h_n$ be the distances from $X$ to the lines defined by the sides of the $n$-gon. Prove that $\frac{1}{h_1}+\frac{1}{h_2}+...+\frac{1}{h_n}>\frac{2\pi}{a}$

Given is a rectangular plane coordinate system. (a) Prove that it is impossible to find an equilateral triangle whose vertices have integer coordinates. (b) In the plane the vertices $A, B$ and $C$ lie with integer coordinates in such a way that $AB = AC$. Prove that $\frac{d(A,BC)}{BC}$ is rational.

Consider a rectangle $ABCD$ with $AB = a$ and $AD = b.$ Let $l$ be a line through $O,$ the center of the rectangle, that cuts $AD$ in $E$ such that $AE/ED = 1/2$. Let $M$ be any point on $l,$ interior to the rectangle. Find the necessary and sufficient condition on $a$ and $b$ that the four distances from M to lines $AD, AB, DC, BC$ in this order form an arithmetic progression.

In $\triangle ABC$, angle $B$ is obtuse, $AB = 42$ and $BC = 69$. Let $M$ and $N$ be the midpoints of $AB$ and $BC$, respectively. The angle bisectors of $\angle CAB$ and $\angle ABC$ meet $BC$ and $CA$ at $D$ and $E$ respectively. Let $X$ and $Y$ be the midpoints of $AD$ and $AN$ respectively. Let $CY$ and $BX$ meet $AB$ and $CA$ at $P$ and $Q$. If $EM$ and $PQ$ meet on $BC$, find $CA$. [i]Proposed by Sid Doppalapudi[/i]

Determine the greatest possible value of $\sum_{i = 1}^{10} \cos(3x_i)$ for real numbers $x_1, x_2, \dots, x_{10}$ satisfying $\sum_{i = 1}^{10} \cos(x_i) = 0$.

Find all functions $f: \mathbb{Z}\to \mathbb{Z}$ such that for all $m,n\in \mathbb{Z}$: \[f(m+f(n)) = f(m)+n.\]

Find the number of $6$-tuples $(A_1,A_2,...,A_6)$ of subsets of $M = \{1,..., n\}$ (not necessarily different) such that each element of $M$ belongs to zero, three, or six of the subsets $A_1,...,A_6$.

Ten localities are served by two international airlines such that there exists a direct service (without stops) between any two of these localities and all airline schedules offer round-trip service between the cities they serve. Prove that at least one of the airlines can offer two disjoint round trips each containing an odd number of landings.

Find all positive integers $n$ for which both numbers \[1\;\;\!\!\!\!\underbrace{77\ldots 7}_{\text{$n$ sevens}}\!\!\!\!\quad\text{and}\quad 3\;\; \!\!\!\!\underbrace{77\ldots 7}_{\text{$n$ sevens}}\] are prime.

$N> 4$ points move around the circle, each with a constant speed. For Any four of them have a moment in time when they all meet. Prove that is the moment when all the points meet.

One hundred million cities lie on Planet MO. Initially, there are no air routes between any two cities. Now an airline company comes. It plans to establish $5050$ two-way routes, each route connects two different cities, and no two routes connect the same two cities. The "degree" of a city is defined to be the number of routes departing from that city. The "benefit" of a route is the product of the "degrees" of the two cities it connects. Find the maximum possible value of the sum of the benefits of these $5050$ routes.

Let $f(x)=x^2-2x+1.$ For some constant $k, f(x+k) = x^2+2x+1$ for all real numbers $x.$ Determine the value of $k.$

Does there exist a nonzero polynomial $P(x)$ with integer coefficients satisfying both of the following conditions? [list] [*]$P(x)$ has no rational root; [*]For every positive integer $n$, there exists an integer $m$ such that $n$ divides $P(m)$. [/list]

Let $m$ and $n$ be positive integers. Mr. Fat has a set $S$ containing every rectangular tile with integer side lengths and area of a power of $2$. Mr. Fat also has a rectangle $R$ with dimensions $2^m \times 2^n$ and a $1 \times 1$ square removed from one of the corners. Mr. Fat wants to choose $m + n$ rectangles from $S$, with respective areas $2^0, 2^1, \ldots, 2^{m + n - 1}$, and then tile $R$ with the chosen rectangles. Prove that this can be done in at most $(m + n)!$ ways. [i]Palmer Mebane.[/i]