Let $a\equiv 1\pmod{4}$ be a positive integer. Show that any polynomial $Q\in\mathbb{Z}[X]$ with all positive coefficients such that $$Q(n+1)((a+1)^{Q(n)}-a^{Q(n)})$$ is a perfect square for any $n\in\mathbb{N}^{\ast}$ must be a constant polynomial. [i]Proposed by Vlad Matei, Romania[/i]

A positive integer $a$ is said to [i]reduce[/i] to a positive integer $b$ if when dividing $a$ by its units digits the result is $b$. For example, 2015 reduces to $\frac{2015}{5} = 403$. Find all the positive integers that become 1 after some amount of reductions. For example, 12 is one such number because 12 reduces to 6 and 6 reduces to 1.

Bunbury the bunny is hopping on the positive integers. First, he is told a positive integer $n$. Then Bunbury chooses positive integers $a,d$ and hops on all of the spaces $a,a+d,a+2d,\dots,a+2013d$. However, Bunbury must make these choices so that the number of every space that he hops on is less than $n$ and relatively prime to $n$. A positive integer $n$ is called [i]bunny-unfriendly[/i] if, when given that $n$, Bunbury is unable to find positive integers $a,d$ that allow him to perform the hops he wants. Find the maximum bunny-unfriendly integer, or prove that no such maximum exists.

On a circle there are $99$ natural numbers. If $a,b$ are any two neighbouring numbers on the circle, then $a-b$ is equal to $1$ or $2$ or $ \frac{a}{b}=2 $. Prove that there exists a natural number on the circle that is divisible by $3$. [i]S. Berlov[/i]

Given a prime $p>3$ and an odd integer $n>0$, show that the equation $$xyz=p^n(x+y+z)$$ has at least $3(n+1)$ different solutions up to symmetry. (That is, if $(x',y',z')$ is a solution and $(x'',y'',z'')$ is a permutation of the previous, they are considered to be the same solution.)

Let $a, b, c, d$, and $e$ be positive integers such that $a\le b\le c\le d\le e$ and that $a+b+c+d+e=1002$. a) Determine the largest possible value of $a+c+e$. b) Determine the lowest possible value of $a+c+e$.

Find all positive integers $n$ such that the number $A_n =\frac{ 2^{4n+2}+1}{65}$ is a) an integer, b) a prime.

Is there any numbber $n$, such that the sum of its digits in the decimal notation is $1000$, and the sum of its square digits in the decimal notation is $1000000$?

Let $\mathcal{S}$ be a set consisting of $n \ge 3$ positive integers, none of which is a sum of two other distinct members of $\mathcal{S}$. Prove that the elements of $\mathcal{S}$ may be ordered as $a_1, a_2, \dots, a_n$ so that $a_i$ does not divide $a_{i - 1} + a_{i + 1}$ for all $i = 2, 3, \dots, n - 1$.

Prove that the product of four consecutive natural numbers can not be neither square nor perfect cube.

Let $f : N \to [0, \infty)$ be a function satisfying the following conditions: a) $f(4)=2$ b) $\frac{1}{f( 0 ) + f( 1)} + \frac{1}{f( 1 ) + f( 2 )} + ... + \frac{1}{f (n ) + f(n + 1) }= f ( n + 1)$ for all integers $n \ge 0$. Find $f(n)$ in closed form.

Let $S={1,2,\ldots,100}$. Consider a partition of $S$ into $S_1,S_2,\ldots,S_n$ for some $n$, i.e. $S_i$ are nonempty, pairwise disjoint and $\displaystyle S=\bigcup_{i=1}^n S_i$. Let $a_i$ be the average of elements of the set $S_i$. Define the score of this partition by \[\dfrac{a_1+a_2+\ldots+a_n}{n}.\] Among all $n$ and partitions of $S$, determine the minimum possible score.

In an infinite arithmetic progression of positive integers there are two integers with the same sum of digits. Will there necessarily be one more integer in the progression with the same sum of digits? [i]Proposed by A. Shapovalov[/i]

Find all polynomials with integer coefficients $P$ such that for all positive integers $n$, the sequence $$0, P(0), P(P(0)), \cdots$$ is eventually constant modulo $n$. [i]Proposed by Ivan Chan Kai Chin[/i]

[b]p1.[/b] $17$ rooks are placed on an $8\times 8$ chess board. Prove that there must be at least one rook that is attacking at least $2$ other rooks. [b]p2.[/b] In New Scotland there are three kinds of coins: $1$ cent, $6$ cent, and $36$ cent coins. Josh has $99$ of the $36$-cent coins (and no other coins). He is allowed to exchange a $36$ cent coin for $6$ coins of $6$ cents, and to exchange a $6$ cent coin for $6$ coins of $1$ cent. Is it possible that after several exchanges Josh will have $500$ coins? [b]p3.[/b] Find all solutions $a, b, c, d, e, f, g, h, i$ if these letters represent distinct digits and the following multiplication is correct: $\begin{tabular}{ccccc} & & a & b & c \\ x & & & d & e \\ \hline & f & a & c & c \\ + & g & h & i & \\ \hline f & f & f & c & c \\ \end{tabular}$ [b]p4.[/b] Pinocchio rode a bicycle for $3.5$ hours. During every $1$-hour period he went exactly $5$ km. Is it true that his average speed for the trip was $5$ km/h? Explain your reasoning. [b]p5.[/b] Let $a, b, c$ be odd integers. Prove that the equation $ax^2 + bx + c = 0$ cannot have a rational solution. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

An integer $n>2$ is called [i]tasty[/i] if for every ordered pair of positive integers $(a,b)$ with $a+b=n,$ at least one of $\frac{a}{b}$ and $\frac{b}{a}$ is a terminating decimal. Do there exist infinitely many tasty integers? [i]Proposed by Vincent Huang[/i]

find all solutions, not necessarily positive integers for $(m^2+ n)(m+ n^2)= (m+ n)^3$

Prove that if $n$ is a positive integer such that the equation \[ x^3-3xy^2+y^3=n \] has a solution in integers $x,y$, then it has at least three such solutions. Show that the equation has no solutions in integers for $n=2891$.

Let $p>5$ be a prime number. Prove that the sum \[\left(\frac{(p-1)!}{1}\right)^p+\left(\frac{(p-1)!}{2}\right)^p+\cdots+\left(\frac{(p-1)!}{p-1}\right)^p\]is divisible by $p^3$.

Find all triples $(a,b,p)$ of positive integers with $p$ prime and \[ a^p=b!+p. \]

Do there exist prime numbers $p$ and $q$ such that $p^2(p^3-1)=q(q+1)$ ?

For the positive integers $x , y$ and $z$ apply $\frac{1}{x}+\frac{1}{y}=\frac{1}{z}$ . Prove that if the three numbers $x , y,$ and $z$ have no common divisor greater than $1$, $x + y$ is the square of an integer.

Find all all positive integers x,y,and z satisfying the equation $x^3=3^y7^z+8$

Find the average of the quantity \[(a_1 - a_2)^2 + (a_2 - a_3)^2 +\cdots + (a_{n-1} -a_n)^2\] taken over all permutations $(a_1, a_2, \dots , a_n)$ of $(1, 2, \dots , n).$

Prove that, among $100000$ consecutive $100$-digit positive integers, there is an integer $n$ such that the length of the period of the decimal expansion of $\frac1n$ is greater than $2011$.