Probability in Computer Science · Probabilistic Method: Sum-Free Sets (Optional)

Lesson 1

Nikolai Chukhin · Alexander S. Kulikov

Let \(B\) be a finite set of numbers. It is called sum-free if \(x+y \not \in B\) for any \(x,y \in B\). For example, the subset \(B=\{n+1,\dotsc,2n\}\) of the set \([2n]\) is sum-free (for any positive integer \(n\)).