The year $1978$ was “peculiar” in that the sum of the numbers formed with the first two digits and the last two digits is equal to the number formed with the middle two digits, i.e., $19+78=97$. What was the last previous peculiar year, and when will the next one occur?

Let $n{}$ be a positive integer. What is the smallest sum of digits that $5^n + 6^n + 2022^n$ can take?

Erick stands in the square in the 2nd row and 2nd column of a 5 by 5 chessboard. There are \$1 bills in the top left and bottom right squares, and there are \$5 bills in the top right and bottom left squares, as shown below. \[\begin{tabular}{|p{1em}|p{1em}|p{1em}|p{1em}|p{1em}|} \hline \$1 & & & & \$5 \\ \hline & E & & &\\ \hline & & & &\\ \hline & & & &\\ \hline \$5 & & & & \$1 \\ \hline \end{tabular}\] Every second, Erick randomly chooses a square adjacent to the one he currently stands in (that is, a square sharing an edge with the one he currently stands in) and moves to that square. When Erick reaches a square with money on it, he takes it and quits. The expected value of Erick's winnings in dollars is $m/n$, where $m$ and $n$ are relatively prime positive integers. Find $m+n$.

Find all positive integers $n\geq 2$, for which there exist positive integers $a_1, a_2, ..., a_n$ such that both sets $$\{a_1, a_2, ..., a_n\}\;\;\;and\;\;\;\{a_1+a_2, a_2+a_3, ..., a_n+a_1\}$$ contain $n$ consecutive integers.

Given an integer $ m\geq$ 2, m positive integers $ a_1,a_2,...a_m$. Prove that there exist infinitely many positive integers n, such that $ a_{1}1^{n} \plus{} a_{2}2^{n} \plus{} ... \plus{} a_{m}m^{n}$ is composite.

Let $p$ be a prime integer greater than $10^k$. Pete took some multiple of $p$ and inserted a $k-$digit integer $A$ between two of its neighbouring digits. The resulting integer C was again a multiple of $p$. Pete inserted a $k-$digit integer $B$ between two of neighbouring digits of $C$ belonging to the inserted integer $A$, and the result was again a multiple of $p$. Prove that the integer $B$ can be obtained from the integer $A$ by a permutation of its digits. [i](8 points)[/i] [i]Ilya Bogdanov[/i]

A box contains gold coins. If the coins are equally divided among six people, four coins are left over. If the coins are equally divided among five people, three coins are left over. If the box holds the smallest number of coins that meets these two conditions, how many coins are left when equally divided among seven people? $ \textbf{(A)}\ 0 \qquad \textbf{(B)}\ 1 \qquad \textbf{(C)}\ 2 \qquad \textbf{(D)}\ 3 \qquad \textbf{(E)}\ 5$

Find all triples $(x,y,z)$ of natural numbers that verify the equation $$2x^2y^2+2y^2z^2+2z^2x^2-x^4-y^4-z^4=576.$$

A point in the plane is called [b]integral[/b] if both its $x$ and $y$ coordinates are integers. We are given a triangle whose vertices are integral. Its sides do not contain any other integral points. Inside the triangle, there are exactly 4 integral points. Must those 4 points lie on one line?

Initially, Alice is given a positive integer $a_0$. At time $i$, Alice has two choices, $$\begin{cases}a_i\mapsto\frac1{a_{i-1}}\\a_i\mapsto2a_{i-1}+1\end{cases}$$ Note that it is dangerous to perform the first operation, so Alice cannot choose this operation in two consecutive turns. However, if $x>8763$, then Alice could only perform the first operation. Determine all $a_0$ so that $\{i\in\mathbb N\mid a_i\in\mathbb N\}$ is an infinite set.

Let $P(x)$ denote the polynomial \[3\sum_{k=0}^{9}x^k + 2\sum_{k=10}^{1209}x^k + \sum_{k=1210}^{146409}x^k.\]Find the smallest positive integer $n$ for which there exist polynomials $f,g$ with integer coefficients satisfying $x^n - 1 = (x^{16} + 1)P(x) f(x) + 11\cdot g(x)$. [i]Victor Wang.[/i]

Let $\mathbb{Z}_{>0}$ denote the set of positive integers. For any positive integer $k$, a function $f: \mathbb{Z}_{>0} \to \mathbb{Z}_{>0}$ is called [i]$k$-good[/i] if $\gcd(f(m) + n, f(n) + m) \le k$ for all $m \neq n$. Find all $k$ such that there exists a $k$-good function. [i]Proposed by James Rickards, Canada[/i]

For every positive integer $n$ let $S(n)$ be the sum of its digits. We say $n$ has a property $P$ if all terms in the infinite secuence $n, S(n), S(S(n)),...$ are even numbers, and we say $n$ has a property $I$ if all terms in this secuence are odd. Show that for, $1 \le n \le 2017$ there are more $n$ that have property $I$ than those who have $P$.

Let $a$ and $b$ be positive integers, $b<a$, such that $a^3+b^3+ab$ is divisible by $ab(a-b)$. Prove that $ab$ is a perfect cube.

Find all positive integers $n$, such that: $$a+b+c \mid a^{2n}+b^{2n}+c^{2n}-n(a^2b^2+b^2c^2+c^2a^2)$$ for all pairwise different positive integers $a,b$ and $c$

Given [i]Fibonacci[/i] sequence $(F_n),$ and a positive integer $m$, denote $k(m)$ by the smallest positive integer satisfying $F_{n+k(m)}\equiv F_n(\bmod m),$ for all natural numbers $n$, $s$ is a positive integer. Prove that: a) ${F_{{{3.2}^{s - 1}}}} \equiv 0(\bmod {2^s})$ and ${F_{{{3.2}^{s - 1}} + 1}} \equiv 1(\bmod {2^s}).$ b) $k({2^s}) = {3.2^{s - 1}}.$

Let $n$ be a positive integer. Prove that the numbers $n^2(n^2 + 2)^2$ and $n^4(n^2 + 2)^2$ are written in base $n^2 +1$ with the same digits but in opposite order.

Solve the following equation in the set of integer numbers: \[ x^{2010}-2006=4y^{2009}+4y^{2008}+2007y. \]

Let $(a_n)_{n\in \mathbb N}$ be the sequence of integers defined recursively by $a_1 = a_2 = 1, a_{n+2} = 7a_{n+1} - a_n - 2$ for $n \geq 1$. Prove that $a_n$ is a perfect square for every $n.$

A positive integer is called a [b]double number[/b] if its decimal representation consists of a block of digits, not commencing with 0, followed immediately by an identical block. So, for instance, 360360 is a double number, but 36036 is not. Show that there are infinitely many double numbers which are perfect squares.

Give an example of four pairwise distinct natural numbers $a$, $b$, $c$ and $d$ such that $$a^2 + b^3 + c^4 = d^5.$$

FIx positive integer $n$. Prove: For any positive integers $a,b,c$ not exceeding $3n^2+4n$, there exist integers $x,y,z$ with absolute value not exceeding $2n$ and not all $0$, such that $ax+by+cz=0$

Let $S$ be a finite set of positive integers which has the following property:if $x$ is a member of $S$,then so are all positive divisors of $x$. A non-empty subset $T$ of $S$ is [i]good[/i] if whenever $x,y\in T$ and $x<y$, the ratio $y/x$ is a power of a prime number. A non-empty subset $T$ of $S$ is [i]bad[/i] if whenever $x,y\in T$ and $x<y$, the ratio $y/x$ is not a power of a prime number. A set of an element is considered both [i]good[/i] and [i]bad[/i]. Let $k$ be the largest possible size of a [i]good[/i] subset of $S$. Prove that $k$ is also the smallest number of pairwise-disjoint [i]bad[/i] subsets whose union is $S$.

Let $a$ and $b$ be integers such that $a - b = a^2c - b^2d$ for some consecutive integers $c$ and $d$. Prove that $|a - b|$ is a perfect square.

What is the maximum value of $n$ for which there is a set of distinct positive integers $k_1,k_2,\ldots,k_n$ for which \[k_1^2+k_2^2+\ldots+k_n^2=2002?\] $\textbf{(A) }14\qquad\textbf{(B) }15\qquad\textbf{(C) }16\qquad\textbf{(D) }17\qquad\textbf{(E) }18$