The structure of maximum subsets of \(\{1,\dots,n\}\) with no solutions to \(a+b=kc\) (Q2571259)

A set of positive integers is said to be \(k\)-sum-free if it does not contain elements \(a,b,c\) such that \(a+b=kc\). Let \(f(n,k)\) denote the maximum size of a \(k\)-sum-free set in \({1,\dots,n}\). It was conjectured by \textit{F. R. K. Chung} and \textit{J. L. Goldwasser} [Electron. J. Comb. 3 (1996; Zbl 0851.05013)] that, for \(k \geq4,\) \(\lim_{n \to \infty} \frac{f(n,k)}{n} = \frac{k(k-2)}{k^2-2} + \frac {8(k-2)}{k(k^2-2)(k-2k^2-4)}\). This conjecture is now proved, and the structure of such extremal \(k\)-sum-free sets as a union of intervals is examined.