1. Find gcd(252, 198) using the Euclidean Algorithm: - Compute $252 \div 198 = 1$ remainder $54$. - Apply gcd(198, 54). - Compute $198 \div 54 = 3$ remainder $36$. - Apply gcd(54, 36). - Compute $54 \div 36 = 1$ remainder $18$. - Apply gcd(36, 18). - Compute $36 \div 18 = 2$ remainder $0$. - Since remainder is 0, gcd is 18. 2. Find gcd(420, 308) using the Euclidean Algorithm: - Compute $420 \div 308 = 1$ remainder $112$. - Apply gcd(308, 112). - Compute $308 \div 112 = 2$ remainder $84$. - Apply gcd(112, 84). - Compute $112 \div 84 = 1$ remainder $28$. - Apply gcd(84, 28). - Compute $84 \div 28 = 3$ remainder $0$. - Since remainder is 0, gcd is 28. 3. Find gcd(315, 210) using the Euclidean Algorithm: - Compute $315 \div 210 = 1$ remainder $105$. - Apply gcd(210, 105). - Compute $210 \div 105 = 2$ remainder $0$. - Since remainder is 0, gcd is 105. Final answers: - gcd(252, 198) = 18 - gcd(420, 308) = 28 - gcd(315, 210) = 105