2019 Cono Sur Mathematical Olympiad, P1
Source:
August 28, 2019
combinatorics
Problem Statement
Martin has two boxes and . In the box there are red balls numbered from to , each one with one of these numbers. In the box there are blue balls numbered from to , each one with one of these numbers. Martin chooses two positive integers and , both less than or equal to , and then he takes out balls from box and balls from box , without replacement. Martin's goal is to have two red balls and one blue ball among all balls taken such that the sum of the numbers of two red balls equals the number of the blue ball.\\
What is the least possible value of so that Martin achieves his goal for sure? For such a minimum value of , give an example of and satisfying the goal and explain why every and with smaller sum cannot accomplish the aim.