For each positive integer n, let an=0 (or 1) if the number of 1’s in the binary representation of n is even (or
odd), respectively. Show that there do not exist positive integers k and m such that
ak+j=ak+m+j=ak+2m+j
for 0≤j≤m−1. PutnamBinarybinary representation