Prove that there is a unique function $f: N\to N$, that verifies $$f(a + b)f(a - b) = f(a^2)$$, for any $a, b\in N$ such that $a > b$.

Fine all positive integers $m,n\geq 2$, such that (1) $m+1$ is a prime number of type $4k-1$; (2) there is a (positive) prime number $p$ and nonnegative integer $a$, such that \[\frac{m^{2^n-1}-1}{m-1}=m^n+p^a.\]

A set $A$ contains $956$ natural numbers between $1$ and $2014$, inclusive. Prove that in the set $A$ there are two numbers $a$ and $b$ such that $a + b$ is divided by $19$.

Let $n$ be a positive integer such that the sum of its positive divisors is at least $2022n$. Prove that $n$ has at least $2022$ distinct prime factors.

For a given odd prime number $p$, define $f(n)$ the remainder of $d$ divided by $p$, where $d$ is the biggest divisor of $n$ which is not a multiple of $p$. For example when $p=5$, $f(6)=1, f(35)=2, f(75)=3$. Define the sequence $a_1, a_2, \ldots, a_n, \ldots$ of integers as the followings: [list] [*]$a_1=1$ [*]$a_{n+1}=a_n+(-1)^{f(n)+1}$ for all positive integers $n$. [/list] Determine all integers $m$, such that there exist infinitely many positive integers $k$ such that $m=a_k$.

[b](a)[/b] Does there exist a positive integer $n$ such that the decimal representation of $n!$ ends with the string $2004$, followed by a number of digits from the set $\left\{0;\;4\right\}$ ? [b](b)[/b] Does there exist a positive integer $n$ such that the decimal representation of $n!$ starts with the string $2004$ ?

Let $a$, $b$, $c$ be positive integers and $p$ be a prime number. Assume that \[ a^n(b+c)+b^n(a+c)+c^n(a+b)\equiv 8\pmod{p} \] for each nonnegative integer $n$. Let $m$ be the remainder when $a^p+b^p+c^p$ is divided by $p$, and $k$ the remainder when $m^p$ is divided by $p^4$. Find the maximum possible value of $k$. [i]Proposed by Justin Stevens and Evan Chen[/i]

Denote $\textrm{SL}_2 (\mathbb{Z})$ and $\textrm{SL}_3 (\mathbb{Z})$ the sets of matrices with $2$ rows and $2$ columns, respectively with $3$ rows and $3$ columns, with integer entries and their determinant equal to $1$. $\textbf{(a)}$ Let $N$ be a positive integer and let $g$ be a matrix with $3$ rows and $3$ columns, with rational entries. Suppose that for each positive divisor $M$ of $N$ there exists a rational number $q_M$, a positive divisor $f (M)$ of $N$ and a matrix $\gamma_M \in \textrm{SL}_3 (\mathbb{Z})$ such that \[ g = q_M \left(\begin{array}{ccc} 1 & 0 & 0\\ 0 & 1 & 0\\ 0 & 0 & f (M) \end{array}\right) \gamma_M \left(\begin{array}{ccc} 1 & 0 & 0\\ 0 & 1 & 0\\ 0 & 0 & M^{} \end{array}\right) . \] Moreover, if $q_1 = 1$, prove that $\det (g) = N$ and $g$ has the following shape: \[ g = \left(\begin{array}{ccc} a_{11} & a_{12} & Na_{13}\\ a_{21} & a_{22} & Na_{23}\\ Na_{31} & Na_{32} & Na_{33} \end{array}\right), \] where $a_{ij}$ are all integers, $i, j \in \{ 1, 2, 3 \} .$ $\textbf{(b)}$ Provide an example of a matrix $g$ with $2$ rows and $2$ columns which satisfies the following properties: $\bullet$ For each positive divisor $M$ of $6$ there exists a rational number $q_M$, a positive divisor $f (M)$ of $6$ and a matrix $\gamma_M \in \textrm{SL}_2 (\mathbb{Z})$ such that \[ g = q_M \left(\begin{array}{cc} 1 & 0\\ 0 & f (M) \end{array}\right) \gamma_M \left(\begin{array}{cc} 1 & 0\\ 0 & M^{} \end{array}\right) \] and $q_1 = 1$. $\bullet$ $g$ does not have its determinant equal to $6$ and is not of the shape \[ g = \left(\begin{array}{cc} a_{22} & 6 a_{23}\\ 6 a_{32} & 6 a_{33} \end{array}\right), \] where $a_{ij}$ are all positive integers, $i, j \in \{ 2, 3 \}$. [i](Radu Toma)[/i]

Prove that $n^4 + 4^{n}$ is composite for all values of $n$ greater than $1$.

Prove that the equation \[ x^z + y^z = z^z \] has no solutions in postive integers.

Let $N_0$ be the set of all non-negative integers. Let $f : N_0 \times N_0 \to N_0$ be a function such that for all non-negative integers $a,b$: $$f(a,b) = f(b,a),$$ $$f(a,0) = 0,$$ $$f(a+b,b) = f(a,b) +b.$$ Compute $$\sum_{i=0}^{30}\sum_{j=0}^{2^i-1}f(2^i, j)$$

Find the largest integer $n \ge 3$ for which there is a $n$-digit number $\overline{a_1a_2a_3...a_n}$ with non-zero digits $a_1, a_2$ and $a_n$, which is divisible by $\overline{a_2a_3...a_n}$.

Given positive odd integers $m$ and $n$ where the set of all prime factors of $m$ is the same as the set of all prime factors $n$, and $n \vert m$. Let $a$ be an arbitrary integer which is relatively prime to $m$ and $n$. Prove that: \[ o_m(a) = o_n(a) \times \frac{m}{\gcd(m, a^{o_n(a)}-1)} \] where $o_k(a)$ denotes the smallest positive integer such that $a^{o_k(a)} \equiv 1$ (mod $k$) holds for some natural number $k > 1$.

How many $8$-digit numbers are $*2*0*1*7$, where four unknown numbers are replaced by stars, which are divisible by $7$?

In an $n \times n$ square grid, $n$ squares are marked so that every rectangle composed of exactly $n$ grid squares contains at least one marked square. Determine all possible values of $n$.

[b]p1.[/b] Chad lives on the third floor of an apartment building with ten floors. He leaves his room and goes up two floors, goes down four floors, goes back up five floors, and finally goes down one floor, where he finds Jordan's room. On which floor does Jordan live? [b]p2.[/b] A real number $x$ satisfies the equation $2014x + 1337 = 1337x + 2014$. What is $x$? [b]p3.[/b] Given two points on the plane, how many distinct regular hexagons include both of these points as vertices? [b]p4.[/b] Jordan has six different files on her computer and needs to email them to Chad. The sizes of these files are $768$, $1024$, $2304$, $2560$, $4096$, and $7680$ kilobytes. Unfortunately, the email server holds a limit of $S$ kilobytes on the total size of the attachments per email, where $S$ is a positive integer. It is additionally given that all of the files are indivisible. What is the maximum value of S for which it will take Jordan at least three emails to transmit all six files to Chad? [b]p5.[/b] If real numbers $x$ and $y$ satisfy $(x + 2y)^2 + 4(x + 2y + 2 - xy) = 0$, what is $x + 2y$? [b]p6.[/b] While playing table tennis against Jordan, Chad came up with a new way of scoring. After the first point, the score is regarded as a ratio. Whenever possible, the ratio is reduced to its simplest form. For example, if Chad scores the first two points of the game, the score is reduced from $2:0$ to $1:0$. If later in the game Chad has $5$ points and Jordan has $9$, and Chad scores a point, the score is automatically reduced from $6:9$ to $2:3$. Chad's next point would tie the game at $1:1$. Like normal table tennis, a player wins if he or she is the first to obtain $21$ points. However, he or she does not win if after his or her receipt of the $21^{st}$ point, the score is immediately reduced. Chad and Jordan start at $0:0$ and finish the game using this rule, after which Jordan notes a curiosity: the score was never reduced. How many possible games could they have played? Two games are considered the same if and only if they include the exact same sequence of scoring. [b]p7.[/b] For a positive integer $m$, we define $m$ as a factorial number if and only if there exists a positive integer $k$ for which $m = k \cdot (k - 1) \cdot ... \cdot 2 \cdot 1$. We define a positive integer $n$ as a Thai number if and only if $n$ can be written as both the sum of two factorial numbers and the product of two factorial numbers. What is the sum of the five smallest Thai numbers? [b]p8.[/b] Chad and Jordan are in the Exeter Space Station, which is a triangular prism with equilateral bases. Its height has length one decameter and its base has side lengths of three decameters. To protect their station against micrometeorites, they install a force field that contains all points that are within one decameter of any point of the surface of the station. What is the volume of the set of points within the force field and outside the station, in cubic decameters? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Square $ABCD$ has side length $4$. Points $E$ and $F$ are the midpoints of sides $AB$ and $CD$, respectively. Eight $1$ by $2$ rectangles are placed inside the square so that no two of the eight rectangles overlap (see diagram). If the arrangement of eight rectangles is chosen randomly, then there are relatively prime positive integers $m$ and $n$ so that $\tfrac{m}{n}$ is the probability that none of the rectangles crosses the line segment $EF$ (as in the arrangement on the right). Find $m + n$. [asy] size(200); defaultpen(linewidth(0.8)+fontsize(10pt)); real r = 7; path square=origin--(4,0)--(4,4)--(0,4)--cycle; draw(square^^shift((r,0))*square,linewidth(1)); draw((1,4)--(1,0)^^(3,4)--(3,0)^^(0,2)--(1,2)^^(1,3)--(3,3)^^(1,1)--(3,1)^^(2,3)--(2,1)^^(3,2)--(4,2)); draw(shift((r,0))*((2,4)--(2,0)^^(0,2)--(4,2)^^(0,1)--(4,1)^^(0,3)--(2,3)^^(3,4)--(3,2))); label("A",(4,4),NE); label("A",(4+r,4),NE); label("B",(0,4),NW); label("B",(r,4),NW); label("C",(0,0),SW); label("C",(r,0),SW); label("D",(4,0),SE); label("D",(4+r,0),SE); label("E",(2,4),N); label("E",(2+r,4),N); label("F",(2,0),S); label("F",(2+r,0),S); [/asy]

Let $a, b$ be coprime positive integers. A positive integer $n$ is said to be [i]weak[/i] if there do not exist any nonnegative integers $x, y$ such that $ax+by=n$. Prove that if $n$ is a [i]weak[/i] integer and $n < \frac{ab}{6}$, then there exists an integer $k \geq 2$ such that $kn$ is [i]weak[/i].

For a positive integer number $n$ we denote $d(n)$ as the greatest common divisor of the binomial coefficients $\dbinom{n+1}{n} , \dbinom{n+2}{n} ,..., \dbinom{2n}{n}$. Find all possible values of $d(n)$

[b]p1.[/b] You are given three buckets with a capacity to hold $8$, $5$, and $3$ quarts of water, respectively. Initially, the first bucket is filled with $8$ quarts of water, while the remaining two buckets are empty. There are no markings on the buckets, so you are only allowed to empty a bucket into another one or to fill a bucket to its capacity using the water from one of the other buckets. (a) Describe a procedure by which we can obtain exactly $6$ quarts of water in the first bucket. (b) Describe a procedure by which we can obtain exactly $4$ quarts of water in the first bucket. [b]p2.[/b] A point in the plane is called a lattice point if its coordinates are both integers. A triangle whose vertices are all lattice points is called a lattice triangle. In each case below, give explicitly the coordinates of the vertices of a lattice triangle $T$ that satisfies the stated properties. (a) The area of $T$ is $1/2$ and two sides of $T$ have length greater than $2011$. (b) The area of $T$ is $1/2$ and the three sides of $T$ each have length greater than $2011$. [b]p3.[/b] Alice and Bob play several rounds of a game. In the $n$-th round, where $n = 1, 2, 3, ...$, the loser pays the winner $2^{n-1}$ dollars (there are no ties). After $40$ rounds, Alice has a profit of $\$2011$ (and Bob has lost $\$2011$). How many rounds of the game did Alice win, and which rounds were they? Justify your answer. [b]p4.[/b] Each student in a school is assigned a $15$-digit ID number consisting of a string of $3$’s and $7$’s. Whenever $x$ and $y$ are two distinct ID numbers, then $x$ and $y$ differ in at least three entries. Show that the number of students in the school is less than or equal to $2048$. [b]p5.[/b] A triangle $ABC$ has the following property: there is a point $P$ in the plane of $ABC$ such that the triangles $PAB$, $PBC$ and $PCA$ all have the same perimeter and the same area. Prove that: (a) If $P$ is not inside the triangle $ABC$, then $ABC$ is a right-angled triangle. (b) If $P$ is inside the triangle $ABC$, then $ABC$ is an equilateral triangle. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Find all positive integers $n=p_1p_2 \cdots p_k$ which divide $(p_1+1)(p_2+1)\cdots (p_k+1)$ where $p_1 p_2 \cdots p_k$ is the factorization of $n$ into prime factors (not necessarily all distinct).

Prove that among any $n$ positive integers one can always find some (at least one) whose sum is divisible by $n$.

Find all perfect squares $n$ such that if the positive integer $a\ge 15$ is some divisor $n$ then $a+15$ is a prime power. [i]Proposed by Saudi Arabia[/i]

A sequence $\{y_i\}$ is given, where $y_0=-\frac{1}{4},y_1=0$. For every positive integer $n$ the following equality holds: $$y_{n-1}+y_{n+1}=4y_n+1$$ Prove that for every positive integer $n$ the number $2y_{2n}+\frac{3}{2}$ a) is a positive integer b) is a square of a positive integer [i]D. Zmiaikou[/i]

The positive integers $a $ and $b $ satisfy the sistem $\begin {cases} a_{10} +b_{10} = a \\a_{11}+b_{11 }=b \end {cases} $ where $ a_1 <a_2 <\dots $ and $ b_1 <b_2 <\dots $ are the positive divisors of $a $ and $b$ . Find $a$ and $b $ .