Let ${(a_n)_{n\ge1}} $ be a sequence with ${a_1 = 1} $ and ${a_{n+1} = \lfloor a_n +\sqrt{a_n}+\frac{1}{2}\rfloor }$ for all ${n \ge 1}$, where ${\lfloor x \rfloor}$ denotes the greatest integer less than or equal to ${x}$. Find all ${n \le 2013}$ such that ${a_n}$ is a perfect square

Find all positive integers $n>2$ such that $$ n! \mid \prod_{ p<q\le n, p,q \, \text{primes}} (p+q)$$

Given that $x$ and $y$ are positive integers such that $xy^{10}$ is perfect 33rd power of a positive integer, prove that $x^{10}y$ is also a perfect 33rd power!

Let $n$ and $m$ be natural numbers such that $m+ i=a_ib_i^2$ for $i=1,2, \cdots n$ where $a_i$ and $b_i$ are natural numbers and $a_i$ is not divisible by a square of a prime number. Find all $n$ for which there exists an $m$ such that $\sum_{i=1}^{n}a_i=12$

Determine all integers $ n\geq 2$ having the following property: for any integers $a_1,a_2,\ldots, a_n$ whose sum is not divisible by $n$, there exists an index $1 \leq i \leq n$ such that none of the numbers $$a_i,a_i+a_{i+1},\ldots,a_i+a_{i+1}+\ldots+a_{i+n-1}$$ is divisible by $n$. Here, we let $a_i=a_{i-n}$ when $i >n$. [i]Proposed by Warut Suksompong, Thailand[/i]

[u]Set 6[/u] [b]B16.[/b] Let $\ell_r$ denote the line $x + ry + r^2 = 420$. Jeffrey draws the lines $\ell_a$ and $\ell_b$ and calculates their single intersection point. [b]B17.[/b] Let set $L$ consist of lines of the form $3x + 2ay = 60a + 48$ across all real constants a. For every line $\ell$ in $L$, the point on $\ell$ closest to the origin is in set $T$ . The area enclosed by the locus of all the points in $T$ can be expressed in the form nπ for some positive integer $n$. Compute $n$. [b]B18.[/b] What is remainder when the $2020$-digit number $202020 ... 20$ is divided by $275$? [u]Set 7[/u] [b]B19.[/b] Consider right triangle $\vartriangle ABC$ where $\angle ABC = 90^o$, $\angle ACB = 30^o$, and $AC = 10$. Suppose a beam of light is shot out from point $A$. It bounces off side $BC$ and then bounces off side $AC$, and then hits point $B$ and stops moving. If the beam of light travelled a distance of $d$, then compute $d^2$. [b]B20.[/b] Let $S$ be the set of all three digit numbers whose digits sum to $12$. What is the sum of all the elements in $S$? [b]B21.[/b] Consider all ordered pairs $(m, n)$ where $m$ is a positive integer and $n$ is an integer that satisfy $$m! = 3n^2 + 6n + 15,$$ where $m! = m \times (m - 1) \times ... \times 1$. Determine the product of all possible values of $n$. [u]Set 8[/u] [b]B22.[/b] Compute the number of ordered pairs of integers $(m, n)$ satisfying $1000 > m > n > 0$ and $6 \cdot lcm(m - n, m + n) = 5 \cdot lcm(m, n)$. [b]B23.[/b] Andrew is flipping a coin ten times. After every flip, he records the result (heads or tails). He notices that after every flip, the number of heads he had flipped was always at least the number of tails he had flipped. In how many ways could Andrew have flipped the coin? [b]B24.[/b] Consider a triangle $ABC$ with $AB = 7$, $BC = 8$, and $CA = 9$. Let $D$ lie on $\overline{AB}$ and $E$ lie on $\overline{AC}$ such that $BCED$ is a cyclic quadrilateral and $D, O, E$ are collinear, where $O$ is the circumcenter of $ABC$. The area of $\vartriangle ADE$ can be expressed as $\frac{m\sqrt{n}}{p}$, where $m$ and $p$ are relatively prime positive integers, and $n$ is a positive integer not divisible by the square of any prime. What is $m + n + p$? [u]Set 9[/u] [i]This set consists of three estimation problems, with scoring schemes described.[/i] [b]B25.[/b] Submit one of the following ten numbers: $$3 \,\,\,\, 6\,\,\,\, 9\,\,\,\, 12\,\,\,\, 15\,\,\,\, 18\,\,\,\, 21\,\,\,\, 24\,\,\,\, 27\,\,\,\, 30.$$ The number of points you will receive for this question is equal to the number you selected divided by the total number of teams that selected that number, then rounded up to the nearest integer. For example, if you and four other teams select the number $27$, you would receive $\left\lceil \frac{27}{5}\right\rceil = 6$ points. [b]B26.[/b] Submit any integer from $1$ to $1,000,000$, inclusive. The standard deviation $\sigma$ of all responses $x_i$ to this question is computed by first taking the arithmetic mean $\mu$ of all responses, then taking the square root of average of $(x_i -\mu)^2$ over all $i$. More, precisely, if there are $N$ responses, then $$\sigma =\sqrt{\frac{1}{N} \sum^N_{i=1} (x_i -\mu)^2}.$$ For this problem, your goal is to estimate the standard deviation of all responses. An estimate of $e$ gives $\max \{ \left\lfloor 130 ( min \{ \frac{\sigma }{e},\frac{e}{\sigma }\}^{3}\right\rfloor -100,0 \}$ points. [b]B27.[/b] For a positive integer $n$, let $f(n)$ denote the number of distinct nonzero exponents in the prime factorization of $n$. For example, $f(36) = f(2^2 \times 3^2) = 1$ and $f(72) = f(2^3 \times 3^2) = 2$. Estimate $N = f(2) + f(3) +.. + f(10000)$. An estimate of $e$ gives $\max \{30 - \lfloor 7 log_{10}(|N - e|)\rfloor , 0\}$ points. PS. You had better use hide for answers. First sets have been posted [url=https://artofproblemsolving.com/community/c4h2777391p24371239]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $n$ be a positive integer. Define a sequence by setting $a_{1}= n$ and, for each $k > 1$, letting $a_{k}$ be the unique integer in the range $0\leq a_{k}\leq k-1$ for which $a_{1}+a_{2}+...+a_{k}$ is divisible by $k$. For instance, when $n = 9$ the obtained sequence is $9,1,2,0,3,3,3,...$. Prove that for any $n$ the sequence $a_{1},a_{2},...$ eventually becomes constant.

Let $k\geqslant 2$ be a natural number. Prove that the natural numbers with an even sum of digits give all the possible residues when divided by $k{}$. [i]Proposed by P. Kozlov and I. Bogdanov[/i]

For positive integers $n,d$, define $n \% d$ to be the unique value of the positive integer $r < d$ such that $n = qd + r$, for some positive integer $q$. What is the smallest value of $n$ not divisible by $5,7,11,13$ for which $n^2 \% 5 < n^2 \% 7 < n^2 \% 11 < n^2 \% 13$?

Determine all integers $ n > 1$ such that \[ \frac {2^n \plus{} 1}{n^2} \] is an integer.

a) Prove that for each positive integer $n$ the number or ordered pairs of integers $(x,y)$ for which $x^2-xy+y^2=n$ is finite and is multiple of 6. b) Find all ordered pairs of integers $(x,y)$ for which $x^2-xy+y^2=727$.

Find all the pairs $(n, m)$ of positive integers which fulfil simultaneously the conditions: i) the number $n$ is composite; ii) if the numbers $d_1, d_2, ..., d_k, k \in N^*$ are all the proper divisors of $n$, then the numbers $d_1 + 1, d_2 + 1, . . . , d_k + 1$ are all the proper divisors of $m$.

Let $A=\{ x\in \mathbb{N},x=a^2+2b^2,a,b\in \mathbb{Z},ab\neq 0 \}$ and $p$ is a prime number. Prove that if $p^2\in A$, then $p\in A$.

Find the unique 3 digit number $N=\underline{A}$ $\underline{B}$ $\underline{C},$ whose digits $(A, B, C)$ are all nonzero, with the property that the product $P=\underline{A}$ $\underline{B}$ $\underline{C}$ $\times$ $\underline{A}$ $\underline{B}$ $\times$ $\underline{A}$ is divisible by $1000$. [i]Proposed by Kyle Lee[/i]

On a circle $2018$ points are marked. Each of these points is labeled with an integer. Let each number be larger than the sum of the preceding two numbers in clockwise order. Determine the maximal number of positive integers that can occur in such a configuration of $2018$ integers. [i](Proposed by Walther Janous)[/i]

For any positive integer $n$, let $\tau (n)$ denote the number of its positive divisors (including 1 and itself). Determine all positive integers $m$ for which there exists a positive integer $n$ such that $\frac{\tau (n^{2})}{\tau (n)}=m$.

Let $p$ be a prime number such that $p\mid (2^{2019}-1) .$ The sequence $a_1,a_2,...,a_n$ satisfies the following conditions: $a_0=2, a_1=1 ,a_{n+1}=a_n+\frac{p^2-1}{4}a_{n-1}$ $(n\geq 1).$ Prove that $p\nmid (a_n+1),$ for any $n\geq 0.$

What is the smallest integer $a_0$ such that, for every positive integer $n$, there exists a sequence of positive integers $a_0, a_1, ..., a_{n-1}, a_n$ such that the first $n-1$ are all distinct, $a_0 = a_n$, and for $0 \le i \le n -1$, $a_i^{a_{i+1}}$ ends in the digits $\overline{0a_i}$ when expressed without leading zeros in base $10$.

Prove that for every given positive integer $n$, there exists a prime $p$ and an integer $m$ such that $(a)$ $p \equiv 5 \pmod 6$ $(b)$ $p \nmid n$ $(c)$ $n \equiv m^3 \pmod p$

Find a multiple of $2018$ whose decimal expansion's first four digits are $2017$.

The polynomial $W(x)=x^2+ax+b$ with integer coefficients has the following property: for every prime number $p$ there is an integer $k$ such that both $W(k)$ and $W(k+1)$ are divisible by $p$. Show that there is an integer $m$ such that $W(m)=W(m+1)=0$.

Let $a,b,c$ be positive integers such that $a|b^5, b|c^5$ and $c|a^5$. Prove that $abc|(a+b+c)^{31}$.

Does there exist a function $s\colon \mathbb{Q} \rightarrow \{-1,1\}$ such that if $x$ and $y$ are distinct rational numbers satisfying ${xy=1}$ or ${x+y\in \{0,1\}}$, then ${s(x)s(y)=-1}$? Justify your answer. [i]Proposed by Dan Brown, Canada[/i]

In an old script found in ruins of Perspolis is written: [code] This script has been finished in a year whose 13th power is 258145266804692077858261512663 You should know that if you are skilled in Arithmetics you will know the year this script is finished easily.[/code] Find the year the script is finished. Give a reason for your answer.

Determine the smallest positive integer $m$ with the property that $m^3-3m^2+2m$ is divisible by both $79$ and $83$.