Evaluate the expression where the digit 2 appears 2 0 2 0 times:
2 − 2 − 2 − 2 − ⋯ − 2 − 2 1 1 1 1 1 1
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.
Problem Loading...
Note Loading...
Set Loading...
Let a n be the fraction where the digit 2 appears n times. Then:
or a n = 2 − a n − 1 1 , which can be shown inductively to be a n = n + 1 n .
Therefore, a 2 0 2 0 = 2 0 2 0 + 1 2 0 2 0 = 2 0 2 1 2 0 2 0 .