I n = ∫ 0 n ∫ 0 n ∫ 0 n … ∫ 0 n { k = 1 ∑ n x k } d x 1 d x 2 d x 3 … d x n Find the sum of the digits of I 2 0 1 8 .
Note: { x } represents the fractional part of x .
Inspired by 2018 integrations
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's first focus on the first integral, ∫ 0 n { x 1 + . . . + x n } d x 1 Leaving the other variables fixed, the values the function takes when 0 ≤ x 1 ≤ 1 are the same values it takes when k ≤ x 1 < k + 1 for any integer k . Thus, ∫ 0 n { x 1 + . . . + x n } d x 1 = n ∫ 0 1 { x 1 + . . . + x n } d x 1 . But we can do this with respect to all the variables, giving us our first simplification: ∫ 0 n . . . ∫ 0 n { x 1 + . . . + x n } d x 1 . . . d n = n n ∫ 0 1 . . . ∫ 0 1 { x 1 + . . . + x n } d x 1 . . . d x n
Let's now focus again on the first integral, ∫ 0 1 { x 1 + . . . + x n } d x 1 . Remembering that with respect to x 1 , all the other variables are constant, let's study the integral ∫ 0 1 { x + c } d x . Remembering that { ⋅ } is periodic with it taking its whole range of values in [ 0 , 1 ) , shifting it by a constant just changes the order in which those same values are attained. But we are integrating over the entirety of [ 0 , 1 ) so it doesn't matter. Thus, ∫ 0 1 { x + c } d x = ∫ 0 1 { x } d x = ∫ 0 1 x d x = 2 1 . With this result we can compute: ∫ 0 1 . . . ∫ 0 1 { x 1 + . . . + x n } d x 1 . . . d x n = ∫ 0 1 . . . ∫ 0 1 2 1 d x 2 . . . d x n = 2 1 giving us the final result: I n = 2 n n