To maximize \(\gcd(a, b)\), we note that if \(\gcd(a, b) = d\), then \(a = dx\) and \(b = dy\) for some integers \(x\) and \(y\) with \(\gcd(x, y) = 1\). Thus, \(a + b = dx + dy = d(x + y) = 2023\). Therefore, \(d\) must divide 2023.

["Maximizing the GCD of Two Numbers: Understanding the Role of Divisors of 2023", "When exploring number theory, one fundamental question often arises: How can we maximize the greatest common divisor (gcd) of two integers? A powerful insight arises when two numbers’ gcd equals (d), meaning they can be expressed as (a = dx) and (b = dy), where (x) and (y) are coprime integers. This decomposition reveals a deep relationship between their sum, their common divisor, and the underlying integer structure.", "Let’s explore this concept step-by-step and uncover why understanding the divisors of 2023 is essential to maximizing (\gcd(a, b)).", "### The Key Insight: Expressing (a) and (b) in Terms of Their GCD", "Suppose (\gcd(a, b) = d). Then we can write:\n[\na = dx \quad \ ext{and} \quad b = dy\n]\nwhere (x) and (y) are integers with (\gcd(x, y) = 1). This ensures that the greatest common divisor of (x) and (y) is 1—meaning (d) captures exactly the shared factor of (a) and (b).", "Their sum is then:\n[\na + b = dx + dy = d(x + y)\n]\nGiven that (a + b = 2023), substituting yields:\n[\nd(x + y) = 2023\n]\nThis equation tells us immediately that (d) must be a divisor of 2023.", "### Why Divisors of 2023 Matter", "Since (d(x + y) = 2023), and (x + y) is a positive integer, it follows that (d) divides 2023 evenly. To maximize (d), we must identify the largest divisor (d) such that (x + y = \frac{2023}{d}) can be split into two coprime positive integers (x) and (y).", "The maximum possible value of (d) is 2023 itself—but only if (x + y = 1), which is impossible since (x) and (y) are positive integers (each at least 1). Therefore, the largest feasible (d) occurs at the largest divisor of 2023 for which (\frac{2023}{d} \geq 2) and can be written as the sum of two coprime positive integers.", "### How to Find the Largest Valid (d)", "First, factor 2023 to identify its divisors:\n[\n2023 = 7 \ imes 17 \ imes 17 = 7 \ imes 17^2\n]\nSo, the full list of positive divisors of 2023 is:\n[\n1, 7, 17, 119, 289, 2023\n]\nWe now test these divisors from largest to smallest to find the maximum (d) such that (\frac{2023}{d}) is at least 2 and can be expressed as (x + y) with (\gcd(x, y) = 1).", "- (d = 2023): (x + y = 1) → Impossible (since (x, y \geq 1))\n- (d = 289): (x + y = 2023 / 289 = 7) → Can 7 be split into coprime (x, y)? Yes! Examples: ((1,6), (2,5), (3,4)), all pairs with (\gcd = 1). Valid.\n- Larger divisors tested aren’t valid; 289 is largest possible satisfying all conditions.", "Thus, the maximum (\gcd(a, b)) possible is (289), achieved when (d = 289) and (x + y = 7) with (\gcd(x, y) = 1).", "### Practical Example", "Take (x = 3), (y = 4) (coprime). Then:\n[\na = 289 \ imes 3 = 867,\quad b = 289 \ imes 4 = 1156,\quad a + b = 2023\n]\n[\n\gcd(867, 1156) = 289\n]\nThis confirms the theoretical result.", "### Conclusion", "To maximize (\gcd(a, b)) under a fixed sum, express (a) and (b) in terms of their gcd via coprime multipliers. The sum constraint then reduces to factoring that sum and selecting the largest divisor for which the quotient allows decomposition into coprime parts. For (a + b = 2023), the maximum (\gcd(a, b)) is (289), the largest divisor enabling such a split.", "Understanding this relationship empowers you to strategically analyze divisor-based optimization in number theory and related fields.", "---", "Key Takeaways:\n- If (\gcd(a, b) = d), then (a = dx), (b = dy), (x + y = \frac{2023}{d}), (\gcd(x,y)=1).\n- (d) must divide 2023.\n- Maximize (d) by choosing the largest divisor such that (\frac{2023}{d} \geq 2) and allows coprime (x, y).\n- For 2023, the maximum (\gcd(a,b) = 289).", "This principle unlocks deeper insights into divisibility, number structure, and optimization—making gcd maximization both elegant and powerful in mathematical problem-solving."]