A Generalization of the Digital Binomial Theorem
چکیده
In [9], the author introduced a digital version of this theorem where the exponents appearing in (1) are viewed as sums of digits. To illustrate this, consider the binomial theorem for N = 2: (x + y) = xy + xy + xy + xy. (2) It is easy to verify that (2) is equivalent to (x+ y) = xy + xy + xy + xy, (3) where s(k) denotes the sum of digits of k expressed in binary. For example, s(3) = s(1 · 2 + 1 · 2) = 2. More generally, we have