A certain factory produces numbers to be used in math problems. A worker there named Alex is given a batch of numbers. First, he removes one number for inspection, then packages half of the remaining numbers. From the remaining numbers, he removes one and packages half the numbers after that. He repeats this process more times (remove one, package half the remaining), and at the end, he is left with one number that he keeps for himself. Find the units digit of .
Notes:
After the first sorting, Alex is left with numbers. After the second sorting, he is left with numbers, and so on.
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.
After the 2 0 1 5 th sorting, Alex has 2 ( 1 ) + 1 = 2 + 1 numbers. (This is basically the inverse of the given function f ( x ) = 2 1 ( x − 1 ) in the problem.) After the 2 0 1 4 th sorting, Alex has 2 ( 2 ( 1 ) + 1 ) + 1 = 2 2 + 2 + 1 numbers, and so on. Thus, after the 2 0 1 6 − n th sorting, where n is a positive integer less than 2 0 1 6 , there are 2 n + 2 n − 1 + ⋅ + 2 + 1 numbers left. For n = 2 0 1 6 , i.e. the start, we have 2 2 0 1 6 + 2 2 0 1 5 + ⋯ + 2 + 1 = 2 2 0 1 7 − 1 , where we apply the geometric series formula to calculate the series. 2 2 0 1 7 has a units digit of 2 , so 2 2 0 1 7 − 1 has units digit 1 .