  In this paper, we study the different possibilities to add two vectors of
digits of a given length $m$. Our results show that there are at least
$2^{m-1}$ different additions of such vectors, while there exist only two types
of addition that we may employ, addition with carry and addition without carry.
The proofs of our results are elementary.
