Prove that if for a positive integer $n$ is $5^n + 3^n + 1$ is prime number, then $n$ is divided by $12$.

Let $ a_0$, $ a_1$, $ a_2$, $ \ldots$ be a sequence of positive integers such that the greatest common divisor of any two consecutive terms is greater than the preceding term; in symbols, $ \gcd (a_i, a_{i \plus{} 1}) > a_{i \minus{} 1}$. Prove that $ a_n\ge 2^n$ for all $ n\ge 0$. [i]Proposed by Morteza Saghafian, Iran[/i]

Since this is the $6$th Greek Math Olympiad and the year is $1989$, can you find the last two digits of $6^{1989}$?

Let $n$ be a positive integer. Prove that there are no positive integers $x$ and $y$ such as $\sqrt{n}+\sqrt{n+1} < \sqrt{x}+\sqrt{y} <\sqrt{4n+2} $

For $a,n$ positive integers we show number of different integer 10-tuples $ (x_1,x_2,...,x_{10})$ on $ (mod n)$ satistfying $x_1x_2...x_{10}=a (mod n)$ with $f(a,n)$. Let $a,b$ given positive integers , a) Prove that there exist a positive integer $c$ such that for all $n\in \mathbb{Z^+}$ $$\frac {f(a,cn)}{f(b,cn)}$$is constant b) Find all $(a,b)$ pairs such that minumum possible value of $c$ is 27 where $c$ satisfying condition in $(a)$

Let $b$ be a real number randomly sepected from the interval $[-17,17]$. Then, $m$ and $n$ are two relatively prime positive integers such that $m/n$ is the probability that the equation \[x^4+25b^2=(4b^2-10b)x^2\] has $\textit{at least}$ two distinct real solutions. Find the value of $m+n$.

[u]Round 5[/u] [b]p13.[/b] The expression $\sqrt2 \times \sqrt[3]{3} \times \sqrt[6]{6}$ can be expressed as a single radical in the form $\sqrt[n]{m}$, where $m$ and $n$ are integers, and $n$ is as small as possible. What is the value of $m + n$? [b]p14.[/b] Bertie Bott also produces Bertie Bott’s Every Flavor Pez. Each package contains $6$ peppermint-, $2$ kumquat-, $3$ chili pepper-, and $5$ garlic-flavored candies in a random order. Harold opens a package and slips it into his Dumbledore-shaped Pez dispenser. What is the probability that of the first four candies, at least three are garlic-flavored? [b]p15.[/b] Quadrilateral $ABCD$ with $AB = BC = 1$ and $CD = DA = 2$ is circumscribed around and inscribed in two different circles. What is the area of the region between these circles? [u] Round 6[/u] [b]p16.[/b] Find all values of x that satisfy $\sqrt[3]{x^7} + \sqrt[3]{x^4} = \sqrt[3]{x}$. [b]p17.[/b] An octagon has vertices at $(2, 1)$, $(1, 2)$, $(-1, 2)$, $(-2, 1)$, $(-2, -1)$, $(-1, -2)$, $(1, -2)$, and $(2, -1)$. What is the minimum total area that must be cut off of the octagon so that the remaining figure is a regular octagon? [b]p18.[/b] Ron writes a $4$ digit number with no zeros. He tells Ronny that when he sums up all the two-digit numbers that are made by taking 2 consecutive digits of the number, he gets 99. He also reveals that his number is divisible by 8. What is the smallest possible number Ron could have written? [u]Round 7[/u] [b]p19.[/b] In a certain summer school, 30 kids enjoy geometry, 40 kids enjoy number theory, and 50 kids enjoy algebra. Also, the number of kids who only enjoy geometry is equal to the number of kids who only enjoy number theory and also equal to the number of kids who only enjoy algebra. What is the difference between the maximum and minimum possible numbers of kids who only enjoy geometry and algebra? [b]p20.[/b] A mouse is trying to run from the origin to a piece of cheese, located at $(4, 6)$, by traveling the shortest path possible along the lattice grid. However, on a lattice point within the region $\{0 \le x \le 4, 0 \le y \le 6$, $(x, y) \ne (0, 0),(4, 6)\}$ lies a rock through which the mouse cannot travel. The number of paths from which the mouse can choose depends on where the rock is placed. What is the difference between the maximum possible number of paths and the minimum possible number of paths available to the mouse? [b]p21.[/b] The nine points $(x, y)$ with $x, y \in \{-1, 0, 1\}$ are connected with horizontal and vertical segments to their nearest neighbors. Vikas starts at $(0, 1)$ and must travel to $(1, 0)$, $(0, -1)$, and $(-1, 0)$ in any order before returning to $(0, 1)$. However, he cannot travel to the origin $4$ times. If he wishes to travel the least distance possible throughout his journey, then how many possible paths can he take? [u]Round 8[/u] [b]p22.[/b] Let $g(x) = x^3 - x^2- 5x + 2$. If a, b, and c are the roots of g(x), then find the value of $((a + b)(b + c)(c + a))^3$. [b]p23.[/b] A regular octahedron composed of equilateral triangles of side length $1$ is contained within a larger tetrahedron such that the four faces of the tetrahedron coincide with four of the octahedron’s faces, none of which share an edge. What is the ratio of the volume of the octahedron to the volume of the tetrahedron? [b]p24.[/b] You are the lone soul at the south-west corner of a square within Elysium. Every turn, you have a $\frac13$ chance of remaining at your corner and a $\frac13$ chance of moving to each of the two closest corners. What is the probability that after four turns, you will have visited every corner at least once? PS. You should use hide for answers.Rounds 1-4 are [url=https://artofproblemsolving.com/community/c3h3134177p28401527]here [/url] and 9-12 [url=https://artofproblemsolving.com/community/c3h3134489p28406583]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Ana writes an infinite list of numbers using the following procedure. The first number of the list is a positive integer $a$ chosen by Ana. From there, each number in the list is obtained by calculating the sum of all the integers from $1$ to the last number written. For example, if $a = 3$, Ana's list starts as $3, 6, 21, 231, \dots$ because $1 + 2 + 3 = 6$, $1 + 2 + 3 + 4 + 5 + 6 = 21$ and $1 + 2 + 3 + \dots + 21 = 231$. Is it possible for all the numbers in Ana's list to be even?

Given a natural number $n$, prove that the number $M(n)$ of points with integer coordinates inside the circle $(O(0, 0),\sqrt{n})$ satisfies \[\pi n - 5\sqrt{n} + 1<M(n) < \pi n+ 4\sqrt{n} + 1\]

Will the number $1/1996$ decrease or increase and by how many times if in the decimal notation of this number the first non-zero digit after the decimal point is crossed out?

What is the smallest positive integer that when raised to the $6^{th}$ power, it can be represented by a sum of the $6^{th}$ powers of distinct smaller positive integers?

We say that a set $S$ of integers is [i]rootiful[/i] if, for any positive integer $n$ and any $a_0, a_1, \cdots, a_n \in S$, all integer roots of the polynomial $a_0+a_1x+\cdots+a_nx^n$ are also in $S$. Find all rootiful sets of integers that contain all numbers of the form $2^a - 2^b$ for positive integers $a$ and $b$.

Let $n \geq 2$ be a positive integer. For a positive integer $a$, let $Q_a(x)=x^n+ax$. Let $p$ be a prime and let $S_a=\{b | 0 \leq b \leq p-1, \exists c \in \mathbb {Z}, Q_a(c) \equiv b \pmod p \}$. Show that $\frac{1}{p-1}\sum_{a=1}^{p-1}|S_a|$ is an integer.

Find all prime numbers $p$ for which one can find a positive integer $m$ and nonnegative integers $a_0,a_1,...,a_m$ less than $p$ such that $$\begin{cases} a_0+a_1p+...+a_{m-1}p^{m-1}+a_{m}p^{m} = 2013 \\ a_0+a_1+...+a_{m-1}+a_{m} = 11\end{cases}$$

Find all positive integers $n$ and $p$ if $p$ is prime and \[ n^8 - p^5 = n^2+p^2 . \] [i]Adrian Stoica[/i]

[b]p1.[/b] The English alphabet consists of $21$ consonants and $5$ vowels. (We count $y$ as a consonant.) (a) Suppose that all the letters are listed in an arbitrary order. Prove that there must be $4$ consecutive consonants. (b) Give a list to show that there need not be $5$ consecutive consonants. (c) Suppose that all the letters are arranged in a circle. Prove that there must be $5$ consecutive consonants. [b]p2.[/b] From the set $\{1,2,3,... , n\}$, $k$ distinct integers are selected at random and arranged in numerical order (lowest to highest). Let $P(i, r, k, n)$ denote the probability that integer $i$ is in position $r$. For example, observe that $P(1, 2, k, n) = 0$. (a) Compute $P(2, 1,6,10)$. (b) Find a general formula for $P(i, r, k, n)$. [b]p3.[/b] (a) Write down a fourth degree polynomial $P(x)$ such that $P(1) = P(-1)$ but $P(2) \ne P(-2)$ (b) Write down a fifth degree polynomial $Q(x)$ such that $Q(1) = Q(-1)$ and $Q(2) = Q(-2)$ but $Q(3) \ne Q(-3)$. (c) Prove that, if a sixth degree polynomial $R(x)$ satisfies $R(1) = R(-1)$, $R(2) = R(-2)$, and $R(3) = R(-3)$, then $R(x) = R(-x)$ for all $x$. [b]p4.[/b] Given five distinct real numbers, one can compute the sums of any two, any three, any four, and all five numbers and then count the number $N$ of distinct values among these sums. (a) Give an example of five numbers yielding the smallest possible value of $N$. What is this value? (b) Give an example of five numbers yielding the largest possible value of $N$. What is this value? (c) Prove that the values of $N$ you obtained in (a) and (b) are the smallest and largest possible ones. [b]p5.[/b] Let $A_1A_2A_3$ be a triangle which is not a right triangle. Prove that there exist circles $C_1$, $C_2$, and $C_3$ such that $C_2$ is tangent to $C_3$ at $A_1$, $C_3$ is tangent to $C_1$ at $A_2$, and $C_1$ is tangent to $C_2$ at $A_3$. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Positive integers $m$ and $n$ satisfy $$(m + n)(24mn + 1) = 2023.$$ Find $m + n + 12mn$.

$100$ fractions are written on a board, their numerators are numbers from $1$ to $100$ (each once) and denominators are also numbers from $1$ to $100$ (also each once). It appears that the sum of these fractions equals to $a/2$ for some odd $a$. Prove that it is possible to interchange numerators of two fractions so that sum becomes a fraction with odd denominator. [i]N. Agakhanov, I. Bogdanov [/i]

A positive integer $N$ is written on a board. In a step, the last digit $c$ of the number on the board is erased, and after this, the remaining number $m$ is erased and replaced with $|m-3c|$ (for example, if the number $1204$ is on the board, after one step, we will replace it with $120 - 3 \cdot 4 = 108$). We repeat this until the number on the board has only one digit. Find all positive integers $N$ such that after a finite number of steps, the remaining one-digit number is $0$.

For a prime $p$, a subset $S$ of residues modulo $p$ is called a [i]sum-free multiplicative subgroup[/i] of $\mathbb F_p$ if $\bullet$ there is a nonzero residue $\alpha$ modulo $p$ such that $S = \left\{ 1, \alpha^1, \alpha^2, \dots \right\}$ (all considered mod $p$), and $\bullet$ there are no $a,b,c \in S$ (not necessarily distinct) such that $a+b \equiv c \pmod p$. Prove that for every integer $N$, there is a prime $p$ and a sum-free multiplicative subgroup $S$ of $\mathbb F_p$ such that $\left\lvert S \right\rvert \ge N$. [i]Proposed by Noga Alon and Jean Bourgain[/i]

[u]Round 1 [/u] [b]p1. [/b]Twelve people, some are knights and some are knaves, are sitting around a table. Knaves always lie and knights always tell the truth. At some point they start up a conversation. The first person says, “There are no knights around this table.” The second says, “There is at most one knight at this table.” The third – “There are at most two knights at the table.” And so on until the 12th says, “There are at most eleven knights at the table.” How many knights are at the table? Justify your answer. [b]p2.[/b] Show that in the sequence $10017$, $100117$, $1001117$, $...$ all numbers are divisible by $53$. [b]p3.[/b] Harry and Draco have three wands: a bamboo wand, a willow wand, and a cherry wand, all of the same length. They must perform a spell wherein they take turns picking a wand and breaking it into three parts – first Harry, then Draco, then Harry again. But in order for the spell to work, Harry has to make sure it is possible to form three triangles out of the pieces of the wands, where each triangle has a piece from each wand. How should he break the wands to ensure the success of the spell? [b]p4.[/b] A $2\times 2\times 2$ cube has $4$ equal squares on each face. The squares that share a side are called neighbors (thus, each square has $4$ neighbors – see picture). Is it possible to write an integer in each square in such a way that the sum of each number with its $4$ neighbors is equal to $13$? If yes, show how. If no, explain why not. [img]https://cdn.artofproblemsolving.com/attachments/8/4/0f7457f40be40398dee806d125ba26780f9d3a.png[/img] [b]p5.[/b] Two girls are playing a game. The first player writes the letters $A$ or $B$ in a row, left to right, adding one letter on her turn. The second player switches any two letters after each move by the first player (the letters do not have to be adjacent), or does nothing, which also counts as a move. The game is over when each player has made $2011$ moves. Can the second player plan her moves so that the resulting letters form a palindrome? (A palindrome is a sequence that reads the same forward and backwards, e.g. $AABABAA$.) [u]Round 2 [/u] [b]p6.[/b] A red square is placed on a table. $2010$ white squares, each the same size as the red square, are then placed on the table in such a way that the red square is fully covered and the sides of every white square are parallel to the sides of the red square. Is it always possible to remove one of the white squares so the red square remains completely covered? [b]p7.[/b] A computer starts with a given positive integer to which it randomly adds either $54$ or $77$ every second and prints the resulting sum after each addition. For example, if the computer is given the number $1$, then a possible output could be: $1$, $55$, $109$, $186$, $…$ Show that after finitely many seconds the computer will print a number whose last two digits are the same. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Determine the smallest positive integer containing only $0$ and $1$ as digits that is divisible by each integer $1$ through $9$.

Let $p$ and $q$ be integers. If $k^2+pk+q>0$ for every integer $k$, show that $x^2+px+q>0$ for every real number $x$.

$100$ numbers $1$, $1/2$, $1/3$, $...$, $1/100$ are written on the blackboard. One may delete two arbitrary numbers $a$ and $b$ among them and replace them by the number $a + b + ab$. After $99$ such operations only one number is left. What is this final number? (D. Fomin, Leningrad)

If ri are integers such that $0 \le r_i < 31$ and $r_i$ satisfies the polynomial $x^4 + x^3 + x^2 + x \equiv 30$ (mod $31$), find $$\sum^4_{i=1}(r^2_i + 1)^{-1} \,\,\,\, (mod \,\,\,\, 31)$$ where $x^{-1}$ is the modulo inverse of $x$, that is, it is the unique integer $y$ such that $0 < y < 31$ and $xy -1$ is divisible by $31$.