Find the integer solution to the following:
( 1 0 0 ! − 9 9 ! ) ( 9 8 ! − 9 7 ! ) ( 9 6 ! − 9 5 ! ) . . . . . ( 4 ! − 3 ! ) ( 2 ! − 1 ! ) ( 1 0 0 ! + 9 9 ! ) ( 9 8 ! + 9 7 ! ) ( 9 6 ! + 9 5 ! ) . . . . . ( 4 ! + 3 ! ) ( 2 ! + 1 ! )
You may try out The easy version
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.
Check my solution on the easy version, we can conclude that the asnwer is going to be 1 0 0 + 1 = 1 0 1
Problem Loading...
Note Loading...
Set Loading...
We can generalize the answer with this: Let n be the largest number of a fraction like this
Where the numbers are consecutive. We can factor the terms of each product considering that n ! = n ( n − 1 ) ! and ( n − k ) ! = ( n − k ) ( n − k − 1 ) ! with k ∈ Z and 0 < k < n , with this and simplifying the fraction that equals to
Given that the fraction equals n + 1 we can solve this problem easily. In this case, n = 1 0 0 and the fraction have consecutive numbers (without the factorial), so the answer must be n + 1 = 1 0 0 + 1 = 1 0 1