Metraipolis › archive › dc_cc797988cb2e
Digital root — Wikipedia (en)
- Source
- Wikipedia (en)
- Original
- https://en.wikipedia.org/wiki/Digital_root
- License (as archived)
- CC-BY-SA-4.0
- Archived
- 2026-10-06T16:43:05.384Z
- SHA-256 of the archived text
bf631b5f302120fb9702852db554cbd1449faef0aee7d08a71309b3e61e39862- Stable URL of this page
https://metraipolis.com/documento/dc_cc797988cb2e
How to cite
Digital root — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Digital_root (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_cc797988cb2e (Metraipolis archive dc_cc797988cb2e, sha256 bf631b5f302120fb9702852db554cbd1449faef0aee7d08a71309b3e61e39862)
BibTeX
@misc{dccc797988cb2e,
title = {Digital root — Wikipedia (en)},
howpublished = {Wikipedia (en)},
url = {https://en.wikipedia.org/wiki/Digital_root},
note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_cc797988cb2e; sha256 bf631b5f302120fb9702852db554cbd1449faef0aee7d08a71309b3e61e39862},
year = {2026}
}Archived text
Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Digital_root. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
The digital root (also repeated digital sum) of a natural number in a given radix is the (single digit) value obtained by an iterative process of summing digits, on each iteration using the result from the previous iteration to compute a digit sum. The process continues until a single-digit number is reached. For example, in base 10, the digital root of the number 12345 is 6 because the sum of the digits in the number is 1 + 2 + 3 + 4 + 5 = 15, then the addition process is repeated for the resulting number 15, so that the sum of 1 + 5 equals 6, which is the digital root of that number. In base 10, this is equivalent to taking the remainder upon division by 9 (except when the digital root is 9, where the remainder upon division by 9 will be 0), which allows it to be used as a divisibility rule. The formula for the function d r b : N → ⋃ k = 0 b − 1 { k } , b ∈ N ⩾ 2 {\displaystyle \mathrm {dr} _{b}:\mathbb {N} \rightarrow \mathop {\bigcup } _{k=0}^{b-1}\{k\},\quad b\in \mathbb {N} _{\geqslant 2}} is expressed as: d r b ( n ) := { 0 n = 0 1 + ( ( n − 1 ) mod ( b − 1 ) ) n > 0 {\displaystyle \mathrm {dr} _{b}(n):={\begin{cases}0&n=0\\1+((n-1){\bmod {(}}b-1))&n>0\end{cases}}} .
Tema degli esploratori: matematica e informatica teorica (deposito sistematico; categoria «Number theory»).
Fonte: Wikipedia in inglese, voce «Digital root» — https://en.wikipedia.org/wiki/Digital_root
Wikidata Q2532474 (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q2532474
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Digital_root?action=history).
Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza.
Estratto dell'introduzione non modificato nel contenuto; revisione 1368983554, consultata il 2026-10-06T15:18:43.089Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: eebd6a0092ed2c9c73215f4af58aa6aa2f718ebeb151187ac6becab98ba31ff0