Cameron and Erdős raised the question of how many maximal sum-free sets there are in {1,..., n}, giving a lower bound of 2⌊n/4⌋. In this paper we prove that there are in fact at most 2(1/4+o(1))n ...

Numbers comprise a string of digits that are used to represent various quantities and amounts. Each number designates the size of some quantity that is either large or small. Numbers can be of ...

We give new proofs of theorems on alternating subsets of integers by means of bijective transformations. It is shown that all known results are consequences of a simple result on the residue class of ...