Update cc-KSIZEGCD.mdx

the GCD can change up to 446 times not 30

Author: lollospadalaser

solutions/gold/cc-KSIZEGCD.mdx

@@ -13,9 +13,9 @@ Can we upper bound the number of times the GCD changes?
 
 <Spoiler title="Answer to Hint 1">
 
-Note that the GCD can only decrease, and it will always remove some factor from the current GCD.
-The smallest factor we can remove is $2$, and $a_i \leq 10^9$, so the GCD can only change at most
-$log_2(10^9) \approx 30$ times.
+Note that the GCD can only decrease and there are two ways for it to do so, we will either remove some factor from the current GCD or find another GCD at a different position.
+The smallest factor we can remove is $2$, and $a_i \leq 10^9$, so in this way the GCD can only change at most
+$log_2(10^9) \approx 30$ times. But let's consider an array of type $[A, 1, A-1, A-1, 1, A-2, A-2, A-2, 1...]$ if the array has size $1e5$ the number of times the gcd changes is actually $446$ but this is still good enough.
 
 </Spoiler>