Double Sum and Double Product

p = 1 n m = p n ( n m ) ( m p ) \displaystyle \sum^{n}_{p=1} \sum^{n}_{m=p} \dbinom{n}{m} \dbinom{m}{p}

If the value of the above expression is in the form a n b n a^n-b^n , where a a and b b are prime numbers , find a + b a+b .


The answer is 5.

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.

3 solutions

Ivan Koswara
Jan 13, 2017

( n m ) \binom{n}{m} counts the number of ways to pick m m out of n n balls to have non-red color (the rest are red), and ( m p ) \binom{m}{p} counts the number of ways to pick p p out of m m non-red balls to have blue color (the rest are green). So ( n m ) ( m p ) \binom{n}{m} \binom{m}{p} counts the number of ways to color n n balls into n m n-m red, m p m-p green, and p p blue.

Summing over all m m means we count the number of ways to color n n balls in red, green, and blue so that p p are blue. (The rest are red and/or green; the value of m m follows what coloring we get.) Summing over all p p , except for p = 0 p = 0 , means we color n n balls in red, green, and/or blue, such that there is at least one blue ball. The number of ways is simply 3 n 2 n 3^n - 2^n : the number of ways to color n n balls in 3 colors, minus the number of ways to color n n in 2 colors (without blue). So a + b = 3 + 2 = 5 a + b = 3 + 2 = 5 .

did the same

Akash singh - 4 years, 5 months ago
Mark Hennings
Jan 13, 2017

We have p = 1 n m = p n ( n m ) ( m p ) = 1 p m n n ! p ! ( m p ) ! ( n m ) ! = a + b + c = n a 1 , b , c 0 n ! a ! b ! c ! = a + b + c = n a , b , c 0 n ! a ! b ! c ! b + c = n b , c 0 n ! b ! c ! = 3 n 2 n \sum_{p=1}^n \sum_{m=p}^n \binom{n}{m}\binom{m}{p} \; = \; \sum_{1 \le p \le m \le n} \frac{n!}{p! (m-p)! (n-m)!} \; = \; \sum_{{a+b+c=n} \atop {a \ge 1, b,c \ge 0}} \frac{n!}{a! b! c!} \; = \; \sum_{{a+b+c=n} \atop {a,b,c \ge 0}} \frac{n!}{a! b! c!} - \sum_{{b+c=n} \atop {b,c \ge 0}} \frac{n!}{b! c!} \; = \; 3^n - 2^n making the answer 5 \boxed{5} .

Anirudh Sreekumar
Jan 13, 2017

p = 1 n m = p n ( n m ) ( m p ) = p = 1 n m = p n n ! p ! ( m p ) ! ( n m ) ! \displaystyle \sum_{p=1}^n\displaystyle \sum_{m=p}^n{n \choose m}{m \choose p}=\displaystyle \sum_{p=1}^n\displaystyle \sum_{m=p}^n\frac{n!}{p!(m-p)!(n-m)!}

now this can be rewritten as p = 1 n ( n p ) ( p 0 ) + ( n p + 1 ) ( p + 1 1 ) + ( n p + 2 ) ( p + 2 2 ) . . . . . . . . . . . + ( n n ) ( n p ) \displaystyle \sum_{p=1}^n{n \choose p}{p \choose 0}+{n \choose p+1}{p+1 \choose 1}+{n \choose p+2}{p+2 \choose 2}...........+{n \choose n}{n \choose p}

This is the coefficient of x p x^p in the expansion of ( 1 + ( 1 + x ) ) n (1+(1+x))^n .

Thus we are required to to find the sum of coefficents of all powers of x x except x = 0 x=0

Total sum of coefficients is obtained by putting the value of x = 1 x=1 ,in ( 1 + ( 1 + x ) ) n (1+(1+x))^n which equals 3 n 3^n ( 1 ) (1)

The sum of coefficients of terms independent of x x is given by putting x = 0 x=0 ,in ( 1 + ( 1 + x ) ) n (1+(1+x))^n which equals 2 n 2^n ( 2 ) (2)

Thus the required sum is ( 1 ) ( 2 ) = 3 n 2 n (1)-(2)=3^n-2^n

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...