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.
Short solution:
( 1 + 9 9 9 9 9 ) × 5 0 0 0 0 ( 1 0 0 0 0 1 + 1 9 9 9 9 9 ) × 5 0 0 0 0 = 1 0 0 0 0 0 × 5 0 0 0 0 3 0 0 0 0 0 × 5 0 0 0 0 = 3
Long solution:
In the numerator,
( a k + a n − k ) n u m e r a t o r is a constant value:
1 0 0 0 0 1 + 1 9 9 9 9 9 = 1 0 0 0 0 3 + 1 9 9 9 9 7 = ( a k + a n − k ) n u m e r a t o r = 3 0 0 0 0 0
And there are
2 ( a n − a 1 ) + 1 = 2 1 0 0 0 0 0 = 5 0 0 0 0
iterations of this constant value, so
1 0 0 0 0 1 + 1 0 0 0 0 3 + . . . + 1 9 9 9 9 7 + 1 9 9 9 9 9 = 3 0 0 0 0 0 × 5 0 0 0 0
Similarly, in the denominator ( a k + a n − k ) d e n o m i n a t o r is also constant.
Notice that all of the terms in the denominator are just the terms in the numerator + 1 0 0 0 0 0 , so
( a k + a n − k ) d e n o m i n a t o r = ( a k + a n − k ) n u m e r a t o r − ( 1 0 0 0 0 0 × 2 ) .
( a k + a n − k ) d e n o m i n a t o r = 1 0 0 0 0 0
And since the terms in the denominator are all just shifted from those in the numerator by 1 0 0 0 0 0 , it has the same number of iterations of a k + a n − k : 5 0 0 0 0 .
1 + 3 + 5 + . . . + 9 9 9 9 9 1 0 0 0 0 1 + 1 0 0 0 0 3 + 1 0 0 0 0 5 + . . . + 1 9 9 9 9 9 = 1 0 0 0 0 0 × 5 0 0 0 0 3 0 0 0 0 0 × 5 0 0 0 0 = 3