The first 16 evil and odious numbers in binary. It can be seen, that both sequences differ only in the least significant bits, which form the Thue–Morse sequence for the evil, and its negation for the odious numbers. The other bits form the even numbers.
Innumber theory, anevil number is a non-negative integer that has an evennumber of 1s in itsbinary expansion.[1] These numbers give the positions of the zero values in theThue–Morse sequence, and for this reason they have also been called theThue–Morse set.[2] Non-negative integers that are not evil are calledodious numbers.
The partition of the non-negative integers into the odious and evil numbers is the unique partition of these numbers into two sets that have equalmultisets of pairwise sums.[3]
As 19th-century mathematician Eugène Prouhet showed, the partition into evil and odious numbers of the numbers from to, for any, provides a solution to theProuhet–Tarry–Escott problem of finding sets of numbers whose sums of powers are equal up to theth power.[4]
^Charlier, Émilie; Cisternino, Célia; Massuir, Adeline (2019), "State complexity of the multiples of the Thue-Morse set",Proceedings Tenth International Symposium on Games, Automata, Logics, and Formal Verification, Electron. Proc. Theor. Comput. Sci. (EPTCS), vol. 305, pp. 34–49,arXiv:1903.06114,doi:10.4204/EPTCS.305.3,MR4030092
^Wright, E. M. (1959), "Prouhet's 1851 solution of the Tarry-Escott problem of 1910",American Mathematical Monthly,66 (3):199–201,doi:10.2307/2309513,JSTOR2309513,MR0104622