Found problems: 97
Let $n$ be a positive integer. Determine the maximum value of $gcd(a, b) + gcd(b, c) + gcd(c, a)$ for positive integers $a, b, c$ such that $a + b + c = 5n$.
Let $A$ be the set $\{k^{19}-k: 1<k<20, k\in N\}$. Let $G$ be the GCD of all elements of $A$.
Then the value of $G$ is?
For any $ a\in\mathbb{Z}_{\ge 0} $ make the notation $ a\mathbb{Z}_{\ge 0} =\{ an| n\in\mathbb{Z}_{\ge 0} \} . $ Prove that the following relations are equivalent:
$ \text{(1)} a\mathbb{Z}_{\ge 0} \setminus b\mathbb{Z}_{\ge 0}\subset c\mathbb{Z}_{\ge 0} \setminus d\mathbb{Z}_{\ge 0} $
$ \text{(2)} b|a\text{ or } (c|a\text{ and } \text{lcm} (a,b) |\text{lcm} (a,d)) $
[i]Marin Tolosi[/i] and [i]Cosmin Nitu[/i]
Determine all triples of positive integers $(x, y, z)$ that satisfy
$$x < y < z, \ \ gcd(x, y) = 6, \ \ gcd(y, z) = 10, \ \ gcd(z, x) = 8 \ \ and \ \
lcm(x, y, z) = 2400.$$
Let $a, b,c,d$ be positive integers such that $ac+bd$ is divisible by $a^2 +b^2$. Prove that $gcd(c^2 + d^2, a^2 + b^2) > 1$.
Trần Nam Dũng
Find all positive integers $d$ that can be written in the form
$$ d = \gcd(|x^2 - y| , |y^2 - z| , |z^2 - x|), $$
where $x, y, z$ are pairwise coprime positive integers such that $x^2 \neq y$, $y^2 \neq z$, and $z^2 \neq x$.
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]
$S$ is any sequence of at least $3$ positive integers. A move is to take any $a, b$ in the sequence such that neither divides the other and replace them by gcd $(a,b)$ and lcm $(a,b)$. Show that only finitely many moves are possible and that the final result is independent of the moves made, except possibly for order.
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$.
For all positive integers $a$ and $b$, we de ne $a @ b = \frac{a - b}{gcd(a, b)}$ .
Show that for every integer $n > 1$, the following holds:
$n$ is a prime power if and only if for all positive integers $m$ such that $m < n$, it holds that $gcd(n, n @m) = 1$.
Let $a_n = 2^{3n-1} + 3^{6n-2} + 5^{6n-3}$. Compute gcd$(a_1, a_2, ... , a_{25})$
For integers $a, b$, call the lattice point with coordinates $(a,b)$ [b]basic[/b] if $gcd(a,b)=1$. A graph takes the basic points as vertices and the edges are drawn in such way: There is an edge between $(a_1,b_1)$ and $(a_2,b_2)$ if and only if $2a_1=2a_2\in \{b_1-b_2, b_2-b_1\}$ or $2b_1=2b_2\in\{a_1-a_2, a_2-a_1\}$. Some of the edges will be erased, such that the remaining graph is a forest. At least how many edges must be erased to obtain this forest? At least how many trees exist in such a forest?
Show that $$5^{2019} \mid \Sigma^{5^{2019}}_{k=1}3^{gcd (5^{2019},k)}$$
You are given a positive integer $n$. What is the largest possible number of numbers that can be chosen from the set
$\{1, 2, \ldots, 2n\}$ so that there are no two chosen numbers $x > y$ for which $x - y = (x, y)$?
Here $(x, y)$ denotes the greatest common divisor of $x, y$.
[i]Proposed by Anton Trygub[/i]
For every positive integer \( n \), do there exist pairwise distinct positive integers \( a_1, a_2, \dots, a_n \) that satisfy the following condition?
For every \( 3 \leq m \leq n \), there exists an \( i \leq m-2 \) such that:
$$
a_m = a_{\gcd(m-1, i)} + \gcd(a_{m-1}, a_i).
$$
Proposed by Alireza Jannati
Pete wrote down $21$ pairwise distinct positive integers, each not greater than $1,000,000$. For every pair $(a, b)$ of numbers written down by Pete, Nick wrote the number
$$F(a;b)=a+b -\gcd(a;b)$$
on his piece of paper. Prove that one of Nick’s numbers differs from all of Pete’s numbers.
Fedir and Mykhailo have three piles of stones: the first contains $100$ stones, the second $101$, the third $102$. They are playing a game, going in turns, Fedir makes the first move. In one move player can select any two piles of stones, let's say they have $a$ and $b$ stones left correspondently, and remove $gcd(a, b)$ stones from each of them. The player after whose move some pile becomes empty for the first time wins. Who has a winning strategy?
As a reminder, $gcd(a, b)$ denotes the greatest common divisor of $a, b$.
[i](Proposed by Oleksii Masalitin)[/i]
Denote by $(a, b)$ the greatest common divisor of $a$ and $b$.
Let $n$ be a positive integer such that $(n, n + 1) < (n, n + 2) <... < (n,n + 35)$. Prove that $(n, n + 35) < (n,n + 36)$.
Find all positive integer solutions $(a, b)$ to the equation $$\frac{1}{a}+\frac{1}{b}+ \frac{n}{lcm(a,b)}=\frac{1}{gcd(a, b)}$$ for
(i) $n = 2007$;
(ii) $n = 2010$.
Determine the greatest common divisor of the numbers $p^6-7p^2+6$ where $p$ runs through the prime numbers $p \ge 11$.
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]
The greatest common divisor $d$ and the least common multiple $u$ of positive integers $m$ and $n$ satisfy the equality $3m + n = 3u + d$. Prove that $m$ is divisible by $n$.