Waring’s Theorem for Binary Powers

A natural number is a binary k’ th power if its binary representation consists of k consecutive identical blocks. We prove, using tools from combinatorics, linear algebra, and number theory, an analogue of Waring’s theorem for sums of binary k’th powers. More precisely, we show that for each integer k > 2, there exists an effectively computable natural number n such that every sufficiently large multiple of E k :=gcd(2 k - 1, k ) is the sum of at most n binary k’th powers. (The hypothesis of being a multiple of Ek cannot be omitted, since we show that the gcd of the binary k’th powers is Ek .) Furthermore, we show that n = 2 O ( k 3 ). Analogous results hold for arbitrary integer bases b >2.