An epidemiologist tracking a disease outbreak observes that the total number of cases over two consecutive weeks is 144, and the greatest common divisor of the weekly case counts is as large as possible. What is the largest possible value of \( \gcd(a, b) \) if \( a + b = 144 \) and \( a, b \) are positive integers?

["Title: Maximizing the GCD of Two Weekly Case Counts: Solving a Real-World Epidemiological Problem", "In the field of public health, accurate tracking and analysis of disease outbreaks are critical to effective intervention. A key mathematical insight aiding epidemiologists is the role of the greatest common divisor (GCD) in modeling recurring or clustered transmission patterns. Consider the following scenario: over two consecutive weeks, the total number of reported disease cases is 144. Let ( a ) and ( b ) represent the number of cases in week 1 and week 2, respectively. We are tasked with finding the maximum possible value of ( \gcd(a, b) ) given that ( a + b = 144 ) and both ( a ) and ( b ) are positive integers.", "### Understanding the Mathematical Constraint", "We are given:\n- ( a + b = 144 )\n- ( a, b \in \mathbb{Z}^+ )\n- Maximize ( d = \gcd(a, b) )", "Let ( d = \gcd(a, b) ). Then we can write:\n[\na = d \cdot m, \quad b = d \cdot n\n]\nwhere ( m ) and ( n ) are coprime integers (i.e., ( \gcd(m, n) = 1 )), and both ( m, n \geq 1 ).", "Substituting into the sum:\n[\na + b = d(m + n) = 144\n]\nThus, ( d ) must be a divisor of 144, and ( m + n = \frac{144}{d} ). Since ( m ) and ( n ) are positive integers with ( \gcd(m, n) = 1 ), we seek the largest ( d ) such that ( \frac{144}{d} \geq 2 ) (since both ( m ) and ( n ) are at least 1), and that ( m + n ) can be expressed as the sum of two coprime positive integers.", "Note: For any integer ( s \geq 2 ), there always exists a pair of coprime positive integers ( m, n ) such that ( m + n = s ). For example, take ( m = 1 ), ( n = s - 1 ); since 1 is coprime to all integers, ( \gcd(1, s-1) = 1 ).", "### Strategy: Maximize ( d ), So Minimize ( m + n )", "Since ( d = \frac{144}{m + n} ), to maximize ( d ), we need to minimize ( s = m + n ), subject to ( s \mid 144 ) and ( s \geq 2 ).", "The smallest possible value of ( s = m + n ) is 2, which gives:\n[\nd = \frac{144}{2} = 72\n]\nWe check if ( m = 1, n = 1 ) satisfies ( \gcd(m, n) = \gcd(1,1) = 1 ). It does.", "Therefore, ( a = 72 \cdot 1 = 72 ), ( b = 72 \cdot 1 = 72 ), and indeed:\n[\na + b = 72 + 72 = 144, \quad \gcd(72, 72) = 72\n]", "### Verifying Optimality", "Any larger ( d ) would require ( m + n < 2 ), which is impossible since ( m, n \geq 1 ). Hence, ( d = 72 ) is the maximum possible.", "### Real-World Interpretation", "In epidemiological tracking, a large GCD may suggest underlying patterns—such as synchronized transmission cycles, similar demographic risk factors, or a common source influencing both weeks. While in this case ( a = b ), the mathematical principle holds: when two observed values sum to a fixed total, their GCD is maximized when they are equal, provided they are coprime in their scaled form. This insight helps epidemiologists identify symmetric trends in outbreak data, supporting more effective modeling and response planning.", "### Conclusion", "The largest possible value of ( \gcd(a, b) ) when ( a + b = 144 ) and ( a, b ) are positive integers is ( \boxed{72} ).", "This result exemplifies how number theory supports real-world decision-making in public health, especially when analyzing recurring or clustered disease events. By leveraging mathematical constraints, professionals can uncover deeper patterns in outbreak dynamics and optimize intervention strategies."]