Let $p_1,p_2,\ldots,p_n$ be distinct primes greater than $3$. Show that $2^{p_1p_2\cdots p_n}+1$ has at least $4^n$ divisors.

Find all positive integers $n$ with the following property: the $k$ positive divisors of $n$ have a permutation $(d_1,d_2,\ldots,d_k)$ such that for $i=1,2,\ldots,k$, the number $d_1+d_2+\cdots+d_i$ is a perfect square.

Find all pairs $ (a,b)$ of positive integers that satisfy the equation: $ a^{b^2} \equal{} b^a$.

Denote by $\mathbb{N}$ the set of all positive integers. Find all functions $f:\mathbb{N}\rightarrow \mathbb{N}$ such that for all positive integers $m$ and $n$, the integer $f(m)+f(n)-mn$ is nonzero and divides $mf(m)+nf(n)$. [i]Proposed by Dorlir Ahmeti, Albania[/i]

Let $a, b$ be positive integers and $p, q$ be prime numbers for which $p \nmid q - 1$ and $q \mid a^p - b^p$. Prove that $q \mid a - b$.

Consider infinite sequences $a_1,a_2,\dots$ of positive integers satisfying $a_1=1$ and $$a_n \mid a_k+a_{k+1}+\dots+a_{k+n-1}$$ for all positive integers $k$ and $n.$ For a given positive integer $m,$ find the maximum possible value of $a_{2m}.$ [i]Proposed by Krit Boonsiriseth[/i]

[b]p1.[/b] Vivek has three letters to send out. Unfortunately, he forgets which letter is which after sealing the envelopes and before putting on the addresses. He puts the addresses on at random sends out the letters anyways. What are the chances that none of the three recipients get their intended letter? [b]p2.[/b] David is a horrible bowler. Luckily, Logan and Christy let him use bumpers. The bowling lane is $2$ meters wide, and David's ball travels a total distance of $24$ meters. How many times did David's bowling ball hit the bumpers, if he threw it from the middle of the lane at a $60^o$ degree angle to the horizontal? [b]p3.[/b] Find $\gcd \,(212106, 106212)$. [b]p4.[/b] Michael has two fair dice, one six-sided (with sides marked $1$ through $6$) and one eight-sided (with sides marked $1-8$). Michael play a game with Alex: Alex calls out a number, and then Michael rolls the dice. If the sum of the dice is equal to Alex's number, Michael gives Alex the amount of the sum. Otherwise Alex wins nothing. What number should Alex call to maximize his expected gain of money? [b]p5.[/b] Suppose that $x$ is a real number with $\log_5 \sin x + \log_5 \cos x = -1$. Find $$|\sin^2 x \cos x + \cos^2 x \sin x|.$$ [b]p6.[/b] What is the volume of the largest sphere that FIts inside a regular tetrahedron of side length $6$? [b]p7.[/b] An ant is wandering on the edges of a cube. At every second, the ant randomly chooses one of the three edges incident at one vertex and walks along that edge, arriving at the other vertex at the end of the second. What is the probability that the ant is at its starting vertex after exactly $6$ seconds? [b]p8.[/b] Determine the smallest positive integer $k$ such that there exist $m, n$ non-negative integers with $m > 1$ satisfying $$k = 2^{2m+1} - n^2.$$ [b]p9.[/b] For $A,B \subset Z$ with $A,B \ne \emptyset$, define $A + B = \{a + b|a \in A, b \in B\}$. Determine the least $n$ such that there exist sets $A,B$ with $|A| = |B| = n$ and $A + B = \{0, 1, 2,..., 2012\}$. [b]p10.[/b] For positive integers $n \ge 1$, let $\tau (n)$ and $\sigma (n)$ be, respectively, the number of and sum of the positive integer divisors of $n$ (including $1$ and $n$). For example, $\tau (1) = \sigma (1) = 1$ and $\tau (6) = 4$, $\sigma (6) = 12$. Find the number of positive integers $n \le 100$ such that $$\sigma (n) \le (\sqrt{n} - 1)^2 +\tau (n)\sqrt{n}.$$ PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $S$ be a set of integers (not necessarily positive) such that (a) there exist $a,b \in S$ with $\gcd(a,b)=\gcd(a-2,b-2)=1$; (b) if $x$ and $y$ are elements of $S$ (possibly equal), then $x^2-y$ also belongs to $S$. Prove that $S$ is the set of all integers.

Let $a,b$ be two positive integers and $a>b$.We know that $\gcd(a-b,ab+1)=1$ and $\gcd(a+b,ab-1)=1$. Prove that $(a-b)^2+(ab+1)^2$ is not a perfect square.

Let $c \ge 1$ be an integer. Define a sequence of positive integers by $a_1 = c$ and \[a_{n+1}=a_n^3-4c\cdot a_n^2+5c^2\cdot a_n+c\] for all $n\ge 1$. Prove that for each integer $n \ge 2$ there exists a prime number $p$ dividing $a_n$ but none of the numbers $a_1 , \ldots , a_{n -1}$ . [i]Proposed by Austria[/i]

Let $m$ and $n$ be positive integers with $\gcd(m, n) = 1$, and let \[a_k = \left\lfloor \frac{mk}{n} \right\rfloor - \left\lfloor \frac{m(k-1)}{n} \right\rfloor\] for $k = 1, 2, \dots, n$. Suppose that $g$ and $h$ are elements in a group $G$ and that \[gh^{a_1} gh^{a_2} \cdots gh^{a_n} = e,\] where $e$ is the identity element. Show that $gh = hg$. (As usual, $\lfloor x \rfloor$ denotes the greatest integer less than or equal to $x$.)

Amy and Bob choose numbers from $0,1,2,\cdots,81$ in turn and Amy choose the number first. Every time the one who choose number chooses one number from the remaining numbers. When all $82$ numbers are chosen, let $A$ be the sum of all the numbers Amy chooses, and let $B$ be the sum of all the numbers Bob chooses. During the process, Amy tries to make $\gcd(A,B)$ as great as possible, and Bob tries to make $\gcd(A,B)$ as little as possible. Suppose Amy and Bob take the best strategy of each one, respectively, determine $\gcd(A,B)$ when all $82$ numbers are chosen.

Let $S$ be a planar region. A $\emph{domino-tiling}$ of $S$ is a partition of $S$ into $1\times2$ rectangles. (For example, a $2\times3$ rectangle has exactly $3$ domino-tilings, as shown below.) [asy] import graph; size(7cm); pen dps = linewidth(0.7); defaultpen(dps); draw((0,0)--(3,0)--(3,2)--(0,2)--cycle, linewidth(2)); draw((4,0)--(4,2)--(7,2)--(7,0)--cycle, linewidth(2)); draw((8,0)--(8,2)--(11,2)--(11,0)--cycle, linewidth(2)); draw((1,0)--(1,2)); draw((2,1)--(3,1)); draw((0,1)--(2,1), linewidth(2)); draw((2,0)--(2,2), linewidth(2)); draw((4,1)--(7,1)); draw((5,0)--(5,2), linewidth(2)); draw((6,0)--(6,2), linewidth(2)); draw((8,1)--(9,1)); draw((10,0)--(10,2)); draw((9,0)--(9,2), linewidth(2)); draw((9,1)--(11,1), linewidth(2)); [/asy] The rectangles in the partition of $S$ are called $\emph{dominoes}$. (a) For any given positive integer $n$, find a region $S_n$ with area at most $2n$ that has exactly $n$ domino-tilings. (b) Find a region $T$ with area less than $50000$ that has exactly $100002013$ domino-tilings.

Let $H = \{ \lfloor i\sqrt{2}\rfloor : i \in \mathbb Z_{>0}\} = \{1,2,4,5,7,\dots \}$ and let $n$ be a positive integer. Prove that there exists a constant $C$ such that, if $A\subseteq \{1,2,\dots, n\}$ satisfies $|A| \ge C\sqrt{n}$, then there exist $a,b\in A$ such that $a-b\in H$. (Here $\mathbb Z_{>0}$ is the set of positive integers, and $\lfloor z\rfloor$ denotes the greatest integer less than or equal to $z$.)