|
Given an integer $m$ consisting of $k$ digits $d_x$ in base $b$, $$j = \sum_{i = 1}^{k} d_i$$, then repeating this operation on the digits of $j$ until $j < b$ stores in $j$ the {\em digital root} of $m$. The number of iterations of the sum operation is called the {\em additive persistence} of $m$.
|
Given an integer $m$ consisting of $k$ digits $d_x$ in base $b$, $$j = \sum_{i = 1}^{k} d$$, then repeating this operation on the digits of $j$ until $j < b$ stores in $j$ the {\em digital root} of $m$. The number of iterations of the sum operation is the additive persistence of $m$.
|
