The number A is the sum of all the terms i ! j ! k ! l ! 2 0 1 9 ! , where i , j , k , and l are non-negative integer numbers satisfying that i + j + k + l = 2 0 1 9 . Find ⌊ ln A ⌋
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.
It can be proved that ( x 1 + x 2 + x 3 + x 4 ) n is equal to the sum of all numbers of the form i ! j ! k ! l ! n ! x 1 i x 2 j x 3 k x 4 l for all non-negative integers satisfying that i + j + k + l = n . Then making x 1 = x 2 = x 3 = x 4 = 1 , we obtain that the sum of all numbers of the form i ! j ! k ! l ! n ! for all non-negative integers satisfying that i + j + k + l = n , is equal to 4 n . Making n = 2 0 1 9 , we get that the number A = 4 2 0 1 9 . Then ln A = 2 0 1 9 ln 4 = 2 7 9 8 . 9 2 . . . . Therefore, the answer to this problem is 2 7 9 8 .
Problem Loading...
Note Loading...
Set Loading...
The number i ! j ! k ! l ! 2 0 1 9 ! represents the number of ways to separate a set X with 2019 elements into a partition of four distinct subsets, X 1 , X 2 , X 3 , and X 4 , such that ∣ X 1 ∣ = i , ∣ X 2 ∣ = j , ∣ X 3 ∣ = k , and ∣ X 4 ∣ = l .
As we sum over possible values i , j , k , and l , we count the number of functions from the set X to the set { 1 , 2 , 3 , 4 } .
The number of such functions is A = 4 2 0 1 9 .
Then ln A = 2 0 1 9 ln 4 = 2 7 9 8 . 9 2 8 , and ⌊ ln A ⌋ = 2 7 9 8