MathOverflow is a question and answer site for professional mathematicians. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

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?

share|cite|improve this question

closed as off topic by Dan Petersen, GH from MO, Andrés E. Caicedo, quid, Alain Valette Nov 9 '12 at 17:59

Questions on MathOverflow are expected to relate to research level mathematics within the scope defined by the community. Consider editing the question or leaving comments for improvement if you believe the question can be reworded to fit within the scope. Read more about reopening questions here.If this question can be reworded to fit the rules in the help center, please edit the question.

I believe a compactness argument applies. The answer should be yes. Gerhard "Ask Me About System Design" Paseman, 2012.11.09 – Gerhard Paseman Nov 9 '12 at 17:36
This is a nice question, but not one suitable for this site. You could reask it on a similar site with a broader scope than this one, which is dedicated to question with a connection to current research. – user9072 Nov 9 '12 at 17:38
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}$. – Jason Polak Nov 9 '12 at 17:42
up vote 5 down vote accepted

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.

share|cite|improve this answer

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.

share|cite|improve this answer

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