Found problems: 583
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?
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$.
1970 AMC 12/AHSME, 34
The greatest integer that will divide $13,511$, $13,903$, and $14,589$ and leave the same remainder is
$\textbf{(A) }28\qquad\textbf{(B) }49\qquad\textbf{(C) }98\qquad$
$\textbf{(D) }\text{an odd multiple of }7\text{ greater than }49\qquad \textbf{(E) }\text{an even multiple of }7\text{ greater than }98$
2013 AMC 12/AHSME, 23
$ ABCD$ is a square of side length $ \sqrt{3} + 1 $. Point $ P $ is on $ \overline{AC} $ such that $ AP = \sqrt{2} $. The square region bounded by $ ABCD $ is rotated $ 90^{\circ} $ counterclockwise with center $ P $, sweeping out a region whose area is $ \frac{1}{c} (a \pi + b) $, where $a $, $b$, and $ c $ are positive integers and $ \text{gcd}(a,b,c) = 1 $. What is $ a + b + c $?
$\textbf{(A)} \ 15 \qquad \textbf{(B)} \ 17 \qquad \textbf{(C)} \ 19 \qquad \textbf{(D)} \ 21 \qquad \textbf{(E)} \ 23 $
2012 Romania Team Selection Test, 1
Let $n_1,\ldots,n_k$ be positive integers, and define $d_1=1$ and $d_i=\frac{(n_1,\ldots,n_{i-1})}{(n_1,\ldots,n_{i})}$, for $i\in \{2,\ldots,k\}$, where $(m_1,\ldots,m_{\ell})$ denotes the greatest common divisor of the integers $m_1,\ldots,m_{\ell}$. Prove that the sums \[\sum_{i=1}^k a_in_i\] with $a_i\in\{1,\ldots,d_i\}$ for $i\in\{1,\ldots,k\}$ are mutually distinct $\mod n_1$.
2000 All-Russian Olympiad, 8
One hundred natural numbers whose greatest common divisor is $1$ are arranged around a circle. An allowed operation is to add to a number the greatest common divisor of its two neighhbors. Prove that we can make all the numbers pairwise copirme in a finite number of moves.
2014 Contests, 1
For $x, y$ positive integers, $x^2-4y+1$ is a multiple of $(x-2y)(1-2y)$. Prove that $|x-2y|$ is a square number.
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]
2024 New Zealand MO, 4
Determine all positive integers $n$ less than $2024$ such that for all positive integers $x$, the greatest common divisor of $9x + 1$ and $nx+1$ is $1$.
2010 Brazil National Olympiad, 3
Find all pairs $(a, b)$ of positive integers such that
\[ 3^a = 2b^2 + 1. \]
2012 European Mathematical Cup, 2
Let $S$ be the set of positive integers. For any $a$ and $b$ in the set we have $GCD(a, b)>1$. For any $a$, $b$ and $c$ in the set we have $GCD(a, b, c)=1$. Is it possible that $S$ has $2012$ elements?
[i]Proposed by Ognjen Stipetić.[/i]
2019 CCA Math Bonanza, I4
How many ordered pairs $\left(a,b\right)$ of positive integers are there such that \[\gcd\left(a,b\right)^3=\mathrm{lcm}\left(a,b\right)^2=4^6\] is true?
[i]2019 CCA Math Bonanza Individual Round #4[/i]
2007 Germany Team Selection Test, 3
Let $ a > b > 1$ be relatively prime positive integers. Define the weight of an integer $ c$, denoted by $ w(c)$ to be the minimal possible value of $ |x| \plus{} |y|$ taken over all pairs of integers $ x$ and $ y$ such that \[ax \plus{} by \equal{} c.\] An integer $ c$ is called a [i]local champion [/i]if $ w(c) \geq w(c \pm a)$ and $ w(c) \geq w(c \pm b)$.
Find all local champions and determine their number.
[i]Proposed by Zoran Sunic, USA[/i]
2020 Princeton University Math Competition, 3
Alice and Bob are playing a guessing game. Bob is thinking of a number n of the form $2^a3^b$, where a and b are positive integers between $ 1$ and $2020$, inclusive. Each turn, Alice guess a number m, and Bob will tell her either $\gcd (m, n)$ or $lcm (m, n)$ (letting her know that he is saying that $gcd$ or $lcm$), as well as whether any of the respective powers match up in their prime factorization. In particular, if $m = n$, Bob will let Alice know this, and the game is over. Determine the smallest number $k$ so that Alice is always able to find $n$ within $k$ guesses, regardless of Bob’s number or choice of revealing either the $lcm$, or the $gcd$ .
2005 Korea National Olympiad, 1
For two positive integers a and b, which are relatively prime, find all integer that can be the great common divisor of $a+b$ and $\frac{a^{2005}+b^{2005}}{a+b}$.
2000 France Team Selection Test, 3
Find all nonnegative integers $x,y,z$ such that $(x+1)^{y+1} + 1= (x+2)^{z+1}$.
2018 Tuymaada Olympiad, 4
Prove that for every positive integer $d > 1$ and $m$ the sequence $a_n=2^{2^n}+d$ contains two terms $a_k$ and $a_l$ ($k \neq l$) such that their greatest common divisor is greater than $m$.
[i]Proposed by T. Hakobyan[/i]
2014 Online Math Open Problems, 23
For a prime $q$, let $\Phi_q(x)=x^{q-1}+x^{q-2}+\cdots+x+1$.
Find the sum of all primes $p$ such that $3 \le p \le 100$ and there exists an odd prime $q$ and a positive integer $N$ satisfying
\[\dbinom{N}{\Phi_q(p)}\equiv \dbinom{2\Phi_q(p)}{N} \not \equiv 0 \pmod p. \][i]Proposed by Sammy Luo[/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]
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}\, .$
2019 Durer Math Competition Finals, 3
For each integer $n$ ($n \ge 2$), let $f(n)$ denote the sum of all positive integers that are at most $n$ and not relatively prime to $n$.
Prove that $f(n+p) \neq f(n)$ for each such $n$ and every prime $p$.
2011 Kyiv Mathematical Festival, 1
Solve the equation
$mn =$ (gcd($m,n$))$^2$ + lcm($m, n$)
in positive integers, where gcd($m, n$) – greatest common divisor of $m,n$, and lcm($m, n$) – least common multiple of $m,n$.
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$.
PEN H Problems, 26
Solve in integers the following equation \[n^{2002}=m(m+n)(m+2n)\cdots(m+2001n).\]
2014 Contests, 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]