Found problems: 583
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]
let $m,n$ be natural number with $m>n$ . find all such pairs of $(m,n) $
such that
$gcd(n+1,m+1)=gcd(n+2,m+2) =..........=gcd(m, 2m-n) = 1 $
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$.
On the table there are $k \ge 3$ heaps of $1, 2, \dots , k$ stones. In the first step, we choose any three of the heaps, merge them into a single new heap, and remove $1$ stone from this new heap. Thereafter, in the $i$-th step ($i \ge 2$) we merge some three heaps containing more than $i$ stones in total and remove $i$ stones from the new heap. Assume that after a number of steps a single heap of $p$ stones remains on the table. Show that the number $p$ is a perfect square if and only if so are both $2k + 2$ and $3k + 1$. Find the least $k$ with this property.
Consider a multiplicative function \( f \) from the positive integers to the unit disk centered at the origin, that is, \( f : \mathbb{Z}^+ \to D^2 \subseteq \mathbb{C} \) such that \( f(mn) = f(m)f(n) \). Prove that for every \( \epsilon > 0 \) and every integer \( k > 0 \), there exist \( k \) distinct positive integers \( a_1, a_2, \dots, a_k \) such that \( \text{gcd}(a_1, a_2, \dots, a_k) = k \) and \( d(f(a_i), f(a_j)) < \epsilon \) for all \( i, j = 1, \dots, k \).
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$.
The natural numbers $a$ and $b$ are such that $ \frac{a+1}{b}+ \frac{b+1}{a}$ is an integer. Show that the greatest common divisor of a and b is not greater than $\sqrt{a+b}$.
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)$.