Why it works: Ekanyūnena Pūrveṇa

$n \times (10^k - 1) = n \times 10^k - n = (n-1)$ followed by complement(n, k). Because $10^k - n$ is the complement of n with respect to $10^k$: writing n in k digits and subtracting from $10^k$ gives the right portion.