Let $a > 1$ be a positive integer and $d > 1$ be a positive integer coprime to $a$. Let $x_1=1$, and for $k\geq 1$, define $$x_{k+1} = \begin{cases} x_k + d &\text{if } a \text{ does not divide } x_k \\ x_k/a & \text{if } a \text{ divides } x_k \end{cases}$$ Find, in terms of $a$ and $d$, the greatest positive integer $n$ for which there exists an index $k$ such that $x_k$ is divisible by $a^n$.

Let $n$ be a positive integer with $n = p^{2010}q^{2010}$ for two odd primes $p$ and $q$. Show that there exist exactly $\sqrt[2010]{n}$ positive integers $x \le n$ such that $p^{2010}|x^p - 1$ and $q^{2010}|x^q - 1$.

Let $M \geq 1$ be a real number. Determine all natural numbers $n$ for which there exist distinct natural numbers $a$, $b$, $c > M$, such that $n = (a,b) \cdot (b,c) + (b,c) \cdot (c,a) + (c,a) \cdot (a,b)$ (where $(x,y)$ denotes the greatest common divisor of natural numbers $x$ and $y$).

Find all four-digit perfect squares such that: $\bullet$ All your figures are less than $9$. $\bullet$ By increasing each of its digits by one unit, the resulting number is again a perfect square.

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

Define a [b]ring[/b] in the plane to be the set of points at a distance of at least $r$ and at most $R$ from a specific point $O$, where $r<R$ are positive real numbers. Rings are determined by the three parameters $(O, R, r)$. The area of a ring is labeled $S$. A point in the plane for which both its coordinates are integers is called an integer point. [b]a)[/b] For each positive integer $n$, show that there exists a ring not containing any integer point, for which $S>3n$ and $R<2^{2^n}$. [b]b)[/b] Show that each ring satisfying $100\cdot R<S^2$ contains an integer point.

Find the least natural number whose last digit is 7 such that it becomes 5 times larger when this last digit is carried to the beginning of the number.

The [i]Collatz's function[i] is a mapping $f:\mathbb{Z}_+\to\mathbb{Z}_+$ satisfying \[ f(x)=\begin{cases} 3x+1,& \mbox{as }x\mbox{ is odd}\\ x/2, & \mbox{as }x\mbox{ is even.}\\ \end{cases} \] In addition, let us define the notation $f^1=f$ and inductively $f^{k+1}=f\circ f^k,$ or to say in another words, $f^k(x)=\underbrace{f(\ldots (f}_{k\text{ times}}(x)\ldots ).$ Prove that there is an $x\in\mathbb{Z}_+$ satisfying \[f^{40}(x)> 2012x.\]

Let $q$ be a monic polynomial with integer coefficients. Prove that there exists a constant $C$ depending only on polynomial $q$ such that for an arbitrary prime number $p$ and an arbitrary positive integer $N \leq p$ the congruence $n! \equiv q(n) \pmod p$ has at most $CN^\frac {2}{3}$ solutions among any $N$ consecutive integers.

A sequence $\{a_n\} $ satisfies $a_1$ is a positive integer and $a_{n+1}$ is the largest odd integer that divides $2^n-1+a_n$ for all $n\geqslant 1$. Given a positive integer $r$ which is greater than $1$. Is it possible that there exists infinitely many pairs of ordered positive integers $(m,n)$ for which $m>n$ and $a_m = ra_n$? In other words, if you successfully find [b]an[/b] $a_1$ that yields infinitely many pairs of $(m,n)$ which work fine, you win and the answer is YES. Otherwise you have to proof NO for every possible $a_1$. @below, XMO stands for Xueersi Mathematical Olympiad, where Xueersi (学而思) is a famous tutoring camp in China.

Find the smallest positive integer $G$ such that there exist distinct positive integers $a, b, c$ with the following properties: $\: \bullet \: \gcd(a, b, c) = G$. $\: \bullet \: \text{lcm}(a, b) = \text{lcm}(a, c) = \text{lcm}(b, c)$. $\: \bullet \: \frac{1}{a} + \frac{1}{b}, \frac{1}{a} + \frac{1}{c},$ and $\frac{1}{b} + \frac{1}{c}$ are reciprocals of integers. $\: \bullet \: \gcd(a, b) + \gcd(a, c) + \gcd(b, c) = 16G$.

Let $N$ be the number of sequences of positive integers greater than $ 1$ where the product of all of the terms of the sequence is $12^{64}$. If $N$ can be expressed as $a(2^b)$ ), where $a$ is an odd positive integer, determine $b$.

Prove that there exists infinitely many positive integers $n$ such that equation $(x+y+z)^3=n^2xyz$ has solution $(x,y,z)$ in set $\mathbb{N}^3$

There are $100$ boxes that were labeled with the numbers $00$, $01$, $02$,$…$, $99$ . The numbers $000$, $001$, $002$, $…$, $999$ were written on a thousand cards, one on each card. Placing a card in a box is permitted if the box number can be obtained by removing one of the digits from the card number. For example, it is allowed to place card $037$ in box $07$, but it is not allowed to place the card $156$ in box $65$.Can it happen that after placing all the cards in the boxes, there will be exactly $50$ empty boxes? If the answer is yes, indicate how the cards are placed in the boxes; If the answer is no, explain why it is impossible

Knowing that the numbers $p, 3p+2, 5p+4, 7p+6, 9p+8$, and $11p+10$ are all primes, prove that $6p+11$ is a composite number.

Let $b$ be a positive integer such that $\gcd(b,6)=1$. Show that there are positive integers $x$ and $y$ such that $\frac1x+\frac1y=\frac3b$ if and only if $b$ is divisible by some prime number of form $6k-1$.

For any natural number $ n, $ denote $ x_n $ as being the number of natural numbers of $ n $ digits that are divisible by $ 4 $ and formed only with the digits $ 0,1,2 $ or $ 6. $ [b]a)[/b] Calculate $ x_1,x_2,x_3,x_4. $ [b]b)[/b] Find the natural number $ m $ such that $$ 1+\left\lfloor \frac{x_2}{x_1}\right\rfloor +\left\lfloor \frac{x_3}{x_2}\right\rfloor +\left\lfloor \frac{x_4}{x_3}\right\rfloor +\cdots +\left\lfloor \frac{x_{m+1}}{x_m}\right\rfloor =2016 , $$ where $ \lfloor\rfloor $ is the usual integer part.

Show that the equation $a^{2}b^{2}+b^{2}c^{2}+3b^{2}-c^{2}-a^{2}=2005$ has no integer solutions. [i]Arnoldo Aguilar, El Salvador[/i]

The number $125$ can be written as a sum of some pairwise coprime integers larger than $1$. Determine the largest number of terms that the sum may have.

Find all pairs $(a,b)$ of positive integers such that $a^{2017}+b$ is a multiple of $ab$.

Let $p$ be a prime number, and define a sequence by: $x_i=i$ for $i=,0,1,2...,p-1$ and $x_n=x_{n-1}+x_{n-p}$ for $n \geq p$ Find the remainder when $x_{p^3}$ is divided by $p$.

[b]p1.[/b] Suppose that $a \oplus b = ab - a - b$. Find the value of $$((1 \oplus 2) \oplus (3 \oplus 4)) \oplus 5.$$ [b]p2.[/b] Neethin scores a $59$ on his number theory test. He proceeds to score a $17$, $23$, and $34$ on the next three tests. What score must he achieve on his next test to earn an overall average of $60$ across all five tests? [b]p3.[/b] Consider a triangle with side lengths $28$ and $39$. Find the number of possible integer lengths of the third side. [b]p4.[/b] Nithin is thinking of a number. He says that it is an odd two digit number where both of its digits are prime, and that the number is divisible by the sum of its digits. What is the sum of all possible numbers Nithin might be thinking of? [b]p5.[/b] Dora sees a fire burning on the dance floor. She calls her friends to warn them to stay away. During the first pminute Dora calls Poonam and Serena. During the second minute, Poonam and Serena call two more friends each, and so does Dora. This process continues, with each person calling two new friends every minute. How many total people would know of the fire after $6$ minutes? [b]p6.[/b] Charlotte writes all the positive integers $n$ that leave a remainder of $2$ when $2018$ is divided by $n$. What is the sum of the numbers that she writes? [b]p7.[/b] Consider the following grid. Stefan the bug starts from the origin, and can move either to the right, diagonally in the positive direction, or upwards. In how many ways can he reach $(5, 5)$? [img]https://cdn.artofproblemsolving.com/attachments/9/9/b9fdfdf604762ec529a1b90d663e289b36b3f2.png[/img] [b]p8.[/b] Let $a, b, c$ be positive numbers where $a^2 + b^2 + c^2 = 63$ and $2a + 3b + 6c = 21\sqrt7$. Find $\left( \frac{a}{c}\right)^{\frac{a}{b}} $. [b]p9.[/b] What is the sum of the distinct prime factors of $12^5 + 12^4 + 1$? [b]p10.[/b] Allen starts writing all permutations of the numbers $1$, $2$, $3$, $4$, $5$, $6$ $7$, $8$, $9$, $10$ on a blackboard. At one point he writes the permutation $9$, $4$, $3$, $1$, $2$, $5$, $6$, $7$, $8$, $10$. David points at the permutation and observes that for any two consecutive integers $i$ and $i+1$, all integers that appear in between these two integers in the permutation are all less than $i$. For example, $4$ and $5$ have only the numbers $3$, $1$, $2$ in between them. How many of the $10!$ permutations on the board satisfy this property that David observes? [b]p11.[/b] (Estimation) How many positive integers less than $2018$ can be expressed as the sum of $3$ square numbers? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Prove that for some positive integer \(N\), \(N\) points can be chosen on a circle such that there are at least \(1000N^2\) unordered quadruples \((A,B,C,D)\) of distinct selected points for which \(\displaystyle \frac{AC}{BC} = \frac{AD}{BD}\).

For every real number $x$, let $||x||$ denote the distance between $x$ and the nearest integer. Prove that for every pair $(a, b)$ of positive integers there exist an odd prime $p$ and a positive integer $k$ satisfying \[\displaystyle\left|\left|\frac{a}{p^k}\right|\right|+\left|\left|\frac{b}{p^k}\right|\right|+\left|\left|\frac{a+b}{p^k}\right|\right|=1.\] [i]Proposed by Geza Kos, Hungary[/i]

Let $K$ be a positive integer such that there exist a triple of positive integers $(x,y,z)$ such that \[x^3+Ky , y^3 + Kz, \text{and } z^3 + Kx\] are all perfect cubes. (a) Prove that $K \ne 2$ and $K \ne 4$ (b) Find the minimum value of $K$ that satisfies. [i]Proposed by Muhammad Afifurrahman[/i]