Waring's theorem for binary powers

Publication date 26 February 2020

Abstract: A natural number is a binary

k

'th power if its binary representation consists of

k

consecutive identical blocks. We prove an analogue of Waring's theorem for sums of binary

k

'th powers. More precisely, we show that for each integer

k g e q 2

, there exists a positive integer

W (k)

such that every sufficiently large multiple of

E_{k} := g c d (2^{k} - 1, k)

is the sum of at most

W (k)

binary

k

'th powers. (The hypothesis of being a multiple of

E_{k}

cannot be omitted, since we show that the

g c d

of the binary

k

'th powers is

E_{k}

.) Also, we explain how our results can be extended to arbitrary integer bases

b > 2

.

Recommendations

Cited in

(7)

This page was built for publication: Waring's theorem for binary powers