Found problems: 583
1985 ITAMO, 13
The numbers in the sequence 101, 104, 109, 116, $\dots$ are of the form $a_n = 100 + n^2$, where $n = 1$, 2, 3, $\dots$. For each $n$, let $d_n$ be the greatest common divisor of $a_n$ and $a_{n + 1}$. Find the maximum value of $d_n$ as $n$ ranges through the positive integers.
2006 MOP Homework, 3
Prove that the following inequality holds with the exception of finitely many positive integers $n$:
$\sum^{n}_{i=1}\sum^{n}_{j=1}gcd(i,j)>4n^2$.
2004 Czech-Polish-Slovak Match, 6
On the table there are $k \ge 3$ heaps of $1, 2, \dots , k$ stones. In the first step, we choose any three of the heaps, merge them into a single new heap, and remove $1$ stone from this new heap. Thereafter, in the $i$-th step ($i \ge 2$) we merge some three heaps containing more than $i$ stones in total and remove $i$ stones from the new heap. Assume that after a number of steps a single heap of $p$ stones remains on the table. Show that the number $p$ is a perfect square if and only if so are both $2k + 2$ and $3k + 1$. Find the least $k$ with this property.
1996 Flanders Math Olympiad, 2
Determine the gcd of all numbers of the form $p^8-1$, with p a prime above 5.
2006 China Team Selection Test, 3
Let $a_{i}$ and $b_{i}$ ($i=1,2, \cdots, n$) be rational numbers such that for any real number $x$ there is:
\[x^{2}+x+4=\sum_{i=1}^{n}(a_{i}x+b)^{2}\]
Find the least possible value of $n$.
2010 USA Team Selection Test, 6
Let $T$ be a finite set of positive integers greater than 1. A subset $S$ of $T$ is called [i]good[/i] if for every $t \in T$ there exists some $s \in S$ with $\gcd(s, t) > 1$. Prove that the number of good subsets of $T$ is odd.
1981 All Soviet Union Mathematical Olympiad, 322
Find $n$ such that each of the numbers $n,(n+1),...,(n+20)$ has the common divider greater than one with the number $30030 = 2\cdot 3\cdot 5\cdot 7\cdot 11\cdot 13$.
2020 Hong Kong TST, 3
Given a list of integers $2^1+1, 2^2+1, \ldots, 2^{2019}+1$, Adam chooses two different integers from the list and computes their greatest common divisor. Find the sum of all possible values of this greatest common divisor.
2005 Taiwan TST Round 1, 3
Find all positive integer triples $(x,y,z)$ such that
$x<y<z$, $\gcd (x,y)=6$, $\gcd (y,z)=10$, $\gcd (x,z)=8$, and lcm$(x,y,z)=2400$.
Note that the problems of the TST are not arranged in difficulty (Problem 1 of day 1 was probably the most difficult!)
2015 China Girls Math Olympiad, 4
Let $g(n)$ be the greatest common divisor of $n$ and $2015$. Find the number of triples $(a,b,c)$ which satisfies the following two conditions:
$1)$ $a,b,c \in$ {$1,2,...,2015$};
$2)$ $g(a),g(b),g(c),g(a+b),g(b+c),g(c+a),g(a+b+c)$ are pairwise distinct.
2014 HMNT, 3
Compute the greatest common divisor of $4^8 - 1$ and $8^{12} - 1$.
2015 Indonesia MO Shortlist, N7
For every natural number $a$ and $b$, define the notation $[a,b]$ as the least common multiple of $a $ and $b$ and the notation $(a,b)$ as the greatest common divisor of $a$ and $b$. Find all $n \in \mathbb{N}$ that satisfies
\[
4 \sum_{k=1}^{n} [n,k] = 1 + \sum_{k=1}^{n} (n,k) + 2n^2 \sum_{k=1}^{n} \frac{1}{(n,k)}
\]
2023 AMC 12/AHSME, 15
Suppose $a$, $b$, and $c$ are positive integers such that \[\frac{a}{14}+\frac{b}{15}=\frac{c}{210}.\] Which of the following statements are necessarily true?
I. If $\gcd(a,14)=1$ or $\gcd(b,15)=1$ or both, then $\gcd(c,210)=1$.
II. If $\gcd(c,210)=1$, then $\gcd(a,14)=1$ or $\gcd(b,15)=1$ or both.
III. $\gcd(c,210)=1$ if and only if $\gcd(a,14)=\gcd(b,15)=1$.
$\textbf{(A)}~\text{I, II, and III}\qquad\textbf{(B)}~\text{I only}\qquad\textbf{(C)}~\text{I and II only}\qquad\textbf{(D)}~\text{III only}\qquad\textbf{(E)}~\text{II and III only}$
2019-2020 Fall SDPC, 1
Show that there exists some [b]positive[/b] integer $k$ with $$\gcd(2012,2020)=\gcd(2012+k,2020)$$$$=\gcd(2012,2020+k)=\gcd(2012+k,2020+k).$$
PEN O Problems, 39
Find the smallest positive integer $n$ for which there exist $n$ different positive integers $a_{1}, a_{2}, \cdots, a_{n}$ satisfying [list] [*] $\text{lcm}(a_1,a_2,\cdots,a_n)=1985$,[*] for each $i, j \in \{1, 2, \cdots, n \}$, $gcd(a_i,a_j)\not=1$, [*] the product $a_{1}a_{2} \cdots a_{n}$ is a perfect square and is divisible by $243$, [/list] and find all such $n$-tuples $(a_{1}, \cdots, a_{n})$.
2023 Regional Competition For Advanced Students, 4
Determine all pairs $(x, y)$ of positive integers such that for $d = gcd(x, y)$ the equation $$xyd = x + y + d^2$$
holds.
[i](Walther Janous)[/i]
2011 Kyiv Mathematical Festival, 1
Solve the equation $m^{gcd(m,n)} = n^{lcm(m,n)}$ in positive integers, where gcd($m, n$) – greatest common
divisor of $m,n$, and lcm($m, n$) – least common multiple of $m,n$.
2004 Iran MO (3rd Round), 21
$ a_1, a_2, \ldots, a_n$ are integers, not all equal. Prove that there exist infinitely many prime numbers $ p$ such that for some $ k$
\[ p\mid a_1^k \plus{} \dots \plus{} a_n^k.\]
2021 JHMT HS, 3
Let $B=\{2^1,2^2,2^3,\dots,2^{21}\}.$ Find the remainder when
\[ \sum_{m, n \in B: \ m<n}\gcd(m,n) \]
is divided by $1000,$ where the sum is taken over all pairs of elements $(m,n)$ of $B$ such that $m<n.$
2022 Kyiv City MO Round 2, Problem 1
Find all triples $(a, b, c)$ of positive integers for which $a + (a, b) = b + (b, c) = c + (c, a)$.
Here $(a, b)$ denotes the greatest common divisor of integers $a, b$.
[i](Proposed by Mykhailo Shtandenko)[/i]
2009 Belarus Team Selection Test, 3
Let $ a_0$, $ a_1$, $ a_2$, $ \ldots$ be a sequence of positive integers such that the greatest common divisor of any two consecutive terms is greater than the preceding term; in symbols, $ \gcd (a_i, a_{i \plus{} 1}) > a_{i \minus{} 1}$. Prove that $ a_n\ge 2^n$ for all $ n\ge 0$.
[i]Proposed by Morteza Saghafian, Iran[/i]
2012 International Zhautykov Olympiad, 3
Find all integer solutions of the equation the equation $2x^2-y^{14}=1$.
2004 USAMO, 2
Suppose $a_1, \dots, a_n$ are integers whose greatest common divisor is 1. Let $S$ be a set of integers with the following properties:
(a) For $i=1, \dots, n$, $a_i \in S$.
(b) For $i,j = 1, \dots, n$ (not necessarily distinct), $a_i - a_j \in S$.
(c) For any integers $x,y \in S$, if $x+y \in S$, then $x-y \in S$.
Prove that $S$ must be equal to the set of all integers.
2022 Mexican Girls' Contest, 1
Determine all finite nonempty sets $S$ of positive integers satisfying
\[ {i+j\over (i,j)}\qquad\mbox{is an element of S for all i,j in S}, \]
where $(i,j)$ is the greatest common divisor of $i$ and $j$.
2007 Singapore Team Selection Test, 3
Let $A,B,C$ be $3$ points on the plane with integral coordinates. Prove that there exists a point $P$ with integral coordinates distinct from $A,B$ and $C$ such that the interiors of the segments $PA,PB$ and $PC$ do not contain points with integral coordinates.