How could you characterise this?

Henry starts with a list of the first 1000 1000 positive integers, and performs a series of steps on the list. At each step, he erases any non-positive integers or any integers that have a repeated digit, and then decreases everything in the list by 1 1 . How many steps does it take for Henry’s list to be empty?


The answer is 11.

This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try refreshing the page, (b) enabling javascript if it is disabled on your browser and, finally, (c) loading the non-javascript version of this page . We're sorry about the hassle.

0 solutions

No explanations have been posted yet. Check back later!

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...