Reverse Number Logic

Digit manipulation extracts decimal (or base-b) limbs with % 10 and // 10—digit sums, digital roots, and palindrome checks build on this.

Why this shows up in the real world

Cryptography, competitive programming, and combinatorics lean on primes, residues mod n, and fast arithmetic on huge integers.

Core idea (explained for students)

Loop: d = n % 10, n //= 10. Digital root often uses n % 9 trick with edge case n=0. Modulo 10^k keeps last k digits.

Try this in Python

def digits(n: int) -> list[int]:
    if n == 0:
        return [0]
    ds: list[int] = []
    while n:
        ds.append(n % 10)
        n //= 10
    return ds


print(digits(12034))

Common mistakes

• Forgetting leading zeros in fixed-width checks.
• Confusing digit sum with digital root.
• Integer overflow before mod in digit DP (use mod early).

Key takeaways

• Precompute powers of 10 mod m for positional DP.
• Reverse digits into list for palindrome / divisibility rules.