I can't resist mentioning the following problem (and requesting that nobody gives away the solution any more than it is already given away by my mentioning it here).
Call a real number repetitive if for every k you can find a string of k digits that appears more than once in its decimal expansion. The problem is to prove that if a real number is repetitive then so is its square.
