Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
The claim. For every prime , a zero-sum free subset of of the largest possible size has exactly elements, where is the greatest integer with . This is Theorem 9 of É. Balandraud, An addition theorem and maximal zero-sum free sets in , arXiv:0907.3492v1 (20 July 2009), p. 16, published in Israel J. Math. 188 (2012), no. 1, 405--429, with an erratum, ibid. 192 (2012), no. 2, 1009--1010; the labels are those of the arXiv version. Paged as Theorem 9 of Balandraud (2012). Every subset of with more than elements therefore has a nonempty zero-sum subset, so for prime the threshold of Problem 540 is , the constant that Erdős suggested and Selfridge's 1976 conjecture. The theorem is deduced from the paper's addition theorem for subsums (Theorem 5).
Covers. Prime , with the exact threshold of Theorem 9. Composite is not covered.
Acceptance. Refereed: the journal publication. Reviewed: the site's curator, Thomas Bloom, who is independent of the author, labels the problem PROVED (LEAN) and his commentary credits this paper with Selfridge's conjecture for prime . The erratum has not been compared with the arXiv version.
Depends on. No page of this wiki.