Finding a Sum in 2019.

Algebra Level 3

The number A A is the sum of all the terms 2019 ! i ! j ! k ! l ! , \large\frac{2019!}{i!j!k!l!}, where i , j , k , i, j, k, and l l are non-negative integer numbers satisfying that i + j + k + l = 2019. i+j+k+l=2019. Find ln A \lfloor \ln A \rfloor


The answer is 2798.

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.

2 solutions

Richard Desper
Nov 15, 2019

The number 2019 ! i ! j ! k ! l ! \frac{2019!}{i!j!k!l!} represents the number of ways to separate a set X X with 2019 elements into a partition of four distinct subsets, X 1 X_1 , X 2 X_2 , X 3 X_3 , and X 4 X_4 , such that X 1 = i , X 2 = j , X 3 = k |X_1| = i, |X_2| = j, |X_3| = k , and X 4 = l |X_4| = l .

As we sum over possible values i , j , k i,j,k , and l l , we count the number of functions from the set X X to the set { 1 , 2 , 3 , 4 } \{1,2,3,4\} .

The number of such functions is A = 4 2019 A=4^{2019} .

Then ln A = 2019 ln 4 = 2798.928 \ln A = 2019 \ln 4 = 2798.928 , and ln A = 2798 \lfloor{\ln A}\rfloor = 2798

Arturo Presa
Nov 15, 2019

It can be proved that ( x 1 + x 2 + x 3 + x 4 ) n (x_1+x_2+x_3+x_4)^n is equal to the sum of all numbers of the form n ! i ! j ! k ! l ! x 1 i x 2 j x 3 k x 4 l \frac{n!}{i!j!k!l!} x_1^ix_2^jx_3^kx_4^l for all non-negative integers satisfying that i + j + k + l = n . i+j+k+l=n. Then making x 1 = x 2 = x 3 = x 4 = 1 , x_1=x_2=x_3=x_4=1, we obtain that the sum of all numbers of the form n ! i ! j ! k ! l ! \frac{n!}{i!j!k!l!} for all non-negative integers satisfying that i + j + k + l = n , i+j+k+l=n, is equal to 4 n . 4^n. Making n = 2019 , n=2019, we get that the number A = 4 2019 . A=4^{2019}. Then ln A = 2019 ln 4 = 2798.92.... \ln A = 2019 \ln 4 =2798. 92... . Therefore, the answer to this problem is 2798 . \boxed{2798}.

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...