For each prime $p$, construct a graph $G_p$ on $\{1,2,\ldots p\}$, where $m\neq n$ are adjacent if and only if $p$ divides $(m^{2} + 1-n)(n^{2} + 1-m)$. Prove that $G_p$ is disconnected for infinitely many $p$

Given arbitrary positive integer $ a$ larger than $ 1$, show that for any positive integer $ n$, there always exists a n-degree integral coefficient polynomial $ p(x)$, such that $ p(0)$, $ p(1)$, $ \cdots$, $ p(n)$ are pairwise distinct positive integers, and all have the form of $ 2a^k\plus{}3$, where $ k$ is also an integer.

Find all ordered pairs of integers $(a,b)$ such that $3^a + 7^b$ is a perfect square.

Does there exist a sequence of natural numbers in which every natural number occurs exactly once, such that for each $k = 1, 2, 3, \dots$ the sum of the first $k$ terms of the sequence is divisible by $k$? [i]A. Shapovalov[/i]

Does there exist a sequence of positive integers $a_1,a_2,...$ such that every positive integer occurs exactly once and that the number $\tau (na_{n+1}^n+(n+1)a_n^{n+1})$ is divisible by $n$ for all positive integer. Here $\tau (n)$ denotes the number of positive divisor of $n$.

Let $S$ be a finite set of positive integers. Assume that there are precisely 2023 ordered pairs $(x,y)$ in $S\times S$ so that the product $xy$ is a perfect square. Prove that one can find at least four distinct elements in $S$ so that none of their pairwise products is a perfect square. [i]Note:[/i] As an example, if $S=\{1,2,4\}$, there are exactly five such ordered pairs: $(1,1)$, $(1,4)$, $(2,2)$, $(4,1)$, and $(4,4)$. [i]Proposed by Sutanay Bhattacharya[/i]

For any integer $d > 0,$ let $f(d)$ be the smallest possible integer that has exactly $d$ positive divisors (so for example we have $f(1)=1, f(5)=16,$ and $f(6)=12$). Prove that for every integer $k \geq 0$ the number $f\left(2^k\right)$ divides $f\left(2^{k+1}\right).$ [i]Proposed by Suhaimi Ramly, Malaysia[/i]

When the number $2^{1000}$ is divided by $13$, the remainder in the division is $\textbf{(A) }1\qquad\textbf{(B) }2\qquad\textbf{(C) }3\qquad\textbf{(D) }7\qquad \textbf{(E) }11$

Find the least positive integer $m$ such that $105| 9^{(p^2)} -29^p +m$ for all prime numbers $p > 3$.

Let $a_1, a_2, \cdots, a_k$ be natural numbers. Let $S(n)$ be the number of solutions in nonnegative integers to $a_1x_1 + a_2x_2 + \cdots + a_kx_k = n$. Suppose $S(n) \neq 0$ for all big enough $n$. Show that for all sufficiently large $n$, we have $S(n+1) < 2S(n)$.

A number $n$ is said to be [i]nice[/i] if it exists an integer $r>0$ such that the expression of $n$ in base $r$ has all its digits equal. For example, 62 and 15 are $\emph{nice}$ because 62 is 222 in base 5, and 15 is 33 in base 4. Show that 1993 is not [i]nice[/i], but 1994 is.

Find digits $x, y, z$ such that the equality \[\sqrt{\underbrace{\overline{xx\cdots x}}_{2n \text{ times}}-\underbrace{\overline{yy\cdots y}}_{n \text{ times}}}=\underbrace{\overline{zz\cdots z}}_{n \text{ times}}\] holds for at least two values of $n \in \mathbb N$, and in that case find all $n$ for which this equality is true.

Let $N$ be the number of consecutive 0's at the right end of the decimal representation of the product $1!\times2!\times3!\times4!\cdots99!\times100!.$ Find the remainder when $N$ is divided by 1000.

For what polynomials $P(n)$ with integer coefficients can a positive integer be assigned to every lattice point in $\mathbb{R}^3$ so that for every integer $n \ge 1$, the sum of the $n^3$ integers assigned to any $n \times n \times n$ grid of lattice points is divisible by $P(n)$? [i]Proposed by Andre Arslan[/i]

Let $p \geq 7$ be a prime number and $$S = \bigg\{jp+1 : 1 \leq j \leq \frac{p-5}{2}\bigg\}.$$ Prove that at least one element of $S$ can be written as $x^2+y^2$, where $x, y$ are integers.

Show that there exist infinitely many pairs $(a, b)$ of positive integers with the property that $a+b$ divides $ab+1$, $a-b$ divides $ab-1$, $b>1$ and $a>b\sqrt{3}-1$

Prove that from every set of $n+1$ natural numbers, whose prime factors are in a given set of $n$ prime numbers, one can select several distinct numbers whose product is a perfect square.

Let $a$ and $b$ be positive integers. Prove that the numbers $an^2+b$ and $a(n+1)^2+b$ are both perfect squares only for finitely many integers $n$.

[u]Round 1[/u] [b]p1.[/b] In order to make good salad dressing, Bob needs a $0.9\%$ salt solution. If soy sauce is $15\%$ salt, how much water, in mL, does Bob need to add to $3$ mL of pure soy sauce in order to have a good salad dressing? [b]p2.[/b] Alex the Geologist is buying a canteen before he ventures into the desert. The original cost of a canteen is $\$20$, but Alex has two coupons. One coupon is $\$3$ off and the other is $10\%$ off the entire remaining cost. Alex can use the coupons in any order. What is the least amount of money he could pay for the canteen? [b]p3.[/b] Steve and Yooni have six distinct teddy bears to split between them, including exactly $1$ blue teddy bear and $1$ green teddy bear. How many ways are there for the two to divide the teddy bears, if Steve gets the blue teddy bear and Yooni gets the green teddy bear? (The two do not necessarily have to get the same number of teddy bears, but each teddy bear must go to a person.) [u]Round 2[/u] [b]p4.[/b] In the currency of Mathamania, $5$ wampas are equal to $3$ kabobs and $10$ kabobs are equal to $2$ jambas. How many jambas are equal to twenty-five wampas? [b]p5.[/b] A sphere has a volume of $81\pi$. A new sphere with the same center is constructed with a radius that is $\frac13$ the radius of the original sphere. Find the volume, in terms of $\pi$, of the region between the two spheres. [b]p6.[/b] A frog is located at the origin. It makes four hops, each of which moves it either $1$ unit to the right or $1$ unit to the left. If it also ends at the origin, how many $4$-hop paths can it take? [u]Round 3[/u] [b]p7.[/b] Nick multiplies two consecutive positive integers to get $4^5 - 2^5$ . What is the smaller of the two numbers? [b]p8.[/b] In rectangle $ABCD$, $E$ is a point on segment $CD$ such that $\angle EBC = 30^o$ and $\angle AEB = 80^o$. Find $\angle EAB$, in degrees. [b]p9.[/b] Mary’s secret garden contains clones of Homer Simpson and WALL-E. A WALL-E clone has $4$ legs. Meanwhile, Homer Simpson clones are human and therefore have $2$ legs each. A Homer Simpson clone always has $5$ donuts, while a WALL-E clone has $2$. In Mary’s secret garden, there are $184$ donuts and $128$ legs. How many WALL-E clones are there? [u]Round 4[/u] [b]p10.[/b] Including Richie, there are $6$ students in a math club. Each day, Richie hangs out with a different group of club mates, each of whom gives him a dollar when he hangs out with them. How many dollars will Richie have by the time he has hung out with every possible group of club mates? [b]p11.[/b] There are seven boxes in a line: three empty, three holding $\$10$ each, and one holding the jackpot of $\$1, 000, 000$. From the left to the right, the boxes are numbered $1, 2, 3, 4, 5, 6$ and $7$, in that order. You are told the following: $\bullet$ No two adjacent boxes hold the same contents. $\bullet$ Box $4$ is empty. $\bullet$ There is one more $\$10$ prize to the right of the jackpot than there is to the left. Which box holds the jackpot? [b]p12.[/b] Let $a$ and $b$ be real numbers such that $a + b = 8$. Let $c$ be the minimum possible value of $x^2 + ax + b$ over all real numbers $x$. Find the maximum possible value of $c$ over all such $a$ and $b$. [u]Round 5[/u] [b]p13.[/b] Let $ABCD$ be a rectangle with $AB = 10$ and $BC = 12$. Let M be the midpoint of $CD$, and $P$ be a point on $BM$ such that $BP = BC$. Find the area of $ABPD$. [b]p14.[/b] The number $19$ has the following properties: $\bullet$ It is a $2$-digit positive integer. $\bullet$ It is the two leading digits of a $4$-digit perfect square, because $1936 = 44^2$. How many numbers, including $19$, satisfy these two conditions? [b]p15.[/b] In a $3 \times 3$ grid, each unit square is colored either black or white. A coloring is considered “nice” if there is at most one white square in each row or column. What is the total number of nice colorings? Rotations and reflections of a coloring are considered distinct. (For example, in the three squares shown below, only the rightmost one has a nice coloring. [img]https://cdn.artofproblemsolving.com/attachments/e/4/e6932c822bec77aa0b07c98d1789e58416b912.png[/img] PS. You should use hide for answers. Rest rounds have been posted [url=https://artofproblemsolving.com/community/c4h2786958p24498425]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $k,m,n$ be natural numbers such that $m+k+1$ is a prime greater than $n+1$. Let $c_s=s(s+1)$. Prove that \[(c_{m+1}-c_k)(c_{m+2}-c_k)\ldots(c_{m+n}-c_k)\] is divisible by the product $c_1c_2\ldots c_n$.

Find all solutions $x,y,z$ in the positive integers of the equation $$3^x -5^y = z^2$$

Does there exist a set $ M$ with the following properties? [i](i)[/i] The set $ M$ consists of 1992 natural numbers. [i](ii)[/i] Every element in $ M$ and the sum of any number of elements have the form $ m^k$ $ (m, k \in \mathbb{N}, k \geq 2).$

Find all the natural $n$ such that $n!$ is not divisible by $n^2$.

A natural number $k$ is such that $k^2 < 2014 < (k +1)^2$. What is the largest prime factor of $k$?

Show that there is a positive integer n such that the first 1992 digits of $n^{1992}$ are 1.