Found problems: 583
2007 Romania Team Selection Test, 3
Let $a_{i}$, $i = 1,2, \dots ,n$, $n \geq 3$, be positive integers, having the greatest common divisor 1, such that \[a_{j}\textrm{ divide }\sum_{i = 1}^{n}a_{i}\]
for all $j = 1,2, \dots ,n$. Prove that \[\prod_{i = 1}^{n}a_{i}\textrm{ divides }\Big{(}\sum_{i = 1}^{n}a_{i}\Big{)}^{n-2}.\]
2014 NIMO Problems, 4
Let $S$ be the set of integers which are both a multiple of $70$ and a factor of $630{,}000$. A random element $c$ of $S$ is selected. If the probability that there exists an integer $d$ with $\gcd (c,d) = 70$ and $\operatorname{lcm} (c,d) = 630{,}000$ is $\frac mn$ for some relatively prime integers $m$ and $n$, compute $100m+n$.
[i]Proposed by Eugene Chen[/i]
2006 Irish Math Olympiad, 4
Let $n$ be a positive integer.
Find the greatest common divisor of the numbers $\binom{2n}{1},\binom{2n}{3},\binom{2n}{5},...,\binom{2n}{2n-1}$.
2003 Mexico National Olympiad, 5
Some cards each have a pair of numbers written on them. There is just one card for each pair $(a,b)$ with $1 \leq a < b \leq 2003$. Two players play the following game. Each removes a card in turn and writes the product $ab$ of its numbers on the blackboard. The first player who causes the greatest common divisor of the numbers on the blackboard to fall to $1$ loses. Which player has a winning strategy?
2010 Indonesia TST, 2
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]
2020 Mexico National Olympiad, 5
A four-element set $\{a, b, c, d\}$ of positive integers is called [i]good[/i] if there are two of them such that their product is a mutiple of the greatest common divisor of the remaining two. For example, the set $\{2, 4, 6, 8\}$ is good since the greatest common divisor of $2$ and $6$ is $2$, and it divides $4\times 8=32$.
Find the greatest possible value of $n$, such that any four-element set with elements less than or equal to $n$ is good.
[i]Proposed by Victor and IsaÃas de la Fuente[/i]
2007 Stars of Mathematics, 4
Show that any subset of $ A=\{ 1,2,...,2007\} $ having $ 27 $ elements contains three distinct numbers such that the greatest common divisor of two of them divides the other one.
[i]Dan Schwarz[/i]
2002 Tournament Of Towns, 1
There are many $a\times b$ rectangular cardboard pieces ($a,b\in\mathbb{N}$ such that $a<b$). It is given that by putting such pieces together without overlapping one can make $49\times 51$ rectangle, and $99\times 101$ rectangle. Can one uniquely determine $a,b$ from this?
2011 International Zhautykov Olympiad, 2
Let $n$ be integer, $n>1.$ An element of the set $M=\{ 1,2,3,\ldots,n^2-1\}$ is called [i]good[/i] if there exists some element $b$ of $M$ such that $ab-b$ is divisible by $n^2.$ Furthermore, an element $a$ is called [i]very good[/i] if $a^2-a$ is divisible by $n^2.$ Let $g$ denote the number of [i]good[/i] elements in $M$ and $v$ denote the number of [i]very good[/i] elements in $M.$ Prove that
\[v^2+v \leq g \leq n^2-n.\]
2023 South Africa National Olympiad, 3
Consider $2$ positive integers $a,b$ such that $a+2b=2020$.
(a) Determine the largest possible value of the greatest common divisor of $a$ and $b$.
(b) Determine the smallest possible value of the least common multiple of $a$ and $b$.
1996 All-Russian Olympiad, 5
At the vertices of a cube are written eight pairwise distinct natural numbers, and on each of its edges is written the greatest common divisor of the numbers at the endpoints of the edge. Can the sum of the numbers written at the vertices be the same as the sum of the numbers written at the edges?
[i]A. Shapovalov[/i]
Russian TST 2016, P2
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.
1987 IMO Longlists, 34
(a) Let $\gcd(m, k) = 1$. Prove that there exist integers $a_1, a_2, . . . , a_m$ and $b_1, b_2, . . . , b_k$ such that each product $a_ib_j$ ($i = 1, 2, \cdots ,m; \ j = 1, 2, \cdots, k$) gives a different residue when divided by $mk.$
(b) Let $\gcd(m, k) > 1$. Prove that for any integers $a_1, a_2, . . . , a_m$ and $b_1, b_2, . . . , b_k$ there must be two products $a_ib_j$ and $a_sb_t$ ($(i, j) \neq (s, t)$) that give the same residue when divided by $mk.$
[i]Proposed by Hungary.[/i]
2011 Macedonia National Olympiad, 2
Acute-angled $~$ $\triangle{ABC}$ $~$ is given. A line $~$ $l$ $~$ parallel to side $~$ $AB$ $~$ passing through vertex $~$ $C$ $~$ is drawn. Let the angle bisectors of $~$ $\angle{BAC}$ $~$ and $~$ $\angle{ABC}$ $~$ intersect the sides $~$ $BC$ and $~$ $AC$ at points $~$ $D$ $~$ and $~$ $F$, and line $~$ $l$ $~$ at points $~$ $E$ $~$ and $~$ $G$ $~$ respectively. Prove that if $~$ $\overline{DE}=\overline{GF}$ $~$ then $~$ $\overline{AC}=\overline{BC}\, .$
2000 AIME Problems, 4
The diagram shows a rectangle that has been dissected into nine non-overlapping squares. Given that the width and the height of the rectangle are relatively prime positive integers, find the perimeter of the rectangle.
[asy]
defaultpen(linewidth(0.7));
draw((0,0)--(69,0)--(69,61)--(0,61)--(0,0));draw((36,0)--(36,36)--(0,36));
draw((36,33)--(69,33));draw((41,33)--(41,61));draw((25,36)--(25,61));
draw((34,36)--(34,45)--(25,45));
draw((36,36)--(36,38)--(34,38));
draw((36,38)--(41,38));
draw((34,45)--(41,45));[/asy]
2014 Romania Team Selection Test, 4
Let $n$ be a positive integer and let $A_n$ respectively $B_n$ be the set of nonnegative integers $k<n$ such that the number of distinct prime factors of $\gcd(n,k)$ is even (respectively odd). Show that $|A_n|=|B_n|$ if $n$ is even and $|A_n|>|B_n|$ if $n$ is odd.
Example: $A_{10} = \left\{ 0,1,3,7,9 \right\}$, $B_{10} = \left\{ 2,4,5,6,8 \right\}$.
1982 Dutch Mathematical Olympiad, 4
Determine $ \gcd (n^2\plus{}2,n^3\plus{}1)$ for $ n\equal{}9^{753}$.
2015 IMO Shortlist, C3
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.
2013 India Regional Mathematical Olympiad, 6
Let $P(x)=x^3+ax^2+b$ and $Q(x)=x^3+bx+a$, where $a$ and $b$ are nonzero real numbers. Suppose that the roots of the equation $P(x)=0$ are the reciprocals of the roots of the equation $Q(x)=0$. Prove that $a$ and $b$ are integers. Find the greatest common divisor of $P(2013!+1)$ and $Q(2013!+1)$.
1985 IMO, 2
Let $n$ and $k$ be relatively prime positive integers with $k<n$. Each number in the set $M=\{1,2,3,\ldots,n-1\}$ is colored either blue or white. For each $i$ in $M$, both $i$ and $n-i$ have the same color. For each $i\ne k$ in $M$ both $i$ and $|i-k|$ have the same color. Prove that all numbers in $M$ must have the same color.
2013 India Regional Mathematical Olympiad, 5
Let $a_1,b_1,c_1$ be natural numbers. We define \[a_2=\gcd(b_1,c_1),\,\,\,\,\,\,\,\,b_2=\gcd(c_1,a_1),\,\,\,\,\,\,\,\,c_2=\gcd(a_1,b_1),\] and \[a_3=\operatorname{lcm}(b_2,c_2),\,\,\,\,\,\,\,\,b_3=\operatorname{lcm}(c_2,a_2),\,\,\,\,\,\,\,\,c_3=\operatorname{lcm}(a_2,b_2).\] Show that $\gcd(b_3,c_3)=a_2$.
2012 JBMO ShortLists, 5
Find all positive integers $x,y,z$ and $t$ such that $2^x3^y+5^z=7^t$.
2016 India Regional Mathematical Olympiad, 2
Consider a sequence $(a_k)_{k \ge 1}$ of natural numbers defined as follows: $a_1=a$ and $a_2=b$ with $a,b>1$ and $\gcd(a,b)=1$ and for all $k>0$, $a_{k+2}=a_{k+1}+a_k$. Prove that for all natural numbers $n$ and $k$, $\gcd(a_n,a_{n+k}) <\frac{a_k}{2}$.
2016 Peru IMO TST, 9
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]
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.$