Problem

Source: MOP 2006 Homework - Black Group

Tags: algebra unsolved, algebra, combinatorics



Determine if there exists a strictly increasing sequence of positive integers $a_1$, $a_2$, ... such that $a_n \le n^3$ for every positive integer $n$ and that every positive integer can be written uniquely as the difference of two terms in the sequence.