Graph explorer

Adding digit vectors

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.

3 nodes2 linksoverview mapAdding digit vectors
3 nodes2 links
Adding digit vectors3 visible / 3 total nodes / 2 links
AuthorshipTopic signalWAdding digit vectorspreprint / 2012APeter HellekalekResearcherTmath.NT5493 works
PaperSignal 102 links

Adding digit vectors

preprint / 2012

Open