$\gcd$ of polynomials over a field I have the polynomials $f,g\neq 0 $ over a field $F$. We know also that $\gcd(f,g)=1$ and 
$$
       \det \begin{pmatrix}
        a & b \\
        c & d \\
        \end{pmatrix}\neq 0.
$$
I need to prove that $\gcd(af+bg,cf+dg) = 1 $ for every $a,b,c,d \in F$. 
I really do not know how to start answer the question. Thanks for helpers!

I see linear combinations. Linear combinations mean linear algebra. It is very often useful to write linear combinations in terms of matrix arithmetic when you can. In this case, we get the very interesting
$$ \left[ \begin{matrix} af + bg \\ cf + dg \end{matrix} \right]
= \left[ \begin{matrix} a & b \\ c & d \end{matrix} \right] \left[ \begin{matrix}f \\ g \end{matrix} \right] $$
There are a number of ways you can go from here. Here are two things to get you started.
Exercise: compare elementary matrices (i.e. elementary row operations) to steps of the Euclidean algorithm.
Exercise: What can you easily say about the relationship between $\gcd(f,g)$ and $\gcd(af+bg, cf+dg)$? (optional: rephrase it in terms of vectors and matrices, rather than pairs and linear combinations) How can you use the fact that matrix is invertible to go the other direction?
