You have a set of 20 different objects.
Let be the total number of ways in which you can select and permute any number of these objects.
Find the digit sum of .
Details and Assumptions
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.
The required number of ways is r = 0 ∑ 2 0 ( r 2 0 ) r ! = r = 0 ∑ 2 0 ( r 2 0 ) ∫ 0 ∞ e − x x r d x = ∫ 0 ∞ r = 0 ∑ 2 0 ( r 2 0 ) e − x x r d x = ∫ 0 ∞ e − x ( 1 + x ) 2 0 d x = e ⋅ Γ ( 2 1 , 1 )
Note : Γ ( a , x ) is the upper incomplete gamma function.