Found problems: 583
2008 Romania National Olympiad, 2
A rectangle can be divided by parallel lines to its sides into 200 congruent squares, and also in 288 congruent squares. Prove that the rectangle can also be divided into 392 congruent squares.
2022 Kyiv City MO Round 1, Problem 1
Consider $5$ distinct positive integers. Can their mean be
a)Exactly $3$ times larger than their largest common divisor?
b)Exactly $2$ times larger than their largest common divisor?
1994 Polish MO Finals, 1
$m, n$ are relatively prime. We have three jugs which contain $m$, $n$ and $m+n$ liters. Initially the largest jug is full of water. Show that for any $k$ in $\{1, 2, ... , m+n\}$ we can get exactly $k$ liters into one of the jugs.
2020 Latvia Baltic Way TST, 16
Given sequence $\{a_n\}$ satisfying:
$$ a_{n+1} = \frac{ lcm(a_n,a_{n-1})}{\gcd(a_n, a_{n-1})} $$
It is given that $a_{209} =209$ and $a_{361} = 361$. Find all possible values of $a_{2020}$.
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]
2021 USAMO, 4
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$.
2002 India IMO Training Camp, 9
On each day of their tour of the West Indies, Sourav and Srinath have either an apple or an orange for breakfast. Sourav has oranges for the first $m$ days, apples for the next $m$ days, followed by oranges for the next $m$ days, and so on. Srinath has oranges for the first $n$ days, apples for the next $n$ days, followed by oranges for the next $n$ days, and so on.
If $\gcd(m,n)=1$, and if the tour lasted for $mn$ days, on how many days did they eat the same kind of fruit?
2010 Putnam, A4
Prove that for each positive integer $n,$ the number $10^{10^{10^n}}+10^{10^n}+10^n-1$ is not prime.
1990 Vietnam Team Selection Test, 1
Let $ T$ be a finite set of positive integers, satisfying the following conditions:
1. For any two elements of $ T$, their greatest common divisor and their least common multiple are also elements of $ T$.
2. For any element $ x$ of $ T$, there exists an element $ x'$ of $ T$ such that $ x$ and $ x'$ are relatively prime, and their least common multiple is the largest number in $ T$.
For each such set $ T$, denote by $ s(T)$ its number of elements. It is known that $ s(T) < 1990$; find the largest value $ s(T)$ may take.
2007 JBMO Shortlist, 1
Find all the pairs positive integers $(x, y)$ such that $\frac{1}{x}+\frac{1}{y}+\frac{1}{[x, y]}+\frac{1}{(x, y)}=\frac{1}{2}$ ,
where $(x, y)$ is the greatest common divisor of $x, y$ and $[x, y]$ is the least common multiple of $x, y$.
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$
MathLinks Contest 7th, 1.2
Let $ a,b,c,d$ be four distinct positive integers in arithmetic progression. Prove that $ abcd$ is not a perfect square.
2004 Vietnam Team Selection Test, 1
Let us consider a set $S = \{ a_1 < a_2 < \ldots < a_{2004}\}$, satisfying the following properties: $f(a_i) < 2003$ and $f(a_i) = f(a_j) \quad \forall i, j$ from $\{1, 2,\ldots , 2004\}$, where $f(a_i)$ denotes number of elements which are relatively prime with $a_i$. Find the least positive integer $k$ for which in every $k$-subset of $S$, having the above mentioned properties there are two distinct elements with greatest common divisor greater than 1.
2002 Junior Balkan Team Selection Tests - Moldova, 1
For any integer $n$ we define the numbers $a = n^5 + 6n^3 + 8n$ ¸ $b = n^4 + 4n^2 + 3$. Prove that the numbers $a$ and $b$ are relatively prime or have the greatest common factor of $3$.
2015 China Girls Math Olympiad, 4
Let $g(n)$ be the greatest common divisor of $n$ and $2015$. Find the number of triples $(a,b,c)$ which satisfies the following two conditions:
$1)$ $a,b,c \in$ {$1,2,...,2015$};
$2)$ $g(a),g(b),g(c),g(a+b),g(b+c),g(c+a),g(a+b+c)$ are pairwise distinct.
2021 IMO Shortlist, C1
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)$.
2002 Tournament Of Towns, 1
All the species of plants existing in Russia are catalogued (numbered by integers from $2$ to $2000$ ; one after another, without omissions or repetitions). For any pair of species the gcd of their catalogue numbers was calculated and recorded but the catalogue numbers themselves were lost. Is it possible to restore the catalogue numbers from the data in hand?
1968 AMC 12/AHSME, 33
A number $N$ has three digits when expressed in base $7$. When $N$ is expressed in base $9$ the digits are reversed. Then the middle digit is:
$\textbf{(A)}\ 0 \qquad\textbf{(B)}\ 1 \qquad\textbf{(C)}\ 3 \qquad\textbf{(D)}\ 4 \qquad\textbf{(E)}\ 5$
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 AIME Problems, 8
The positive integers $N$ and $N^2$ both end in the same sequence of four digits $abcd$ when written in base 10, where digit $a$ is not zero. Find the three-digit number $abc$.
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.
2007 Harvard-MIT Mathematics Tournament, 22
The sequence $\{a_n\}_{n\geq 1}$ is defined by $a_{n+2}=7a_{n+1}-a_n$ for positive integers $n$ with initial values $a_1=1$ and $a_2=8$. Another sequence, $\{b_n\}$, is defined by the rule $b_{n+2}=3b_{n+1}-b_n$ for positive integers $n$ together with the values $b_1=1$ and $b_2=2$. Find $\gcd(a_{5000},b_{501})$.
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.
2010 USA Team Selection Test, 1
Let $P$ be a polynomial with integer coefficients such that $P(0)=0$ and
\[\gcd(P(0), P(1), P(2), \ldots ) = 1.\]
Show there are infinitely many $n$ such that
\[\gcd(P(n)- P(0), P(n+1)-P(1), P(n+2)-P(2), \ldots) = n.\]
2008 Indonesia TST, 4
Let $ a $ and $ b $ be natural numbers with property $ gcd(a,b)=1 $ . Find the least natural number $ k $ such that for every natural number $ r \ge k $ , there exist natural numbers $ m,n >1 $ in such a way that the number $ m^a n^b $ has exactly $ r+1 $ positive divisors.