Your Web News in One Place

Help Webnuz

Referal links:

Sign up for GreenGeeks web hosting
July 9, 2021 08:59 am GMT

(Digital Root)

173 :

1 + 7 + 3 = 11
1 + 1 = 2

2

9256987

9 + 2 + 5 + 6 + 9 + 9 + 7 = 46
4 + 6 = 10
1 + 0 = 1

1

Naive method ( )

DigitalRoot(1) = 1
DigitalRoot(2) = 2
DigitalRoot(3) = 3

... ... ...

DigtalRoot(9) = 9

DigitalRoot(10) =1 + 0 -> 1
DigtalRoot(11) = 1 + 1 -> 2
DigitalRoot(12) = 1 + 2 -> 3
DigitalRoot(13) = 1 + 3 = 4

... ... ...

DigitalRoot(18) = 1 + 8 = 9

... ... ...

digital root , , , , , , , ,

1 mod 9 = 1
2 mod 2 = 2
...
9 mod 9 = 0 ( )

10 mod 9 = 1
11 mod 9 = 2
12 mod 9 = 3
13 mod 9 = 4
...
18 mod 9 = 0 (9)
... ... ...

:
alt text

Python code snippet:

def dr(n):    if n == 0:        return 0    m = n % 9    return m if m != 0 else 9

Big(o) Complexity: O(1)


Original Link: https://dev.to/princebillygk/digital-root-5dpj

Share this article:    Share on Facebook
View Full Article

Dev To

An online community for sharing and discovering great ideas, having debates, and making friends

More About this Source Visit Dev To