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]
2012 Iran Team Selection Test, 1
Is it possible to put $\binom{n}{2}$ consecutive natural numbers on the edges of a complete graph with $n$ vertices in a way that for every path (or cycle) of length $3$ where the numbers $a,b$ and $c$ are written on its edges (edge $b$ is between edges $c$ and $a$), $b$ is divisible by the greatest common divisor of the numbers $a$ and $c$?
[i]Proposed by Morteza Saghafian[/i]
Oliforum Contest I 2008, 2
Find all non-negative integers $ x,y,z$ such that $ 5^x \plus{} 7^y \equal{} 2^z$.
:lol:
([i]Daniel Kohen, University of Buenos Aires - Buenos Aires,Argentina[/i])
2014 India PRMO, 11
For natural numbers $x$ and $y$, let $(x,y)$ denote the greatest common divisor of $x$ and $y$. How many pairs of natural numbers $x$ and $y$ with $x \le y$ satisfy the equation $xy = x + y + (x, y)$?
2009 China Team Selection Test, 3
Let $ (a_{n})_{n\ge 1}$ be a sequence of positive integers satisfying $ (a_{m},a_{n}) = a_{(m,n)}$ (for all $ m,n\in N^ +$). Prove that for any $ n\in N^ + ,\prod_{d|n}{a_{d}^{\mu (\frac {n}{d})}}$ is an integer. where $ d|n$ denotes $ d$ take all positive divisors of $ n.$ Function $ \mu (n)$ is defined as follows: if $ n$ can be divided by square of certain prime number, then $ \mu (1) = 1;\mu (n) = 0$; if $ n$ can be expressed as product of $ k$ different prime numbers, then $ \mu (n) = ( - 1)^k.$
2007 Singapore Junior Math Olympiad, 4
The difference between the product and the sum of two different integers is equal to the sum of their GCD (greatest common divisor) and LCM (least common multiple). Findall these pairs of numbers. Justify your answer.
2004 APMO, 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$.
2002 Tournament Of Towns, 6
Define a sequence $\{a_n\}_{n\ge 1}$ such that $a_1=1,a_2=2$ and $a_{n+1}$ is the smallest positive integer $m$ such that $m$ hasn't yet occurred in the sequence and also $\text{gcd}(m,a_n)\neq 1$. Show all positive integers occur in the sequence.
2010 Putnam, B3
There are 2010 boxes labeled $B_1,B_2,\dots,B_{2010},$ and $2010n$ balls have been distributed among them, for some positive integer $n.$ You may redistribute the balls by a sequence of moves, each of which consists of choosing an $i$ and moving [i]exactly[/i] $i$ balls from box $B_i$ into any one other box. For which values of $n$ is it possible to reach the distribution with exactly $n$ balls in each box, regardless of the initial distribution of balls?
2006 AMC 10, 22
Two farmers agree that pigs are worth $ \$300$ and that goats are worth $ \$210$. When one farmer owes the other money, he pays the debt in pigs or goats, with ``change'' received in the form of goats or pigs as necessary. (For example, a $ \$390$ debt could be paid with two pigs, with one goat received in change.) What is the amount of the smallest positive debt that can be resolved in this way?
$ \textbf{(A) } \$5\qquad \textbf{(B) } \$10\qquad \textbf{(C) } \$30\qquad \textbf{(D) } \$90\qquad \textbf{(E) } \$210$
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$?
2019 India Regional Mathematical Olympiad, 1
For each $n\in\mathbb{N}$ let $d_n$ denote the gcd of $n$ and $(2019-n)$.
Find value of $d_1+d_2+\cdots d_{2018}+d_{2019}$
2018 Saudi Arabia GMO TST, 1
Let $n$ be an odd positive integer with $n > 1$ and let $a_1, a_2,... , a_n$ be positive integers such that gcd $(a_1, a_2,... , a_n) = 1$. Let $d$ = gcd $(a_1^n + a_1\cdot a_2 \cdot \cdot \cdot a_n, a_2^n + a_1\cdot a_2 \cdot \cdot \cdot a_n, ... , a_n^n + a_1\cdot a_2 \cdot \cdot \cdot a_n)$. Show that the possible values of $d$ are $d = 1, d = 2$
2021 Bangladeshi National Mathematical Olympiad, 2
Let $x$ and $y$ be positive integers such that $2(x+y)=gcd(x,y)+lcm(x,y)$. Find $\frac{lcm(x,y)}{gcd(x,y)}$.
2016 Latvia Baltic Way TST, 16
What is the largest possible value of the expression $$gcd \,\,\, (n^2 + 3, (n + 1)^2 + 3 )$$ for naturals $n$?
[hide]original wording]Kāda ir izteiksmes LKD (n2 + 3, (n + 1)2 + 3) lielākā iespējamā vērtība naturāliem n? [/hide]
2013 Switzerland - Final Round, 1
Find all triples $(a, b, c)$ of natural numbers such that the sets
$$\{ gcd (a, b), gcd(b, c), gcd(c, a), lcm (a, b), lcm (b, c), lcm (c, a)\}$$ and
$$\{2, 3, 5, 30, 60\}$$
are the same.
Remark: For example, the sets $\{1, 2013\}$ and $\{1, 1, 2013\}$ are equal.
2012 Thailand Mathematical Olympiad, 7
Let $a, b, m$ be integers such that gcd $(a, b) = 1$ and $5 | ma^2 + b^2$ . Show that there exists an integer $n$ such that $5 | m - n^2$.
2021 AIME Problems, 9
Find the number of ordered pairs $(m, n)$ such that $m$ and $n$ are positive integers in the set $\{1, 2, ..., 30\}$ and the greatest common divisor of $2^m + 1$ and $2^n - 1$ is not $1.$
2014 Tuymaada Olympiad, 1
Four consecutive three-digit numbers are divided respectively by four consecutive two-digit numbers. What minimum number of different remainders can be obtained?
[i](A. Golovanov)[/i]
2001 India IMO Training Camp, 2
A strictly increasing sequence $(a_n)$ has the property that $\gcd(a_m,a_n) = a_{\gcd(m,n)}$ for all $m,n\in \mathbb{N}$. Suppose $k$ is the least positive integer for which there exist positive integers $r < k < s$ such that $a_k^2 = a_ra_s$. Prove that $r | k$ and $k | s$.
2021 USAJMO, 5
A finite set $S$ of positive integers has the property that, for each $s \in S,$ and each positive integer divisor $d$ of $s$, there exists a unique element $t \in S$ satisfying $\text{gcd}(s, t) = d$. (The elements $s$ and $t$ could be equal.)
Given this information, find all possible values for the number of elements of $S$.
2016 CCA Math Bonanza, I14
Compute \[\sum_{k=1}^{420} \gcd(k,420).\]
[i]2016 CCA Math Bonanza Individual #14[/i]
2021-IMOC, N5
Find all sets $S$ of positive integers that satisfy all of the following.
$1.$ If $a,b$ are two not necessarily distinct elements in $S$, then $\gcd(a,b)$, $ab$ are also in $S$.
$2.$ If $m,n$ are two positive integers with $n\nmid m$, then there exists an element $s$ in $S$ such that $m^2\mid s$ and $n^2\nmid s$.
$3.$ For any odd prime $p$, the set formed by moduloing all elements in $S$ by $p$ has size exactly $\frac{p+1}2$.
2004 Thailand Mathematical Olympiad, 14
Compute gcd$(5^{2547} - 1, 5^{2004} - 1)$.
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.