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 two infinite subsets $A$ and $B$ of natural numbers. I am positive that the set of prime divisors of elements of $A+B$ is infinite but I can not prove it. Maybe this is a known result. If anybody has an idea or a reference please let me know. (by $A+B$ I mean $\lbrace a+b \; | \; a\in A, b\in B\rbrace$)

share|cite|improve this question
up vote 12 down vote accepted

This was proved by Erdős and Turán when they were undergraduate students, see Theorem III here. A stronger result was proved by Győry, Stewart, and Tijdeman, see Theorem 1 here.

share|cite|improve this answer
Thank You and May God Bless Erdos. – user37755 Jul 26 '13 at 13:27

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.