Prove $\gcd(n, n + 1) = 1$ for any $n$ Let $n \in \mathbb Z$ be even. Then $n + 1$ is odd. So, $2$ doesn't divide $n + 1$. Thus there's no even number for which $\gcd(n, n+1)$ is not $1$. I am not sure how to show it for odd numbers. Is there a better way to prove the statement?
Let $a$ and $b$ be integers. 

Any integer that divides both $a$ and $b$ must also divide their difference (can you see why this is?).
Take $n$ and $n-1$, if they have a common prime $p$ then from $n-(n-1)$ we can write
$$n-(n-1)=p\cdot\left(\dfrac{n}{p}-\dfrac{n-1}{p}\right)=p\cdot\dfrac{n-n+1}{p}=p\cdot\dfrac{1}{p}$$ and that implies p divides 1, absurd, because p is prime. $quod$ $erat$ $demonstrandum$