Adding digit vectors
Abstract: 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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.