Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. 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

Can one prove that $\{x : x=y-z, \gcd(y,z)=1, y,z\in \mathbb{N}\}=\mathbb{N}$?

This problem has arisen at a problem in probability and I've never studied this kind of math before, so I apologize if it is tagged wrong.


share|cite|improve this question
$x= (x+1)-1$. Or if you don't want to use $z=1$ take any number $m$ that is coprime to $x$ and use $x=(x+m)-m$. – Michalis Nov 3 '12 at 12:06
Let $n$ be an integer bigger than $6$. Then $n$ is the sum of two relatively prime integers each bigger than $1$. – PAD Nov 3 '12 at 14:35
up vote 2 down vote accepted

Try $x=(x+1)-1$. $ $ $ $ $ $ $ $

share|cite|improve this answer
Oh wow, that was trivial. Thanks! – Henrik Nov 3 '12 at 12:07

Your Answer


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

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