Multiplicative Persistence — Definition & Example
Multiplicative persistence is the number of times you must multiply the digits of a whole number together, repeating the process on each new result, before you reach a single-digit number.
For a nonnegative integer written in base 10, let be the product of its digits. The multiplicative persistence of is the smallest integer for which has one digit. Here means applying a total of times. Every single-digit number has persistence 0.
Worked Example
Problem: Find the multiplicative persistence of 679.
Step 1: Multiply the digits of 679. This is multiplication number 1.
Step 2: The result 378 has more than one digit, so repeat the process. This gives multiplications 2 and 3.
Step 3: Keep going until one digit remains. This gives multiplications 4 and 5. Then count the arrows in the chain: .
Answer: The multiplicative persistence of 679 is 5. It took five rounds of digit multiplication to reach the single digit 6. In fact, 679 is the smallest number with persistence 5.
Why It Matters
Multiplicative persistence leads to a real unsolved problem. The number 277777788888899 has persistence 11. Computer searches have checked extremely large numbers and found none with persistence 12 or more. Even so, no one has proved that 11 is the maximum. Because a short loop computes it, persistence is also a popular early coding exercise.
Common Mistakes
Mistake: Counting every number in the chain, including the starting number, and reporting 6 for 679.
Correction: Persistence counts the multiplications, which equals the number of arrows in the chain, not the number of terms. The chain for 679 has 6 terms but only 5 arrows, so its persistence is 5.
