The numbers $p, 4p^2 + 1,$ and $6p^2 + 1$ are primes. Determine $p.$

Find all positive integers $a$ such that there exists a set $X$ of $6$ integers satisfying the following conditions: for every $k=1,2,\ldots ,36$ there exist $x,y\in X$ such that $ax+y-k$ is divisible by $37$.

Let $N$ be the smallest positive integer divisble by $10^{2023} - 1$ that only has the digits $4$ and $8$ in decimal form (these digits may be repeated). Compute the sum of the digits of $\frac{N}{10^{2023}-1}$ .

Petya and Vasya only know positive integers not exceeding $10^9-4000$. Petya considers numbers as good which are representable in the form $abc+ab+ac+bc$, where $a,b$ and $c$ are natural numbers not less than $100$. Vasya considers numbers as good which are representable in the form $xyz-x-y-z$, where $x,y$ and $z$ are natural numbers strictly bigger than $100$. For which of them are there more good numbers? [i]Proposed by I. Bogdanov[/i]

Suppose that we have a set $S$ of $756$ arbitrary integers between $1$ and $2008$ ($1$ and $2008$ included). Prove that there are two distinct integers $a$ and $b$ in $S$ such that their sum $a + b$ is divisible by $8$.

The sequence $\{a_n\}$ is defined as follows: \begin{align*} a_n = \sqrt{1 + \left(1 + \frac 1n \right)^2} + \sqrt{1 + \left(1 - \frac 1n \right)^2}. \end{align*} What is the value of the expression given below? \begin{align*} \frac{4}{a_1} + \frac{4}{a_2} + \dots + \frac{4}{a_{96}}.\end{align*} $\textbf{(A)}\ \sqrt{18241} \qquad\textbf{(B)}\ \sqrt{18625} - 1 \qquad\textbf{(C)}\ \sqrt{18625} \qquad\textbf{(D)}\ \sqrt{19013} - 1\qquad\textbf{(E)}\ \sqrt{19013}$

Prove that the equation \[ 6(6a^2 + 3b^2 + c^2) = 5n^2 \] has no solutions in integers except $a = b = c = n = 0$.

Let $n$ be a positive integer. If $r\hspace{0.25mm} \equiv \hspace{1mm} n\hspace{1mm} (mod\hspace{1mm} 2)$ and $r\hspace{0.10mm} \in \hspace{0.10mm} \{ 0,\hspace{0.10mm} 1 \} $, find the number of integer solutions to the system of equations $\left\{\begin{array}{l}x+y+z = r \\ \mid x \mid + \mid y \mid + \mid z \mid = n \end{array}\right.$

Do there exist positive integers $a \ne b$ such that $ a+b$ is a perfect square and $a^3 +b^3$ is a fourth power of an integer?

[u]Round 1[/u] [b]p1.[/b] Alice and Bob played $25$ games of rock-paper-scissors. Alice played rock $12$ times, scissors $6$ times, and paper $7$ times. Bob played rock $13$ times, scissors $9$ times, and paper $3$ times. If there were no ties, who won the most games? (Remember, in each game each player picks one of rock, paper, or scissors. Rock beats scissors, scissors beat paper, and paper beats rock. If they choose the same object, the result is a tie.) [b]p2.[/b] On the planet Vulcan there are eight big volcanoes and six small volcanoes. Big volcanoes erupt every three years and small volcanoes erupt every two years. In the past five years, there were $30$ eruptions. How many volcanoes could erupt this year? [b]p3.[/b] A tangle is a sequence of digits constructed by picking a number $N\ge 0$ and writing the integers from $0$ to $N$ in some order, with no spaces. For example, $010123459876$ is a tangle with $N = 10$. A palindromic sequence reads the same forward or backward, such as $878$ or $6226$. The shortest palindromic tangle is $0$. How long is the second-shortest palindromic tangle? [b]p4.[/b] Balls numbered $1$ to $N$ have been randomly arranged in a long input tube that feeds into the upper left square of an $8 \times 8$ board. An empty exit tube leads out of the lower right square of the board. Your goal is to arrange the balls in order from $1$ to $N$ in the exit tube. As a move, you may 1. move the next ball in line from the input tube into the upper left square of the board, 2. move a ball already on the board to an adjacent square to its right or below, or 3. move a ball from the lower right square into the exit tube. No square may ever hold more than one ball. What is the largest number $N$ for which you can achieve your goal, no matter how the balls are initially arranged? You can see the order of the balls in the input tube before you start. [img]https://cdn.artofproblemsolving.com/attachments/1/8/bbce92750b01052db82d58b96584a36fb5ca5b.png[/img] [b]p5.[/b] A $2018 \times 2018$ board is covered by non-overlapping $2 \times 1$ dominoes, with each domino covering two squares of the board. From a given square, a robot takes one step to the other square of the domino it is on and then takes one more step in the same direction. Could the robot continue moving this way forever without falling off the board? [img]https://cdn.artofproblemsolving.com/attachments/9/c/da86ca4ff0300eca8e625dff891ed1769d44a8.png[/img] [u]Round 2[/u] [b]p6.[/b] Seventeen teams participated in a soccer tournament where a win is worth $1$ point, a tie is worth $0$ points, and a loss is worth $-1$ point. Each team played each other team exactly once. At least $\frac34$ of all games ended in a tie. Show that there must be two teams with the same number of points at the end of the tournament. [b]p7.[/b] The city of Old Haven is known for having a large number of secret societies. Any person may be a member of multiple societies. A secret society is called influential if its membership includes at least half the population of Old Haven. Today, there are $2018$ influential secret societies. Show that it is possible to form a council of at most $11$ people such that each influential secret society has at least one member on the council. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $C$ be a circle of radius $1$ and $O$ its center. Let $\overline{AB}$ be a chord of the circle and $D$ a point on $\overline{AB}$ such that $OD =\frac{\sqrt2}{2}$ such that $D$ is closer to $ A$ than it is to $ B$, and if the perpendicular line at $D$ with respect to $\overline{AB}$ intersects the circle at $E $and $F$, $AD = DE$. The area of the region of the circle enclosed by $\overline{AD}$, $\overline{DE}$, and the minor arc $AE$ may be expressed as $\frac{a + b\sqrt{c} + d\pi}{e}$ where $a, b, c, d, e$ are integers, gcd $(a, b, d, e) = 1$, and $c$ is squarefree. Find $a + b + c + d + e$

Let $a_1,a_2,a_3, \cdots $ be distinct positive integers, and $0<c<\frac{3}{2}$ . Prove that : There exist infinitely many positive integers $k$, such that $[a_k,a_{k+1}]>ck $.

A number is written in each square of a chessboard, so that each number not on the border is the mean of the $4$ neighboring numbers. Show that if the largest number is $N$, then there is a number equal to $N$ in the border squares.

Suppose that $n$ consecutive positive integers were written on the board, where $n > 6$. Then some $5$ of the written numbers were erased, and it turned out that any two of the remaining numbers are coprime. Find the largest possible value of $n$.

Let $f(n)$ be defined on the positive integers and satisfy: $f(prime) = 1$, $f(ab) = a f(b) + f(a) b$. Show that $f$ is unique and find all $n$ such that $n = f(n)$.

$\boxed{N1}$ find all positive integers $n$ for which $1^3+2^3+\cdots+{16}^3+{17}^n$ is a perfect square.

Let $ a > b > 1$ be relatively prime positive integers. Define the weight of an integer $ c$, denoted by $ w(c)$ to be the minimal possible value of $ |x| \plus{} |y|$ taken over all pairs of integers $ x$ and $ y$ such that \[ax \plus{} by \equal{} c.\] An integer $ c$ is called a [i]local champion [/i]if $ w(c) \geq w(c \pm a)$ and $ w(c) \geq w(c \pm b)$. Find all local champions and determine their number. [i]Proposed by Zoran Sunic, USA[/i]

Given a chessboard $n \times n$, where $n\geq 4$ and $p=n+1$ is a prime number. A set of $n$ unit squares is called [i]tactical[/i] if after putting down queens on these squares, no two queens are attacking each other. Prove that there exists a partition of the chessboard into $n-2$ tactical sets, not containing squares on the main diagonals. Queens are allowed to move horizontally, vertically and diagonally.

Given an infinite positive integer sequence $\{x_i\}$ such that $$x_{n+2}=x_nx_{n+1}+1$$ Prove that for any positive integer $i$ there exists a positive integer $j$ such that $x_j^j$ is divisible by $x_i^i$. [i]Remark: Unfortunately, there was a mistake in the problem statement during the contest itself. In the last sentence, it should say "for any positive integer $i>1$ ..."[/i]

Find all positive integer(s) $n$ such that $n^2+32n+8$ is a perfect square.

Which natural numbers can be expressed as the difference of squares of two integers?

A sequence of primes $p_1, p_2, \dots$ is given by two initial primes $p_1$ and $p_2$, and $p_{n+2}$ being the greatest prime divisor of $p_n + p_{n+1} + 2018$ for all $n \ge 1$. Prove that the sequence only contains finitely many primes for all possible values of $p_1$ and $p_2$.

Prove that we can find an infinite set of positive integers of the from $2^n-3$ (where $n$ is a positive integer) every pair of which are relatively prime.

Positive integers $ a<b$ are given. Prove that among every $ b$ consecutive positive integers there are two numbers whose product is divisible by $ ab$.

Show that there do not exist positive integers $x,y,z$ such that $$x^x + y^y = 9^z$$ [i]usjl[/i]