Compute the second smallest positive whole number that has exactly $6$ positive whole number divisors (including itself).

Find all pairs of prime numbers $(p, q)$ such that $p^2 + 5pq + 4q^2$ is a perfect square.

A lattice point in the coordinate plane with origin $O$ is called invisible if the segment $OA$ contains a lattice point other than $O,A$. Let $L$ be a positive integer. Show that there exists a square with side length $L$ and sides parallel to the coordinate axes, such that all points in the square are invisible.

[u]Round 9[/u] [b]p25.[/b] For how many nonempty subsets of $\{1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16\}$ is the sum of the elements divisble by $32$? [b]p26.[/b] America declared independence in $1776$. Take the sum of the cubes of the digits of $1776$ and let that equal $S_1$. Sum the cubes of the digits of $S_1$ to get $S_2$. Repeat this process $1776$ times. What is $S_{1776}$? [b]p27.[/b] Every Golden Grahams box contains a randomly colored toy car, which is one of four colors. What is the expected number of boxes you have to buy in order to obtain one car of each color? [u]Round 10[/u] [b]p28.[/b] Let $B$ be the answer to Question $29$ and $C$ be the answer to Question $30$. What is the sum of the square roots of $B$ and $C$? [b]p29.[/b] Let $A$ be the answer to Question $28$ and $C$ be the answer to Question $30$. What is the sum of the sums of the digits of $A$ and $C$? [b]p30.[/b] Let $A$ be the answer to Question $28$ and $B$ be the answer to Question $29$. What is $A + B$? [u]Round 11[/u] [b]p31.[/b] If $x + \frac{1}{x} = 4$, find $x^6 + \frac{1}{x^6}$. [b]p32.[/b] Given a positive integer $n$ and a prime $p$, there is are unique nonnegative integers $a$ and $b$ such that $n = p^b \cdot a$ and $gcd (a, p) = 1$. Let $v_p(n)$ denote this uniquely determined $a$. Let $S$ denote the set of the first 20 primes. Find $\sum_{ p \in S} v_p \left(1 + \sum^{100}_{i=0} p^i \right)$. [b]p33. [/b] Find the maximum value of n such that $n+ \sqrt{(n - 1) +\sqrt{(n - 2) + ... +\sqrt{1}}} < 49$ (Note: there would be $n - 1$ square roots and $n$ total terms). [u]Round 12[/u] [b]p34.[/b] Give two numbers $a$ and $b$ such that $2015^a < 2015! < 2015^b$. If you are incorrect you get $-5$ points; if you do not answer you get $0$ points; otherwise you get $\max \{20-0.02(|b - a| - 1), 0\}$ points, rounded down to the nearest integer. [b]p35.[/b] Twin primes are prime numbers whose difference is $2$. Let $(a, b)$ be the $91717$-th pair of twin primes, with $a < b$. Let $k = a^b$, and suppose that $j$ is the number of digits in the base $10$ representation of $k$. What is $j^5$? If the correct answer is $n$ and you say $m$, you will receive $\max \left(20 - | \log \left(| \frac{m}{n} |\right), 0 \right)$ points, rounded down to the nearest integer. [b]p36.[/b] Write down any positive integer. Let the sum of the valid submissions (i.e. positive integer submissions) for all teams be $S$. One team will be chosen randomly, according to the following distribution: if your team's submission is $n$, you will be chosen with probability $\frac{n}{S}$ . The amount of points that the chosen team will win is the greatest integer not exceeding $\min \{K, \frac{ 10000}{S} \}$. $K$ is a predetermined secret value. PS. You should use hide for answers. Rounds 1-4 have been posted [url=https://artofproblemsolving.com/community/c3h3157009p28696627]here [/url] and 5-8 [url=https://artofproblemsolving.com/community/c3h3157013p28696685]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $n$ be a positive integer and $\{A,B,C\}$ a partition of $\{1,2,\ldots,3n\}$ such that $|A|=|B|=|C|=n$. Prove that there exist $x \in A$, $y \in B$, $z \in C$ such that one of $x,y,z$ is the sum of the other two.

2011 non-zero integers are given. It is known that the sum of any one of them with the product of the remaining 2010 numbers is negative. Prove that if all numbers are split arbitrarily into two groups, the sum of the two products will also be negative. (Authors: N. Agahanov & I. Bogdanov)

Bored of waiting for his plane to travel to the International Mathematics Olympiad, Daniel began to write powers of $2$ in a list in his notebook as follows: $\bullet$ Starting with the number $1$, Daniel writes the next power of $2$ at the end of his list and reverses the order of the numbers in the list. Let us call such a modification of the list, including the first step, a [i]move[/i]. The list in each of the first $4$ moves it looks like this: $$1 \,\,\,\, \to 2, 1 \,\,\,\, \,\,\,\, \to 4, 1, 2 \,\,\,\, \,\,\,\, \to 8, 2, 1, 4$$ Daniel plans to carry out operations until his plane arrives, but he is worried let the list grow too. After $2020$ moves, what is the sum of the first $1010$ numbers?

Let $n > 1$ be an integer. Determine the greatest common divisor of the set of numbers $\left\{ \left( \begin{matrix} 2n \\ 2i+1 \\ \end{matrix} \right):0 \le i \le n-1 \right\}$ i.e. the largest positive integer, dividing $\left( \begin{matrix} 2n \\ 2i+1 \\ \end{matrix} \right)$ without remainder for every $i = 0, 1, ..., n–1$ . (Here $\left( \begin{matrix} m \\ l \\ \end{matrix} \right)=\text{C}_{m}^{l}=\frac{m\text{!}}{l\text{!}\left( m-l \right)\text{!}}$ is binomial coefficient.)

In chess, there are two types of minor pieces, the bishop and the knight. A bishop may move along a diagonal, as long as there are no pieces obstructing its path. A knight may jump to any lattice square $\sqrt{5}$ away as long as it isn't occupied. One day, a bishop and a knight were on squares in the same row of an infinite chessboard, when a huge meteor storm occurred, placing a meteor in each square on the chessboard independently and randomly with probability $p$. Neither the bishop nor the knight were hit, but their movement may have been obstructed by the meteors. The value of $p$ that would make the expected number of valid squares that the bishop can move to and the number of squares that the knight can move to equal can be expressed as $\frac{a}{b}$ for relatively prime positive integers $a, b$. Compute $100a + b$. [i]Proposed by Lewis Chen[/i]

Find all positive integers $a, b, c, d,$ and $n$ satisfying $n^a + n^b + n^c = n^d$ and prove that these are the only such solutions.

The numbers from $1$ to $10$ were divided into two groups so that the product of the numbers in the first group is completely divisible by the product of the numbers in the second. Which the smallest value can be for the quotient of the first product money for the second?

$a$ and $b$ are natural numbers such that $b > a > 1$, and $a$ does not divide $b$. The sequence of natural numbers $\{b_n\}_{n=1}^\infty$ satisfies $b_{n + 1} \geq 2b_n \forall n \in \mathbb{N}$. Does there exist a sequence $\{a_n\}_{n=1}^\infty$ of natural numbers such that for all $n \in \mathbb{N}$, $a_{n + 1} - a_n \in \{a, b\}$, and for all $m, l \in \mathbb{N}$ ($m$ may be equal to $l$), $a_m + a_l \not\in \{b_n\}_{n=1}^\infty$?

Show that the equation $$a^2b=2017(a+b)$$ has no solutions for positive integers $a$ and $b$. [i]Proposed by Oriol Solé[/i]

Does there exist a positive integer $m$, such that if $S_n$ denotes the lcm of $1,2, \ldots, n$, then $S_{m+1}=4S_m$?

Let the sequence $a_1,a_2,\ldots,a_n,\ldots$ is defined by the conditions: $a_1=2$ and $a_{n+1}=a_n^2-a_n+1$ $(n=1,2,\ldots)$. Prove that: (a) $a_m$ and $a_n$ are relatively prime numbers when $m\ne n$. (b) $\lim_{n\to\infty}\sum_{k=1}^n\frac1{a_k}=1$ [i]I. Tonov[/i]

Determine all functions $ f$ defined on the natural numbers that take values among the natural numbers for which \[ (f(n))^p \equiv n\quad {\rm mod}\; f(p) \] for all $ n \in {\bf N}$ and all prime numbers $ p$.

Find the number of positive integer $ n < 3^8 $ satisfying the following condition. "The number of positive integer $k (1 \leq k \leq \frac {n}{3})$ such that $ \frac{n!}{(n-3k)! \cdot k! \cdot 3^{k+1}} $ is not a integer" is $ 216 $.

Let be a natural number $ n\ge 2. $ Prove that there exists an unique bipartition $ \left( A,B \right) $ of the set $ \{ 1,2\ldots ,n \} $ such that $ \lfloor \sqrt x \rfloor\neq y , $ for any $ x,y\in A , $ and $ \lfloor \sqrt z \rfloor\neq t , $ for any $ z,t\in B. $ [i]Costin Bădică[/i]

Let $n$ be a given number greater than 2. We consider the set $V_n$ of all the integers of the form $1 + kn$ with $k = 1, 2, \ldots$ A number $m$ from $V_n$ is called indecomposable in $V_n$ if there are not two numbers $p$ and $q$ from $V_n$ so that $m = pq.$ Prove that there exist a number $r \in V_n$ that can be expressed as the product of elements indecomposable in $V_n$ in more than one way. (Expressions which differ only in order of the elements of $V_n$ will be considered the same.)

For a positive integer $n$, let $p(n)$ denote the product of the digits of $n$, and let $s(n)$ denote the sum of the digits of $n$. Find the sum of all positive integers $n$ satisfying $p(n)s(n)=8$.

Determine all ordered pairs $(x, y)$ of nonnegative integers that satisfy the equation $$3x^2 + 2 \cdot 9^y = x(4^{y+1}-1).$$

Determine all integers $ a$ and $ b$, so that $ (a^3\plus{}b)(a\plus{}b^3)\equal{}(a\plus{}b)^4$

Prove that the equation $x^3+y^3+z^3=t^4$ has infinitely many solutions in positive integers such that $\gcd(x,y,z,t)=1$. [i]Mihai Pitticari & Sorin Rǎdulescu[/i]

The decimal representation of an integer uses only two different digits. The number is at least $10$ digits long, and any two neighbouring digits are distinct. What is the greatest power of two that can divide this number?

Let $n = 2^8 \cdot 3^9 \cdot 5^{10} \cdot 7^{11}$. For $k$ a positive integer, let $f(k)$ be the number of integers $0 \le x < n$ such that $x^2 \equiv k^2$ (mod $n$). Compute the number of positive integers k such that $k | f(k)$.