Proving relatively prime in a sequence?

34 Views Asked by At

We have a sequence $g_0=3$ and $g_n=2+g_0g_1g_2...g_{n-1}$ for $n\in \mathbb{N}$. How can I prove that $\gcd(g_k,g_n)=1$ if $k<n$? I know that this essentially asking to prove that they are relatively prime, but I am unsure where to begin. Could I show that all of the numbers in this sequence are relatively prime?