  In this paper we express the difference of two complementary Beatty
sequences, as the sum of two Beatty sequences closely related to them. In the
process we introduce a new Algorithm that generalizes the well known Minimum
Excluded algorithm and provides a method to generate combinatorially any pair
of complementary Beatty sequences.
