Consider the set . It contains all the positive integers from 1 to 2017. The total sum of the products of the elements in each non-empty subset of this set is . Suppose is a function such that for positive integers , . Find .
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.
Consider the following product:
k = 1 ∏ n ( x + a k ) = x n + x n − 1 k = 1 ∑ n a k + x n − 2 j , k = 1 , j = k ∑ n a j a k + x n − 3 i , j , k = 1 , i = j = k ∑ n a i a j a k + ⋯ + k = 1 ∏ n a k = x n + c n − 1 x n − 1 + c n − 2 x n − 2 + c n − 3 x n − 3 + ⋯ + c 2 x 2 + c 1 x + c 0
We note that k = 0 ∑ n − 1 c k = S a is the sum of products of each non-empty subset of the set { a 1 , a 2 , a 3 , . . . a n } . Replacing x = 1 and a k = k , we have:
k = 1 ∏ n ( 1 + k ) ⟹ S + 1 S + 1 ⟹ f ( S + 1 ) = 1 + S = ( n + 1 ) ! = 2 0 1 8 ! = 2 0 1 8 For n = 2 0 1 7