Among his guests, Keith chooses a random subset of people to attend his super secret mathematics-themed party. Let be the number of people Keith chooses. Also, let be the expected value of .
If can be expressed in simplest form as compute the number of 's in the prime factorization of plus
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.
We let n = 1 0 0 9 , and Y = max { 0 , X − n } . It is clear that E [ Y ] = 2 2 n ∑ k = 0 n k ( n + k 2 n ) . But, observe that from Cauchy's Residue Theorem, ( n + k 2 n ) = 2 π i 1 ∮ ( 1 − z ) n + k + 1 z n − k + 1 d z where we integrate along ∣ z ∣ = ε . Summing this for all k ≥ 0 , we get k = 0 ∑ n k ( n + k 2 n ) = 2 π i 1 ∮ ( 1 − z ) n + 1 z n + 1 1 ⋅ k = 0 ∑ ∞ ( 1 − z ) k k z k d z = 2 π i 1 ∮ ( 1 − z ) n + 1 z n + 1 1 ⋅ ( 1 − z / ( 1 − z ) ) 2 z / ( 1 − z ) d z = 2 π i 1 ∮ ( 1 − z ) n z n ( 1 − 2 z ) 2 d z For ε sufficiently small, the image of ∣ z ∣ = ε under z → z ( 1 − z ) forms a nice closed path around 0 . So, let w = z ( 1 − z ) , which means that z = ( 1 − 1 − 4 w ) / 2 and ( 1 − 2 z ) 2 = 1 − 4 w . So, changing our variable of integration to be w , our sum becomes 2 π i 1 ∮ w n ( 1 − 4 w ) 3 / 2 d w = [ w n − 1 ] ( 1 − 4 w ) − 3 / 2 = ( − 4 ) n − 1 ( n − 1 − 3 / 2 ) = 2 n ( n 2 n ) . So, E [ Y ] = 2 2 n + 1 n ( n 2 n ) . We can check that ( n 2 n ) has 7 factors of 2 . So the answer is 2 n + 1 = 2 0 1 9 .
Remark We could've have gotten the sum in the following quicker but more boring way k = 0 ∑ n k ( n + k 2 n ) = k = 0 ∑ n ( n + k ) ( n + k 2 n ) − n k = 0 ∑ n ( k 2 n ) = 2 n k = 0 ∑ n ( n + k − 1 2 n − 1 ) − n ( 2 1 ( n 2 n ) + 2 2 n − 1 ) = 2 n ( ( n 2 n − 1 ) + 2 2 n − 2 ) − n ( 2 1 ( n 2 n ) + 2 2 n − 1 ) = 2 n ( n 2 n ) .