Prove the gcd $(4a + b, a + 2b) $ is equal to $1$ or $7$. So in the question it says to let $a$ and $b$ be nonzero integers such that $\gcd(a,b) = 1$.
So based on that I know that $a$ and $b$ are relatively prime and that question is basically asking if the GCD divides $7$.
So I tried to prove through the Euclidean algorithm but I think I messed up.
$a+2b = 2\times(4a+b) - 7a$
$4a+b = \frac{-4}{7}\times(-7b) +a$
$7b = 0\times a +7b$
$a = 0\times 7b +a$ 
$7b = 0\times a + 7b$
and so on and so on. 
The fact that it is repeating tells me that I am doing something wrong.
Thanks you in advance for all of your help :)

Since $\gcd(a,b)=1$, there are $x,y\in\mathbb{Z}$ so that $ax+by=1$.
$$
\begin{align}
7
&=\overbrace{[2\color{#C00000}{(4a+b)}-\color{#00A000}{(a+2b)}]}^{\large7a}\,x+\overbrace{[4\color{#00A000}{(a+2b)}-\color{#C00000}{(4a+b)}]}^{\large7b}\,y\\[4pt]
&=(2x-y)\color{#C00000}{(4a+b)}+(4y-x)\color{#00A000}{(a+2b)}
\end{align}
$$
Therefore, $\gcd(4a+b,a+2b)\mid7$.
