Let $a$ be a positive integer. Show that $\gcd(a, a-1) = 1.$
Let $d$ be the greatest common divisor of $a$ and $a-1.$ I.e. $\gcd(a, a-1) = d$
Therefore, $d$ must divide $a-(a-1),$ following the rule that if any number, when some number d divides two numbers, then d must also divide the difference.
In other words, $d\mid (a-(a-1)).$
If we simplify, d must divide $a-a+1= 1$.
I have shown that the $\gcd(a, a-1) = 1,$ since d = 1. QED.
b) Use the result of part a) to solve the Diophantine equation $a+2b=2ab,\,$ where $a, b \in \mathbb Z$.
Let $2b = 2k,$ where $k$ is an integer and therefore $2b$ is even.
Case 1: $a$ is even
If $a$ is even, then $a = 2k,$ where k is an integer.
$2k + 2k = 2(2k)(1)$
$4k = 4k$
Both sides equal each other...
This is where I stopped. I realized I wasn't using the previous proof to solve this equation. This is where I need help.