Re: [math-fun] An insomniac's problem

On Tue, 23 Sep 2003, Nick Baxter wrote:

For a related problem, last year's US Puzzle Championship included the following problems from Nob Yoshigahara: What are the shortest and longest time spans from one palindromic time to the next? This assumes a 24-hour clock without leading zeros.

I think my question is neater, because to justify your answer you have to enumerate all the possible intervals. I should have said that it assumes a 12 hour clock. JHC