A prime $p$ and a positive integer $n$ are given. The product $$(1^3+1)(2^3+1)...((n-1)^3+1)(n^3+1)$$ is divisible by $p^3$. Prove that $p \leq n+1$. [i]Proposed by Z. Luria[/i]

[b]p1.[/b] Prove that the equation $x^6 - 143x^5 - 917x^4 + 51x^3 + 77x^2 + 291x + 1575 = 0$ has no integer solutions. [b]p2.[/b] There are $81$ wheels in a storage marked by their two types, say first and second type. Wheels of the same type weigh equally. Any wheel of the second type is much lighter than a wheel of the first type. It is known that exactly one wheel is marked incorrectly. Show that it can be detected with certainty after four measurements on a balance scale. [b]p3.[/b] Rob and Ann multiplied the numbers from $1$ to $100$ and calculated the sum of digits of this product. For this sum, Rob calculated the sum of its digits as well. Then Ann kept repeating this operation until he got a one-digit number. What was this number? [b]p4.[/b] Rui and Jui take turns placing bishops on the squares of the $ 8\times 8$ chessboard in such a way that bishops cannot attack one another. (In this game, the color of the rooks is irrelevant.) The player who cannot place a rook loses the game. Rui takes the first turn. Who has a winning strategy, and what is it? [b]p5.[/b] The following figure can be cut along sides of small squares into several (more than one) identical shapes. What is the smallest number of such identical shapes you can get? [img]https://cdn.artofproblemsolving.com/attachments/8/e/9cd09a04209774dab34bc7f989b79573453f35.png[/img] PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Prove that for all positive $a_1. a_2, ..., a_n$ the inequality $$\left( 1+\frac{a_1^2}{a_2}\right) \left( 1+\frac{a_2^2}{a_3}\right) ...\left( 1+\frac{a_n^2}{a_1}\right) \ge (1+a_1)(1+a_2)...(1+a_n)$$ holds. (LD Kurliandchik)

If $(1.0025)^{10}$ is evaluated correct to $5$ decimal places, then the digit in the fifth decimal place is $\textbf{(A) }0\qquad\textbf{(B) }1\qquad\textbf{(C) }2\qquad\textbf{(D) }5\qquad \textbf{(E) }8$

Let $n\geq 2$ be an integer. Alice and Bob play a game concerning a country made of $n$ islands. Exactly two of those $n$ islands have a factory. Initially there is no bridge in the country. Alice and Bob take turns in the following way. In each turn, the player must build a bridge between two different islands $I_1$ and $I_2$ such that: $\bullet$ $I_1$ and $I_2$ are not already connected by a bridge. $\bullet$ at least one of the two islands $I_1$ and $I_2$ is connected by a series of bridges to an island with a factory (or has a factory itself). (Indeed, access to a factory is needed for the construction.) As soon as a player builds a bridge that makes it possible to go from one factory to the other, this player loses the game. (Indeed, it triggers an industrial battle between both factories.) If Alice starts, then determine (for each $n\geq 2$) who has a winning strategy. ([i]Note:[/i] It is allowed to construct a bridge passing above another bridge.)

Let $ f(x) \equal{} \log_{10} (\sin (\pi x)\cdot\sin (2\pi x)\cdot\sin (3\pi x) \cdots \sin (8\pi x))$. The intersection of the domain of $ f(x)$ with the interval $ [0,1]$ is a union of $ n$ disjoint open intervals. What is $ n$? $ \textbf{(A)}\ 2 \qquad \textbf{(B)}\ 12 \qquad \textbf{(C)}\ 18 \qquad \textbf{(D)}\ 22 \qquad \textbf{(E)}\ 36$

Let $a$, $b$, $c$ be positive real numbers such that $ab+bc+ca\leq 3abc$. Prove that \[\sqrt{\frac{a^2+b^2}{a+b}}+\sqrt{\frac{b^2+c^2}{b+c}}+\sqrt{\frac{c^2+a^2}{c+a}}+3\leq \sqrt{2}\left(\sqrt{a+b}+\sqrt{b+c}+\sqrt{c+a}\right)\] [i]Proposed by Dzianis Pirshtuk, Belarus[/i]

Captain Jack and his pirate men plundered six chests of treasure $(A_1,A_2,A_3,A_4,A_5,A_6)$. Every chest $A_i$ contains $a_i$ coins of gold, and all $a_i$s are pairwise different $(i=1,2,\cdots ,6)$. They place all chests according to a layout (see the attachment) and start to alternately take out one chest a time between the captain and a pirate who serves as the delegate of the captain’s men. A rule must be complied with during the game: only those chests that are not adjacent to other two or more chests are allowed to be taken out. The captain will win the game if the coins of gold he obtains are not less than those of his men in the end. Let the captain be granted to take chest firstly, is there a certain strategy for him to secure his victory?

Given a sequence $x_1,x_2,x_3,\cdots$ of positive integers, Ali proceed the following algorythm: In the i-th step he markes all rational numbers in the interval $[0,1]$ which have denominator equal to $x_i$. Then he write down the number $a_i$ equal to the length of the smallest interval in $[0,1]$ which both two ends of that is a marked number. Find all sequences $x_1,x_2,x_3,\cdots$ with $x_5=5$ and such that for all $n\in \mathbb N$ we have $$ a_1+a_2+\cdots+a_n= 2-\dfrac{1}{x_n}. $$ Proposed by [i]Mojtaba Zare[/i]

There are $n$ teams in a football league. During a championship, every two teams play exactly one match, but no team can play more than one match in a week. At least, how many weeks are necessary for the championship to be held? Give an schedule for such a championship.

Let $A=(a_{ij})\in \mathcal{M}_p(\mathbb{C})$ such that $a_{12}=a_{23}=\ldots=a_{p-1,p}=1$ and $a_{ij}=0$ for any other entry. a)Prove that $A^{p-1}\neq O_p$ and $A^p=O_p$. b)If $X\in \mathcal{M}_{p}(\mathbb{C})$ and $AX=XA$, prove that there exist $a_1,a_2,\ldots,a_p\in \mathbb{C}$ such that: \[X=\left( \begin{array}{ccccc} a_1 & a_2 & a_3 & \ldots & a_p \\ 0 & a_1 & a_2 & \ldots & a_{p-1} \\ 0 & 0 & a_1 & \ldots & a_{p-2} \\ \ldots & \ldots & \ldots & \ldots & \ldots \\ 0 & 0 & 0 & \ldots & a_1 \end{array} \right)\] c)If there exist $B,C\in \mathcal{M}_p(\mathbb{C})$ such that $(I_p+A)^n=B^n+C^n,\ (\forall)n\in \mathbb{N}^*$, prove that $B=O_p$ or $C=O_p$.

Let $ABC$ be an acute angled triangle, $O$ be the circumcenter of $ABC$, and $R$ be the cicumradius. $AO$ meets the circumcircle of $BOC$ at $A'$, $BO$ meets the circumcircle of $COA$, and $CO$ meets the circumcircle of $AOB$ at $C'$. Prove that \[OA' \cdot OB' \cdot OC' \geq 8R^3.\] When does inequality occur?

Let $A$ be a finite set of positive numbers , $B=\{\frac{a+b}{c+d} |a,b,c,d \in A \}$. Show that: $\left | B \right | \ge 2\left | A \right |^2-1 $, where $|X| $ be the number of elements of the finite set $X$. (High School Affiliated to Nanjing Normal University )

Given three distinct positive integers such that one of them is the average of the two others. Can the product of these three integers be the perfect 2008th power of a positive integer?

Prove that for every positive integer n the number $(n^3 -n)(5^{8n+4} +3^{4n+2})$ is a multiple of $3804$.

Find all positive integers $ m,n $ that satisfy the equation \[ 3.2^m +1 = n^2 \]

Let $S$ be a set of $2020$ distinct points in the plane. Let \[M=\{P:P\text{ is the midpoint of }XY\text{ for some distinct points }X,Y\text{ in }S\}.\] Find the least possible value of the number of points in $M$.

Which species is polar? $ \textbf{(A) }\ce{CO2} \qquad\textbf{(B) }\ce{SO2}\qquad\textbf{(C) }\ce{SO3}\qquad\textbf{(D) }\ce{O2}\qquad $

In a sequence of natural numbers $ a_1,a_2,...,a_n$ every number $ a_k$ represents sum of the multiples of the $ k$ from sequence. Find all possible values for $ n$.

Given is an acute $\triangle ABC$ with orthocenter $H$. The point $H'$ is symmetric to $H$ over the side $AB$. Let $N$ be the intersection point of $HH'$ and $AB$. The circle passing through $A$, $N$ and $H'$ intersects $AC$ for the second time in $M$, and the circle passing through $B$, $N$ and $H'$ intersects $BC$ for the second time in $P$. Prove that $M$, $N$ and $P$ are collinear. [i]Proposed by Petar Filipovski[/i]

Let $a$ be rational and $b,c,d$ are real numbers, and let $f: \mathbb{R}\to [-1.1]$ be a function satisfying $f(x+a+b)-f(x+b)=c[x+2a+[x]-2[x+a]-[b]]+d$ for all $x$. Show that $f$ is periodic.

Richard comes across an infinite row of magic hats, $H_1, H_2, \dots$ each of which may contain a dollar bill with probabilities $p_1, p_2, \dots$. If Richard draws a dollar bill from $H_i$, then $p_{i+1} = p_i$, and if not, $p_{i+1}=\frac{1}{2}p_i$. If $p_1 = \frac{1}{2}$ and $E$ is the expected amount of money Richard makes from all the hats, compute $\lfloor 100E \rfloor$. [i]Proposed by Alex Li[/i]

Let $P_n = (19 + 92)(19^2 +92^2) \cdots(19^n +92^n)$ for each positive integer $n$. Determine, with proof, the least positive integer $m$, if it exists, for which $P_m$ is divisible by $33^{33}.$

There are $10$ birds on the ground. For any $5$ of them, there are at least $4$ birds on a circle. Determine the least possible number of birds on the circle with the most birds.

Let $f\left(x\right)=10^{10x}, g\left(x\right)=\log_{10}\left(\frac{x}{10}\right), h_1\left(x\right)=g\left(f\left(x\right)\right),$ and $h_n\left(x\right)=h_1\left(h_{n-1}\left(x\right)\right)$ for integers $n \ge 2$. What is the sum of the digits of $h_{2011}\left(1\right)$? $ \textbf{(A)}\ 16,081 \qquad \textbf{(B)}\ 16,089 \qquad \textbf{(C)}\ 18,089 \qquad \textbf{(D)}\ 18,098 \qquad \textbf{(E)}\ 18,099 $