Prove that the second argument to \(\operatorname{gcd}()\) decreases by at least a factor of 2 for every second recursive call, and then prove that \(\operatorname{gcd}(p, q)\) uses at most \(2 \log _{2} n+1\) recursive calls where \(n\) is the larger of \(p\) and \(q\).