2
$\begingroup$

Consider an infinite set $S$, of positive integers. If all the finite subsets of $S$ have GCD $>$ $1$, is it necessary that the GCD of $S$ is greater than $1$ as well?

$\endgroup$
3
  • $\begingroup$ I believe a compactness argument applies. The answer should be yes. Gerhard "Ask Me About System Design" Paseman, 2012.11.09 $\endgroup$ Nov 9, 2012 at 17:36
  • $\begingroup$ This is a nice question, but not one suitable for this site. You could reask it on math.stackexchange.com a similar site with a broader scope than this one, which is dedicated to question with a connection to current research. $\endgroup$
    – user9072
    Nov 9, 2012 at 17:38
  • $\begingroup$ You can consider a filtration $A_1\subset A_2\subset A_3 ...$ of your set of natural numbers $S$ such that $\cup A_i = S$ and every $A_i$ is finite. Then take the $\mathrm{gcd}$. $\endgroup$
    – user1437
    Nov 9, 2012 at 17:42

2 Answers 2

5
$\begingroup$

Consider the set of finite linear combinations with integral coefficients from $S$. It is an ideal in $\mathbb{Z}$, hence it equals the set of multiples of some integer $d>0$. The integer $d$ divides every element of $S$, hence it cannot exceed the GCD of $S$. On the other hand, $d$ is a finite linear combination with integral coefficients from $S$, hence it is divisible by the GCD of some finite subset of $S$, which of course is divisibe by the GCD of $S$ as well. This shows two things at one stroke: $d>1$ by assumption, and $d$ equals the GCD of $S$.

P.S. I voted to close, but then could not resist to write down what I consider the most natural proof.

$\endgroup$
2
$\begingroup$

Yes. Fix some $x\in S$. It has finitely many factors, and one of these needs to be a common factor with every other number in $S$. Otherwise, let $y_i$ be such that $d_i\not\vert y_i$ where $\lbrace d_i: i\le m\rbrace$ is a list of the divisors of $x$ which are $>1$; then $\lbrace y_i: i\le m\rbrace\cup\lbrace x\rbrace$ is a finite subset of $S$ with common denominator 1.

$\endgroup$

Not the answer you're looking for? Browse other questions tagged or ask your own question.