Found problems: 583
2010 Indonesia TST, 4
Prove that for all integers $ m$ and $ n$, the inequality
\[ \dfrac{\phi(\gcd(2^m \plus{} 1,2^n \plus{} 1))}{\gcd(\phi(2^m \plus{} 1),\phi(2^n \plus{} 1))} \ge \dfrac{2\gcd(m,n)}{2^{\gcd(m,n)}}\]
holds.
[i]Nanang Susyanto, Jogjakarta [/i]
1990 IMO Longlists, 57
The sequence $\{u_n\}$ is defined by $u_1 = 1, u_2 = 1, u_n = u_{n-1} + 2u_{n-2} for n \geq 3$. Prove that for any positive integers $n, p \ (p > 1), u_{n+p} = u_{n+1}u_{p} + 2u_nu_{p-1}$. Also find the greatest common divisor of $u_n$ and $u_{n+3}.$
2011 Irish Math Olympiad, 3
The integers $a_0, a_1, a_2, a_3,\ldots$ are defined as follows:
$a_0 = 1$, $a_1 = 3$, and $a_{n+1} = a_n + a_{n-1}$ for all $n \ge 1$.
Find all integers $n \ge 1$ for which $na_{n+1} + a_n$ and $na_n + a_{n-1}$ share a common factor greater than $1$.
2024 EGMO, 3
We call a positive integer $n{}$ [i]peculiar[/i] if, for any positive divisor $d{}$ of $n{}$ the integer $d(d + 1)$ divides $n(n + 1).$ Prove that for any four different peculiar positive integers $A, B, C$ and $D{}$ the following holds:
\[\gcd(A, B, C, D) = 1.\]
1996 Spain Mathematical Olympiad, 1
The natural numbers $a$ and $b$ are such that $ \frac{a+1}{b}+ \frac{b+1}{a}$ is an integer. Show that the greatest common divisor of a and b is not greater than $\sqrt{a+b}$.
2013 IFYM, Sozopol, 7
Let $T$ be a set of natural numbers, each of which is greater than 1. A subset $S$ of $T$ is called “good”, if for each $t\in T$ there exists $s\in S$, for which $gcd(t,s)>1$. Prove that the number of "good" subsets of $T$ is odd.
2008 All-Russian Olympiad, 7
A natural number is written on the blackboard. Whenever number $ x$ is written, one can write any of the numbers $ 2x \plus{} 1$ and $ \frac {x}{x \plus{} 2}$. At some moment the number $ 2008$ appears on the blackboard. Show that it was there from the very beginning.
1992 India Regional Mathematical Olympiad, 2
If $\frac{1}{a} + \frac{1}{b} = \frac{1}{c}$, where $a,b,c$ are positive integers with no common factor, prove that $(a +b)$ is a square.
2001 Tournament Of Towns, 1
Do there exist postive integers $a_1<a_2<\cdots<a_{100}$ such that for $2\le k\le100$ the greatest common divisor of $a_{k-1}$ and $a_k$ is greater than the greatest common divisor of $a_k$ and $a_{k+1}$?
1982 Dutch Mathematical Olympiad, 4
Determine $ \gcd (n^2\plus{}2,n^3\plus{}1)$ for $ n\equal{}9^{753}$.
2016 Canadian Mathematical Olympiad Qualification, 6
Determine all ordered triples of positive integers $(x, y, z)$ such that $\gcd(x+y, y+z, z+x) > \gcd(x, y, z)$.
2016 Argentina National Olympiad Level 2, 5
For each pair $a, \,b$ of coprime natural numbers, let $d_{a,\,b}$ be the greatest common divisor of $51a + b$ and $a + 51b$. Find the maximum possible value of $d_{a,\,b}$.
2012 USAMTS Problems, 3
Let $f(x) = x-\tfrac1{x}$, and defi ne $f^1(x) = f(x)$ and $f^n(x) = f(f^{n-1}(x))$ for $n\ge2$. For each $n$, there is a minimal degree $d_n$ such that there exist polynomials $p$ and $q$ with $f^n(x) = \tfrac{p(x)}{q(x)}$ and the degree of $q$ is equal to $d_n$. Find $d_n$.
1996 Rioplatense Mathematical Olympiad, Level 3, 6
Find all integers $k$ for which, there is a function $f: N \to Z$ that satisfies:
(i) $f(1995) = 1996$
(ii) $f(xy) = f(x) + f(y) + kf(m_{xy})$ for all natural numbers $x, y$,where$ m_{xy}$ denotes the greatest common divisor of the numbers $x, y$.
Clarification: $N = \{1,2,3,...\}$ and $Z = \{...-2,-1,0,1,2,...\}$ .
2016 India IMO Training Camp, 3
For a finite set $A$ of positive integers, a partition of $A$ into two disjoint nonempty subsets $A_1$ and $A_2$ is $\textit{good}$ if the least common multiple of the elements in $A_1$ is equal to the greatest common divisor of the elements in $A_2$. Determine the minimum value of $n$ such that there exists a set of $n$ positive integers with exactly $2015$ good partitions.
PEN H Problems, 73
Find all pairs $(a,b)$ of positive integers that satisfy the equation \[a^{b^{2}}= b^{a}.\]
1983 IMO Longlists, 56
Consider the expansion
\[(1 + x + x^2 + x^3 + x^4)^{496} = a_0 + a_1x + \cdots + a_{1984}x^{1984}.\]
[b](a)[/b] Determine the greatest common divisor of the coefficients $a_3, a_8, a_{13}, \ldots , a_{1983}.$
[b](b)[/b] Prove that $10^{340 }< a_{992} < 10^{347}.$
2007 Princeton University Math Competition, 5
Let $f_n$ be the Fibonacci numbers, defined by $f_0 = 1$, $f_1 = 1$, and $f_n = f_{n-1}+f_{n-2}$. For each $i$, $1 \le i \le 200$, we calculate the greatest common divisor $g_i$ of $f_i$ and $f_{2007}$. What is the sum of the distinct values of $g_i$?
2005 AMC 12/AHSME, 12
A line passes through $ A(1,1)$ and $ B(100,1000)$. How many other points with integer coordinates are on the line and strictly between $ A$ and $ B$?
$ \textbf{(A)}\ 0\qquad \textbf{(B)}\ 2\qquad \textbf{(C)}\ 3\qquad \textbf{(D)}\ 8\qquad \textbf{(E)}\ 9$
2006 Thailand Mathematical Olympiad, 12
Let $a_n = 2^{3n-1} + 3^{6n-2} + 5^{6n-3}$. Compute gcd$(a_1, a_2, ... , a_{25})$
2021 Simon Marais Mathematical Competition, A2
Define the sequence of integers $a_1, a_2, a_3, \ldots$ by $a_1 = 1$, and
\[ a_{n+1} = \left(n+1-\gcd(a_n,n) \right) \times a_n \]
for all integers $n \ge 1$.
Prove that $\frac{a_{n+1}}{a_n}=n$ if and only if $n$ is prime or $n=1$.
[i]Here $\gcd(s,t)$ denotes the greatest common divisor of $s$ and $t$.[/i]
2019 Nigerian Senior MO Round 3, 3
Show that $$5^{2019} \mid \Sigma^{5^{2019}}_{k=1}3^{gcd (5^{2019},k)}$$
2021 Durer Math Competition (First Round), 4
Determine all triples of positive integers $a, b, c$ that satisfy
a) $[a, b] + [a, c] + [b, c] = [a, b, c]$.
b) $[a, b] + [a, c] + [b, c] = [a, b, c] + (a, b, c)$.
Remark: Here $[x, y$] denotes the least common multiple of positive integers $x$ and $y$, and $(x, y)$ denotes their greatest common divisor.
1988 IMO Longlists, 65
The Fibonacci sequence is defined by \[ a_{n+1} = a_n + a_{n-1}, n \geq 1, a_0 = 0, a_1 = a_2 = 1. \] Find the greatest common divisor of the 1960-th and 1988-th terms of the Fibonacci sequence.
2022 Thailand TSTST, 2
Let $S$ be an infinite set of positive integers, such that there exist four pairwise distinct $a,b,c,d \in S$ with $\gcd(a,b) \neq \gcd(c,d)$. Prove that there exist three pairwise distinct $x,y,z \in S$ such that $\gcd(x,y)=\gcd(y,z) \neq \gcd(z,x)$.