Problem
Let $f:Z \to Z$ that for all $a\geq b\in Z$ exists at least one $k\in Z$ where $f(a) - kf(b) = f(a-b)$. Prove that $gcd(f(a), f(b)) = f(gcd(a,b))$.
Where did it come from?
I was working with $gcd(2^{100} -1, 2^{120}-1)$ and I conjectured $gcd(2^a-1, 2^b-1) = 2^{gcd(a,b)}-1$. So I thought about the problem.
My "solution"
I don't know if that is correct. Doing operations $gcd(f(a), f(b)) = gcd(f(a-b), f(b))$, by Euclidean Algorithm we get to $gcd(f(gcd(a,b)), f(gcd(a,b))) = f(gcd(a,b))$.