Parthasarathy Madhusudan, Dirk Nowotka, Aayush Rajasekaran, Jeffrey Shallit
Published 2017-10-11Version 1
We prove, using a decision procedure based on finite automata, that every natural number > 686 is the sum of at most 4 natural numbers whose canonical base-2 representation is a binary square, that is, a string of the form xx for some block of bits x.
A result similar to Lagrange's theorem
Every natural number is the sum of forty-nine palindromes
On sums of the small divisors of a natural number
![QR code for arXiv:1710.04247 [math.NT]](http://oss.arxitics.com/images/favicon.svg)