A recursive definition of $p$-ary addition without carry

Laubie, François. "A recursive definition of $p$-ary addition without carry." Journal de théorie des nombres de Bordeaux 11.2 (1999): 307-315. <http://eudml.org/doc/248328>.

@article{Laubie1999,
abstract = {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$.},
author = {Laubie, François},
journal = {Journal de théorie des nombres de Bordeaux},
keywords = {-ary representations of integers},
language = {eng},
number = {2},
pages = {307-315},
publisher = {Université Bordeaux I},
title = {A recursive definition of $p$-ary addition without carry},
url = {http://eudml.org/doc/248328},
volume = {11},
year = {1999},
}

TY - JOUR
AU - Laubie, François
TI - A recursive definition of $p$-ary addition without carry
JO - Journal de théorie des nombres de Bordeaux
PY - 1999
PB - Université Bordeaux I
VL - 11
IS - 2
SP - 307
EP - 315
AB - 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$.
LA - eng
KW - -ary representations of integers
UR - http://eudml.org/doc/248328
ER -