12th Mexican Mathematical Olympiad Problems 1998A1.  Given a positive integer we can take the sum of the        squares of its digits. If repeating this operation a finite number of        times gives 1 we call the number tame. Show that there are        infinitely many pairs (n, n+1) of consecutive tame integers.      
