Found problems: 583
1987 Greece National Olympiad, 1
a) Prove that every sub-group $(A,+)$ of group $(\mathbb{Z},+)$ is in the form $A=n \cdot \mathbb{Z}$ for some $n \in \mathbb{Z}$ where $n \cdot \mathbb{Z}=\{n \cdot x/x\in\mathbb{Z}\}$.
b) Using problem (a) , prove that the greatest common divisor $d$ of non zero integers $a_1, a_2,... ,a_n$ is given by relation $d=\lambda_1a_1+\lambda_2 a_2+...\lambda_n a_n$ with $\lambda_i\in\mathbb{Z}, \,\, i=1,2,...,n$
1995 IMO Shortlist, 4
Find all $ x,y$ and $ z$ in positive integer: $ z \plus{} y^{2} \plus{} x^{3} \equal{} xyz$ and $ x \equal{} \gcd(y,z)$.
2016 Greece JBMO TST, 3
Positive integer $n$ is such that number $n^2-9$ has exactly $6$ positive divisors. Prove that GCD $(n-3, n+3)=1$
1935 Moscow Mathematical Olympiad, 021
Denote by $M(a, b, c, . . . , k)$ the least common multiple and by $D(a, b, c, . . . , k)$ the greatest common divisor of $a, b, c, . . . , k$. Prove that:
a) $M(a, b)D(a, b) = ab$,
b) $\frac{M(a, b, c)D(a, b)D(b, c)D(a, c)}{D(a, b, c)}= abc$.
2011 Nordic, 4
Show that for any integer $n \ge 2$ the sum of the fractions $\frac{1}{ab}$, where $a$ and $b$ are relatively prime positive integers such that $a < b \le n$ and $a+b > n$, equals $\frac{1}{2}$.
(Integers $a$ and $b$ are called relatively prime if the greatest common divisor of $a$ and $b$ is $1$.)
2022 Indonesia TST, N
For each natural number $n$, let $f(n)$ denote the number of ordered integer pairs $(x,y)$ satisfying the following equation:
\[ x^2 - xy + y^2 = n. \]
a) Determine $f(2022)$.
b) Determine the largest natural number $m$ such that $m$ divides $f(n)$ for every natural number $n$.
2008 Mexico National Olympiad, 2
We place $8$ distinct integers in the vertices of a cube and then write the greatest common divisor of each pair of adjacent vertices on the edge connecting them. Let $E$ be the sum of the numbers on the edges and $V$ the sum of the numbers on the vertices.
a) Prove that $\frac23E\le V$.
b) Can $E=V$?
2004 Postal Coaching, 2
(a) Find all triples $(x,y,z)$ of positive integers such that $xy \equiv 2 (\bmod{z})$ , $yz \equiv 2 (\bmod{x})$ and $zx \equiv 2 (\bmod{y} )$
(b) Let $n \geq 1$ be an integer. Give an algoritm to determine all triples $(x,y,z)$ such that '2' in part (a) is replaced by 'n' in all three congruences.
1995 All-Russian Olympiad, 5
The sequence $a_1, a_2, ...$ of natural numbers satisfies $GCD(a_i, a_j)=GCD(i, j)$ for all $i \neq j$. Prove that $a_i=i$ for all $i$.
2011 NIMO Problems, 11
How many ordered pairs of positive integers $(m, n)$ satisfy the system
\begin{align*}
\gcd (m^3, n^2) & = 2^2 \cdot 3^2,
\\ \text{LCM} [m^2, n^3] & = 2^4 \cdot 3^4 \cdot 5^6,
\end{align*}
where $\gcd(a, b)$ and $\text{LCM}[a, b]$ denote the greatest common divisor and least common multiple of $a$ and $b$, respectively?
2000 Tournament Of Towns, 1
Positive integers $m$ and $n$ have no common divisor greater than one. What is the largest possible value of the greatest common divisor of $m + 2000n$ and $n + 2000m$ ?
(S Zlobin)
2003 Italy TST, 1
The incircle of a triangle $ABC$ touches the sides $AB,BC,CA$ at points $D,E,F$ respectively. The line through $A$ parallel to $DF$ meets the line through $C$ parallel to $EF$ at $G$.
$(a)$ Prove that the quadrilateral $AICG$ is cyclic.
$(b)$ Prove that the points $B,I,G$ are collinear.
2006 India IMO Training Camp, 1
Find all triples $(a,b,c)$ such that $a,b,c$ are integers in the set $\{2000,2001,\ldots,3000\}$ satisfying $a^2+b^2=c^2$ and $\text{gcd}(a,b,c)=1$.
2011-2012 SDML (High School), 15
Let $\left(1+\sqrt{2}\right)^{2012}=a+b\sqrt{2}$, where $a$ and $b$ are integers. The greatest common divisor of $b$ and $81$ is
$\text{(A) }1\qquad\text{(B) }3\qquad\text{(C) }9\qquad\text{(D) }27\qquad\text{(E) }81$
2001 Tournament Of Towns, 2
In three piles there are $51, 49$, and $5$ stones, respectively. You can combine any two piles into one pile or divide a pile consisting of an even number of stones into two equal piles. Is it possible to get $105$ piles with one stone in each?
the 16th XMO, 3
$m$ is an integer satisfying $m \ge 2024$ , $p$ is the smallest prime factor of $m$ , for an arithmetic sequence $\{a_n\}$ of positive numbers with the common difference $m$ satisfying : for any integer $1 \le i \le \frac{p}{2} $ , there doesn’t exist an integer $x , y \le \max \{a_1 , m\}$ such that $a_i=xy$ Try to proof that there exists a positive real number $c$ such that for any $ 1\le i \le j \le n $ , $gcd(a_i , a_j ) = c \times gcd(i , j)$
2023 Bulgaria National Olympiad, 1
Let $G$ be a graph on $n\geq 6$ vertices and every vertex is of degree at least 3. If $C_{1}, C_{2}, \dots, C_{k}$ are all the cycles in $G$, determine all possible values of $\gcd(|C_{1}|, |C_{2}|, \dots, |C_{k}|)$ where $|C|$ denotes the number of vertices in the cycle $C$.
1988 All Soviet Union Mathematical Olympiad, 485
The sequence of integers an is given by $a_0 = 0, a_n = p(a_n-1)$, where $p(x)$ is a polynomial whose coefficients are all positive integers. Show that for any two positive integers $m, k$ with greatest common divisor $d$, the greatest common divisor of $a_m$ and $a_k$ is $a_d$.
2015 Indonesia MO, 2
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)}
\]
PEN A Problems, 68
Suppose that $S=\{a_{1}, \cdots, a_{r}\}$ is a set of positive integers, and let $S_{k}$ denote the set of subsets of $S$ with $k$ elements. Show that \[\text{lcm}(a_{1}, \cdots, a_{r})=\prod_{i=1}^{r}\prod_{s\in S_{i}}\gcd(s)^{\left((-1)^{i}\right)}.\]
2009 ELMO Problems, 1
Let $a,b,c$ be positive integers such that $a^2 - bc$ is a square. Prove that $2a + b + c$ is not prime.
[i]Evan o'Dorney[/i]
2016 CCA Math Bonanza, I14
Compute \[\sum_{k=1}^{420} \gcd(k,420).\]
[i]2016 CCA Math Bonanza Individual #14[/i]
2010 International Zhautykov Olympiad, 2
In every vertex of a regular $n$ -gon exactly one chip is placed. At each $step$ one can exchange any two neighbouring chips. Find the least number of steps necessary to reach the arrangement where every chip is moved by $[\frac{n}{2}]$ positions clockwise from its initial position.
2016 Iran Team Selection Test, 6
Let $\mathbb{Z}_{>0}$ denote the set of positive integers. For any positive integer $k$, a function $f: \mathbb{Z}_{>0} \to \mathbb{Z}_{>0}$ is called [i]$k$-good[/i] if $\gcd(f(m) + n, f(n) + m) \le k$ for all $m \neq n$. Find all $k$ such that there exists a $k$-good function.
[i]Proposed by James Rickards, Canada[/i]
1984 Austrian-Polish Competition, 2
Let $A$ be the set of four-digit natural numbers having exactly two distinct digits, none of which is zero. Interchanging the two digits of $n\in A$ yields a number $f (n) \in A$ (for instance, $f (3111) = 1333$). Find those $n \in A$ with $n > f (n)$ for which $gcd(n, f (n))$ is the largest possible.