Problem

Source: 1st TASIMO Day2, Problem4

Tags: combinatorics



Given positive integers $a,b,$ find the least positive integer $m$ such that among any $m$ distinct integers in the interval $[-a,b]$ there are three pair-wise distinct numbers that their sum is zero. Proposed by Marian Tetiva, Romania