Let $n$ be an odd positive integer bigger than $1$. Prove that $3^n+1$ is not divisible with $n$

Let $a_{i}$ and $b_{i}$ ($i=1,2, \cdots, n$) be rational numbers such that for any real number $x$ there is: \[x^{2}+x+4=\sum_{i=1}^{n}(a_{i}x+b)^{2}\] Find the least possible value of $n$.

Let $n$ be a positive integer. Navinim writes down all positive square numbers that divide $n$ on a blackboard. For each number $k$ on the blackboard, Navagem replaces it with $d(k)$. Show that the sum of all numbers on the blackboard now is a perfect square. (Note: $d(k)$ denotes the number of divisors of $k$.) [i](Proposed by Ivan Chan Guan Yu)[/i]

Find all non-negative solutions to the equation $2013^x+2014^y=2015^z$

Prove that among $20$ consecutive positive integers there is an integer $d$ such that for every positive integer $n$ the following inequality holds $$n \sqrt{d} \left\{n \sqrt {d} \right \} > \dfrac{5}{2}$$ where by $\left \{x \right \}$ denotes the fractional part of the real number $x$. The fractional part of the real number $x$ is defined as the difference between the largest integer that is less than or equal to $x$ to the actual number $x$. [i](Serbia)[/i]

Let $M$ be a subset of $\mathbb{R}$ such that the following conditions are satisfied: a) For any $x \in M, n \in \mathbb{Z}$, one has that $x+n \in \mathbb{M}$. b) For any $x \in M$, one has that $-x \in M$. c) Both $M$ and $\mathbb{R}$ \ $M$ contain an interval of length larger than $0$. For any real $x$, let $M(x) = \{ n \in \mathbb{Z}^{+} | nx \in M \}$. Show that if $\alpha,\beta$ are reals such that $M(\alpha) = M(\beta)$, then we must have one of $\alpha + \beta$ and $\alpha - \beta$ to be rational.

Let $S$ be the set of integers that can be written in the form $50m + 3n$ where $m$ and $n$ are non-negative integers. For example $3, 50, 53$ are all in $S$. Find the sum of all positive integers not in $S$.

Show that the GCD of three consecutive triangular numbers is 1.

Find all positive integers $n,k$ satisfying: $$ n^3 -5n+10 =2^k $$

Let $a$ and $b$ be randomly selected three-digit integers and suppose $a > b$. We say that $a$ is [i]clearly bigger[/i] than $b$ if each digit of $a$ is larger than the corresponding digit of $b$. If the probability that $a$ is clearly bigger than $b$ is $\tfrac mn$, where $m$ and $n$ are relatively prime integers, compute $m+n$. [i]Proposed by Evan Chen[/i]

Find all triples of positive integer $(m,n,k)$ such that $ k^m|m^n-1$ and $ k^n|n^m-1$

Let $n \ge 2$ be an integer, and let $A_n$ be the set \[A_n = \{2^n - 2^k\mid k \in \mathbb{Z},\, 0 \le k < n\}.\] Determine the largest positive integer that cannot be written as the sum of one or more (not necessarily distinct) elements of $A_n$ . [i]Proposed by Serbia[/i]

If $n$ and $n^3+2n^2+2n+4$ are both perfect squares, find $n$.

Find all polynomials $f$ with non-negative integer coefficients such that for all primes $p$ and positive integers $n$ there exist a prime $q$ and a positive integer $m$ such that $f(p^n)=q^m$.

[b]p1. [/b](a) Show that for every positive integer $m > 1$, there are positive integers $x$ and $y$ such that $x^2 - y^2 = m^3$. (b) Find all pairs of positive integers $(x, y)$ such that $x^6 = y^2 + 127$. [b]p2.[/b] (a) Let $P(x)$ be a polynomial with integer coefficients. Suppose that $P(0)$ is an odd integer and that $P(1)$ is also an odd integer. Show that if $c$ is an integer then $P(c)$ is not equal to $0$. (b) Let P(x) be a polynomial with integer coefficients. Suppose that $P(1,000) = 1,000$ and $P(2,000) = 2,000.$ Explain why $P(3,000)$ cannot be equal to $1,000$. [b]p3.[/b] Triangle $\vartriangle ABC$ is created from points $A(0, 0)$, $B(1, 0)$ and $C(1/2, 2)$. Let $q, r$, and $s$ be numbers such that $0 < q < 1/2 < s < 1$, and $q < r < s$. Let D be the point on $AC$ which has $x$-coordinate $q$, $E$ be the point on AB which has $x$-coordinate $r$, and $F$ be the point on $BC$ that has $x$-coordinate $s$. (a) Find the area of triangle $\vartriangle DEF$ in terms of $q, r$, and $s$. (b) If $r = 1/2$, prove that at least one of the triangles $\vartriangle ADE$, $\vartriangle CDF$, or $\vartriangle BEF$ has an area of at least $1/4$. [b]p4.[/b] In the Gregorian calendar: (i) years not divisible by $4$ are common years, (ii) years divisible by $4$ but not by $100$ are leap years, (iii) years divisible by $100$ but not by $400$ are common years, (iv) years divisible by $400$ are leap years, (v) a leap year contains $366$ days, a common year $365$ days. From the information above: (a) Find the number of common years and leap years in $400$ consecutive Gregorian years. Show that $400$ consecutive Gregorian years consists of an integral number of weeks. (b) Prove that the probability that Christmas falls on a Wednesday is not equal to $1/7$. [b]p5.[/b] Each of the first $13$ letters of the alphabet is written on the back of a card and the $13$ cards are placed in a row in the order $$A,B,C,D,E, F, G,H, I, J,K, L,M$$ The cards are then turned over so that the letters are face down. The cards are rearranged and again placed in a row, but of course they may be in a different order. They are rearranged and placed in a row a second time and both rearrangements were performed exactly the same way. When the cards are turned over the letters are in the order $$B,M, A,H, G,C, F,E,D, L, I,K, J$$ What was the order of the letters after the cards were rearranged the first time? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Prove that for each positive integer $m$, one can find $m$ consecutive positive integers like $n$ such that the following phrase doesn't be a perfect power: $$\left(1^3+2018^3\right)\left(2^3+2018^3\right)\cdots \left(n^3+2018^3\right)$$ [i]Proposed by Navid Safaei[/i]

Let $p,q$ be integers such that the polynomial $x^2+px+q+1$ has two positive integer roots. Show that $p^2+q^2$ is composite.

Given a positive integer $a$, prove that $\sigma(am) < \sigma(am + 1)$ for infinitely many positive integers $m$. (Here $\sigma(n)$ is the sum of all positive divisors of the positive integer number $n$.) [i]Vlad Matei[/i]

Determine all functions $f: \mathbb {N} \to \mathbb {N}$ such that $n!\hspace{1mm} +\hspace{1mm} f(m)!\hspace{1mm} |\hspace{1mm} f(n)!\hspace{1mm} +\hspace{1mm} f(m!)$, for all $m$, $n$ $\in$ $\mathbb{N}$.

Determine all $n \geq 3$ for which there are $n$ positive integers $a_1, \cdots , a_n$ any two of which have a common divisor greater than $1$, but any three of which are coprime. Assuming that, moreover, the numbers $a_i$ are less than $5000$, find the greatest possible $n$.

A number $n$ is said to be [i]nice[/i] if it exists an integer $r>0$ such that the expression of $n$ in base $r$ has all its digits equal. For example, 62 and 15 are $\emph{nice}$ because 62 is 222 in base 5, and 15 is 33 in base 4. Show that 1993 is not [i]nice[/i], but 1994 is.

Find all prime numbers $p$ and $q$ such that $$1 + \frac{p^q - q^p}{p + q}$$ is a prime number. [i]Proposed by Dorlir Ahmeti, Albania[/i]

Let $\{ a_n\}$ be a series consisting of positive integers such that $n^2 \mid \sum_{i=1}^{n}{a_i}$ and $a_n\leq (n+2016)^2$ for all $n\geq 2016$. Define $b_n=a_{n+1}-a_n$. Prove that the series $\{ b_n\}$ is eventually constant.

We define the sequence $a_n=(2n)^2+1$ for each natural number $n$. We will call one number [i]bad[/i], if there don’t exist natural numbers $a>1$ and $b>1$ such that $a_n=a^2+b^2$. Prove that the natural number $n$ is [i]bad[/i], if and only if $a_n$ is prime.

[u]Round 1[/u] [b]p1.[/b] Three snails – Alice, Bobby, and Cindy – were racing down a road. Whenever one snail passed another, it waved at the snail it passed. During the race, Alice waved $3$ times and was waved at twice. Bobby waved $4$ times and was waved at $3$ times. Cindy waved $5$ times. How many times was she waved at? [b]p2.[/b] Sherlock and Mycroft are playing Battleship on a $4\times 4$ grid. Mycroft hides a single $3\times 1$ cruiser somewhere on the board. Sherlock can pick squares on the grid and fire upon them. What is the smallest number of shots Sherlock has to fire to guarantee at least one hit on the cruiser? [b]p3.[/b] Thirty girls – $13$ of them in red dresses and $17$ in blue dresses – were dancing in a circle, hand-in-hand. Afterwards, each girl was asked if the girl to her right was in a blue dress. Only the girls who had both neighbors in red dresses or both in blue dresses told the truth. How many girls could have answered “Yes”? [b]p4.[/b] Herman and Alex play a game on a $5\times 5$ board. On his turn, a player can claim any open square as his territory. Once all the squares are claimed, the winner is the player whose territory has the longer border. Herman goes first. If both play their best, who will win, or will the game end in a draw? [img]https://cdn.artofproblemsolving.com/attachments/5/7/113d54f2217a39bac622899d3d3eb51ec34f1f.png[/img] [b]p5.[/b] Is it possible to find $2014$ distinct positive integers whose sum is divisible by each of them? [u]Round 2[/u] [b]p6.[/b] Hermione and Ron play a game that starts with 129 hats arranged in a circle. They take turns magically transforming the hats into animals. On each turn, a player picks a hat and chooses whether to change it into a badger or into a raven. A player loses if after his or her turn there are two animals of the same species right next to each other. Hermione goes first. Who loses? [b]p7.[/b] Three warring states control the corner provinces of the island whose map is shown below. [img]https://cdn.artofproblemsolving.com/attachments/e/a/4e2f436be1dcd3f899aa34145356f8c66cda82.png[/img] As a result of war, each of the remaining $18$ provinces was occupied by one of the states. None of the states was able to occupy any province on the coast opposite their corner. The states would like to sign a peace treaty. To do this, they each must send ambassadors to a place where three provinces, one controlled by each state, come together. Prove that they can always find such a place to meet. For example, if the provinces are occupied as shown here, the squares mark possible meeting spots. [img]https://cdn.artofproblemsolving.com/attachments/e/b/81de9187951822120fc26024c1c1fbe2138737.png[/img] PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].