Additive Persistence — Definition & Example
Additive persistence is the number of times you must add up a number's digits, over and over, until you are left with a single digit. The single digit you end on is called the number's digital root.
For a nonnegative integer written in base 10, let be the sum of its digits. The additive persistence of is the smallest integer such that . Here means applying exactly times, and . Every single-digit number has additive persistence 0.
Worked Example
Problem: Find the additive persistence and the digital root of 389,999.
Step 1: Digit sum 1: add the digits of 389,999. The result, 47, has two digits, so keep going.
Step 2: Digit sum 2: add the digits of 47. The result, 11, still has two digits.
Step 3: Digit sum 3: add the digits of 11. The result is a single digit, so you stop.
Answer: The additive persistence of 389,999 is 3, because it took 3 digit sums to reach one digit. The digital root is 2.
Why It Matters
Every digit sum leaves the same remainder after division by 9 as the original number, because . That fact is the basis of casting out nines, an old method for catching errors in long multiplication by hand. Repeated digit sums are also a standard first exercise in writing loops in a programming course.
Common Mistakes
Mistake: Giving the final single digit as the additive persistence. For 389,999, a student might answer 2.
Correction: The persistence is a count of steps, not the digit you end on. For 389,999 the persistence is 3 and the digital root is 2. Count each digit sum you perform, and do not count the starting number.
