A recursive definition of p-ary addition without carry
Journal de théorie des nombres de Bordeaux, Tome 11 (1999) no. 2, pp. 307-315.

Soit p un nombre premier. Nous montrons dans cet article que l’addition en base p sans retenue possède une définition récursive à l’instar des cas où p=2 et p=3 qui étaient déjà connus.

Let p be a prime number. In this paper we prove that the addition in p-ary without carry admits a recursive definition like in the already known cases p=2 and p=3.

@article{JTNB_1999__11_2_307_0,
     author = {Fran\c{c}ois Laubie},
     title = {A recursive definition of $p$-ary addition without carry},
     journal = {Journal de th\'eorie des nombres de Bordeaux},
     pages = {307--315},
     publisher = {Universit\'e Bordeaux I},
     volume = {11},
     number = {2},
     year = {1999},
     zbl = {0997.11013},
     mrnumber = {1745881},
     language = {en},
     url = {https://jtnb.centre-mersenne.org/item/JTNB_1999__11_2_307_0/}
}
TY  - JOUR
AU  - François Laubie
TI  - A recursive definition of $p$-ary addition without carry
JO  - Journal de théorie des nombres de Bordeaux
PY  - 1999
SP  - 307
EP  - 315
VL  - 11
IS  - 2
PB  - Université Bordeaux I
UR  - https://jtnb.centre-mersenne.org/item/JTNB_1999__11_2_307_0/
LA  - en
ID  - JTNB_1999__11_2_307_0
ER  - 
%0 Journal Article
%A François Laubie
%T A recursive definition of $p$-ary addition without carry
%J Journal de théorie des nombres de Bordeaux
%D 1999
%P 307-315
%V 11
%N 2
%I Université Bordeaux I
%U https://jtnb.centre-mersenne.org/item/JTNB_1999__11_2_307_0/
%G en
%F JTNB_1999__11_2_307_0
François Laubie. A recursive definition of $p$-ary addition without carry. Journal de théorie des nombres de Bordeaux, Tome 11 (1999) no. 2, pp. 307-315. https://jtnb.centre-mersenne.org/item/JTNB_1999__11_2_307_0/

[1] C.L. Bouton, Nim, a game with a complete mathematical theory. Ann. Math. Princeton 3 (1902), 35-39. | JFM | MR

[2] J.H. Conway, N.J.A. Sloane, Lexicographic Codes, Error Corrrecting Codes from Game Theory. IEEE Trans. Inform. Theory 32 (1986), 337-348. | MR | Zbl

[3] S. Eliahou, M. Kervaire, Sumsets in vector spaces over finite fields. J. Number Theory 71 (1998), 12-39. | MR | Zbl

[4] F. Laubie, On linear greedy codes. to appear.

[5] H.W. Lenstra, Nim Multiplication. Séminaire de Théorie des Nombres de Bordeaux 1977-78, exposé 11, (1978). | MR | Zbl

[6] V. Levenstein, A class of Systematic Codes. Soviet Math Dokl. 1 (1960), 368-371. | MR | Zbl

[7] S.Y.R. Li, N-person Nim and N-person Moore's Games. Int. J. Game Theory 7 (1978), 31-36. | MR | Zbl

[8] E.H. Moore, A generalization of the Game called Nim. Ann. Math. Princeton 11 (1910), 93-94. | JFM | MR