Found problems: 97
2023 Bundeswettbewerb Mathematik, 1
Determine the greatest common divisor of the numbers $p^6-7p^2+6$ where $p$ runs through the prime numbers $p \ge 11$.
2023 Indonesia TST, N
Given an integer $a>1$. Prove that there exists a sequence of positive integers
\[ n_1, n_2, n_3, \ldots \]
Such that
\[ \gcd(a^{n_i+1} + a^{n_i} - 1, \ a^{n_j + 1} + a^{n_j} - 1) =1 \] For every $i \neq j$.
2019 Dutch IMO TST, 3
Let $n$ be a positive integer. Determine the maximum value of $gcd(a, b) + gcd(b, c) + gcd(c, a)$ for positive integers $a, b, c$ such that $a + b + c = 5n$.
2015 Romania Team Selection Tests, 1
Let $a$ be an integer and $n$ a positive integer . Show that the sum :
$$\sum_{k=1}^{n} a^{(k,n)}$$ is divisible by $n$ , where $(x,y)$ is the greatest common divisor of the numbers $x$ and $y$ .
1966 Dutch Mathematical Olympiad, 2
For all $n$, $t_{n+1} = 2(t_n)^2 - 1$. Prove that gcd $(t_n,t_m) = 1$ if $n \ne m$.
2013 Peru MO (ONEM), 2
The positive integers $a, b, c$ are such that
$$gcd \,\,\, (a, b, c) = 1,$$
$$gcd \,\,\,(a, b + c) > 1,$$
$$gcd \,\,\,(b, c + a) > 1,$$
$$gcd \,\,\,(c, a + b) > 1.$$
Determine the smallest possible value of $a + b + c$.
Clarification: gcd stands for greatest common divisor.
2023 Austrian MO Regional Competition, 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]
2023 Indonesia TST, N
Given an integer $a>1$. Prove that there exists a sequence of positive integers
\[ n_1, n_2, n_3, \ldots \]
Such that
\[ \gcd(a^{n_i+1} + a^{n_i} - 1, \ a^{n_j + 1} + a^{n_j} - 1) =1 \] For every $i \neq j$.
2016 Dutch Mathematical Olympiad, 3
Find all possible triples $(a, b, c)$ of positive integers with the following properties:
• $gcd(a, b) = gcd(a, c) = gcd(b, c) = 1$,
• $a$ is a divisor of $a + b + c$,
• $b$ is a divisor of $a + b + c$,
• $c$ is a divisor of $a + b + c$.
(Here $gcd(x,y)$ is the greatest common divisor of $x$ and $y$.)
1999 Swedish Mathematical Competition, 6
$S$ is any sequence of at least $3$ positive integers. A move is to take any $a, b$ in the sequence such that neither divides the other and replace them by gcd $(a,b)$ and lcm $(a,b)$. Show that only finitely many moves are possible and that the final result is independent of the moves made, except possibly for order.
2005 Switzerland - Final Round, 4
Determine all sets $M$ of natural numbers such that for every two (not necessarily different) elements $a, b$ from $M$ , $$\frac{a + b}{gcd(a, b)}$$ lies in $M$.
2019 Centers of Excellency of Suceava, 2
Let $ \left( s_n \right)_{n\ge 1 } $ be a sequence with $ s_1 $ and defined recursively as $ s_{n+1}=s_n^2-s_n+1. $
Prove that any two terms of this sequence are coprime.
[i]Dan Nedeianu[/i]
KoMaL A Problems 2023/2024, A. 882
Let $H_1, H_2,\ldots, H_m$ be non-empty subsets of the positive integers, and let $S$ denote their union. Prove that
\[\sum_{i=1}^m \sum_{(a,b)\in H_i^2}\gcd(a,b)\ge\frac1m \sum_{(a,b)\in S^2}\gcd(a,b).\]
[i]Proposed by Dávid Matolcsi, Berkeley[/i]
2016 IFYM, Sozopol, 7
We are given a non-infinite sequence $a_1,a_2…a_n$ of natural numbers. While it is possible, on each turn are chosen two arbitrary indexes $i<j$ such that $a_i \nmid a_j$, and then $a_i$ and $a_j$ are changed with their $gcd$ and $lcm$. Prove that this process is non-infinite and the created sequence doesn’t depend on the made choices.
2019 Dutch BxMO TST, 4
Do there exist a positive integer $k$ and a non-constant sequence $a_1, a_2, a_3, ...$ of positive integers such that $a_n = gcd(a_{n+k}, a_{n+k+1})$ for all positive integers $n$?
2012 JBMO TST - Turkey, 2
Find all positive integers $m,n$ and prime numbers $p$ for which $\frac{5^m+2^np}{5^m-2^np}$ is a perfect square.
2019 Saudi Arabia Pre-TST + Training Tests, 3.3
Let $d$ be a positive divisor of a positive integer $m$ and $(a_l), (b_l)$ two arithmetic sequences of positive integers. It is given that $gcd(a_i, b_j) = 1$ and $gcd(a_k, b_n) = m$ for some positive integers $i,j,k,$ and $n$. Prove that there exist positive integers $t$ and $s$ such that $gcd(a_t, b_s) = d$.
2020 LIMIT Category 2, 12
Let $A$ be the set $\{k^{19}-k: 1<k<20, k\in N\}$. Let $G$ be the GCD of all elements of $A$.
Then the value of $G$ is?
2018 Peru Cono Sur TST, 8
For each pair of positive integers $m$ and $n$, we define $f_m(n)$ as follows:
$$ f_m(n) = \gcd(n, d_1) + \gcd(n, d_2) + \cdots + \gcd(n, d_k), $$
where $1 = d_1 < d_2 < \cdots < d_k = m$ are all the positive divisors of $m$. For example,
$f_4(6) = \gcd(6,1) + \gcd(6,2) + \gcd(6,4) = 5$.
$a)\:$ Find all positive integers $n$ such that $f_{2017}(n) = f_n(2017)$.
$b)\:$ Find all positive integers $n$ such that $f_6(n) = f_n(6)$.
2019 Saudi Arabia JBMO TST, 4
Let $14$ integer numbers are given. Let Hamza writes on the paper the greatest common divisor for each pair of numbers. It occurs that the difference between the biggest and smallest numbers written on the paper is less than $91$. Prove that not all numbers on the paper are different.
2011 Saudi Arabia IMO TST, 2
Consider the set $S= \{(a + b)^7 - a^7 - b^7 : a,b \in Z\}$. Find the greatest common divisor of all members in $S$.
2002 Estonia National Olympiad, 1
The greatest common divisor $d$ and the least common multiple $u$ of positive integers $m$ and $n$ satisfy the equality $3m + n = 3u + d$. Prove that $m$ is divisible by $n$.