Combinatorial proof identity
Clash Royale CLAN TAG#URR8PPP
up vote
2
down vote
favorite
Give a combinatorial proof of the following identity: $$binom3n3 =3binomn3 +6nbinomn2 +n^3.$$
I've been working on this proof for hours, however I'm not able to show LHS = RHS-
I completely understand binomial theorem and few combinatorial proofs but not able to succeed this one.
Help would be appreciated.
combinatorics
add a comment |Â
up vote
2
down vote
favorite
Give a combinatorial proof of the following identity: $$binom3n3 =3binomn3 +6nbinomn2 +n^3.$$
I've been working on this proof for hours, however I'm not able to show LHS = RHS-
I completely understand binomial theorem and few combinatorial proofs but not able to succeed this one.
Help would be appreciated.
combinatorics
@MagedSaeed yes
â m.saza
9 mins ago
add a comment |Â
up vote
2
down vote
favorite
up vote
2
down vote
favorite
Give a combinatorial proof of the following identity: $$binom3n3 =3binomn3 +6nbinomn2 +n^3.$$
I've been working on this proof for hours, however I'm not able to show LHS = RHS-
I completely understand binomial theorem and few combinatorial proofs but not able to succeed this one.
Help would be appreciated.
combinatorics
Give a combinatorial proof of the following identity: $$binom3n3 =3binomn3 +6nbinomn2 +n^3.$$
I've been working on this proof for hours, however I'm not able to show LHS = RHS-
I completely understand binomial theorem and few combinatorial proofs but not able to succeed this one.
Help would be appreciated.
combinatorics
combinatorics
edited 58 mins ago
Tianlalu
2,001629
2,001629
asked 1 hour ago
m.saza
223
223
@MagedSaeed yes
â m.saza
9 mins ago
add a comment |Â
@MagedSaeed yes
â m.saza
9 mins ago
@MagedSaeed yes
â m.saza
9 mins ago
@MagedSaeed yes
â m.saza
9 mins ago
add a comment |Â
5 Answers
5
active
oldest
votes
up vote
3
down vote
accepted
$$3nchoose3=3nchoose3+6nnchoose2+n^3$$$$frac12ncdot(3n-1)cdot(3n-2)=frac12ncdot(n-1)cdot(n-2)+3n^2cdot(n-1)+n^3$$Can you take it from here?
Why do people post algebraic solutions when the OP is asking specifically (in boldface) for a combinatorial proof? Not gonna vote down algebraic solutions though. Just saying. And +1 only to Achille Hui.
â Ken Draco
33 mins ago
1
@KenDraco I might have misread the question at first. Oops!
â Rushabh Mehta
32 mins ago
I got it. I myself am prone to such things. I just mean all the answers below -:)
â Ken Draco
23 mins ago
I feel dirty since I don't feel like this should be the accepted answer.
â Rushabh Mehta
7 mins ago
Don't. If you take a look at the mess and trolling/incompetency (I'm shocked) on other SE sites (including astronomy), than math and physics are a true paradise.
â Ken Draco
11 secs ago
add a comment |Â
up vote
5
down vote
Arrange $3n$ balls into 3 rows and each row contains $n$ balls.
There are $binomn3$ ways to select $3$ balls from them. We can group the ways into $3$ categories:
Select one ball from each row. There are $n$ choices for each row, this contribute $n^3$ ways of pick the balls.
Select two balls from one row and one ball from another row. There are $3 times 2$ ways to select the rows. Since there are $binomn2$ ways to select two balls from a row and $n$ ways to select one balls from a row, this contribute $6 binomn2 n$ ways to pick the balls.
Select three balls from a single row. There are $3$ ways to select the row and $binomn3$ ways to select three balls from that particular row. This contributes $3binomn3$ ways.
These $3$ categories of choicing doesn't overlap and exhaust all possible ways to select three balls. As a result,
$$binom3n3 = n^3 + 6binomn2 n + 3binomn3$$
Great answer +1!
â Rushabh Mehta
51 mins ago
add a comment |Â
up vote
0
down vote
$2!=2, 3!=6$, so:
$$binom3n3=frac n2(3n-1)(3n-2)$$
$$3binomn3=frac n2(n-1)(n-2)$$
$$6nbinomn2=3n^2(n-1)$$
I used that $$fracx!(x-a)!=x^underlinex-a=prod_n=0^a-1(x-n)$$
See falling factorials
2
This would be an algebraic proof, not a combinatorial proof.
â Mark S.
55 mins ago
add a comment |Â
up vote
0
down vote
Brute force:
$27n^3 - 27n^2+ 6n = 27n^3 - 27n^2 + 6n$
$27n^3 - 9n^2 - 18n^2 + 6n = 3n^3 - 3n^2 - 6n^2 + 6n + 18n^3 - 18n^2 + 6n^3$
$(9n^2 - 3n)(3n - 2) = (3n^2 - 3n)(n - 2) + 18n^2(n-1) + 6n^3$
$3n(3n - 1)(3n - 2) = 3n(n - 1)(n - 2) + 3(6n)n(n-1) + 6n^3$
$3n(3n - 1)(3n - 2)/6 = 3n(n - 1)(n - 2)/6 + (6n)n(n-1)/2 + n^3$
$binom3n3 =3binomn3 +6nbinomn2 +n^3$
1
A proof that thinks about combination (as in choosing n objects from m objects) is better because it trains intuition. But for simple problems, algebra and brute force is sufficient.
â R zu
1 hour ago
2
This would be an algebraic proof, not a combinatorial proof.
â Mark S.
55 mins ago
add a comment |Â
up vote
0
down vote
Notice that the LHS is:
$$frac3n times (3n-1) times (3n-2)3! = fracn times (3n-1) times (3n-2)2$$
$$to frac9n^3-9n^2+2n2$$
For the RHS:
$$3 times fracntimes(n-1)times(n-2)3! + 6n times fracntimes(n-1)2! + frac2n^32$$
$$Longrightarrow fracntimes(n-1)times(n-2)2 + frac6n^2 times(n-1)2 + frac2n^32$$
$$to frac9n^3-9n^2+2n2$$
Hence, RHS=LHS.
add a comment |Â
5 Answers
5
active
oldest
votes
5 Answers
5
active
oldest
votes
active
oldest
votes
active
oldest
votes
up vote
3
down vote
accepted
$$3nchoose3=3nchoose3+6nnchoose2+n^3$$$$frac12ncdot(3n-1)cdot(3n-2)=frac12ncdot(n-1)cdot(n-2)+3n^2cdot(n-1)+n^3$$Can you take it from here?
Why do people post algebraic solutions when the OP is asking specifically (in boldface) for a combinatorial proof? Not gonna vote down algebraic solutions though. Just saying. And +1 only to Achille Hui.
â Ken Draco
33 mins ago
1
@KenDraco I might have misread the question at first. Oops!
â Rushabh Mehta
32 mins ago
I got it. I myself am prone to such things. I just mean all the answers below -:)
â Ken Draco
23 mins ago
I feel dirty since I don't feel like this should be the accepted answer.
â Rushabh Mehta
7 mins ago
Don't. If you take a look at the mess and trolling/incompetency (I'm shocked) on other SE sites (including astronomy), than math and physics are a true paradise.
â Ken Draco
11 secs ago
add a comment |Â
up vote
3
down vote
accepted
$$3nchoose3=3nchoose3+6nnchoose2+n^3$$$$frac12ncdot(3n-1)cdot(3n-2)=frac12ncdot(n-1)cdot(n-2)+3n^2cdot(n-1)+n^3$$Can you take it from here?
Why do people post algebraic solutions when the OP is asking specifically (in boldface) for a combinatorial proof? Not gonna vote down algebraic solutions though. Just saying. And +1 only to Achille Hui.
â Ken Draco
33 mins ago
1
@KenDraco I might have misread the question at first. Oops!
â Rushabh Mehta
32 mins ago
I got it. I myself am prone to such things. I just mean all the answers below -:)
â Ken Draco
23 mins ago
I feel dirty since I don't feel like this should be the accepted answer.
â Rushabh Mehta
7 mins ago
Don't. If you take a look at the mess and trolling/incompetency (I'm shocked) on other SE sites (including astronomy), than math and physics are a true paradise.
â Ken Draco
11 secs ago
add a comment |Â
up vote
3
down vote
accepted
up vote
3
down vote
accepted
$$3nchoose3=3nchoose3+6nnchoose2+n^3$$$$frac12ncdot(3n-1)cdot(3n-2)=frac12ncdot(n-1)cdot(n-2)+3n^2cdot(n-1)+n^3$$Can you take it from here?
$$3nchoose3=3nchoose3+6nnchoose2+n^3$$$$frac12ncdot(3n-1)cdot(3n-2)=frac12ncdot(n-1)cdot(n-2)+3n^2cdot(n-1)+n^3$$Can you take it from here?
edited 56 mins ago
answered 1 hour ago
Rushabh Mehta
3,785530
3,785530
Why do people post algebraic solutions when the OP is asking specifically (in boldface) for a combinatorial proof? Not gonna vote down algebraic solutions though. Just saying. And +1 only to Achille Hui.
â Ken Draco
33 mins ago
1
@KenDraco I might have misread the question at first. Oops!
â Rushabh Mehta
32 mins ago
I got it. I myself am prone to such things. I just mean all the answers below -:)
â Ken Draco
23 mins ago
I feel dirty since I don't feel like this should be the accepted answer.
â Rushabh Mehta
7 mins ago
Don't. If you take a look at the mess and trolling/incompetency (I'm shocked) on other SE sites (including astronomy), than math and physics are a true paradise.
â Ken Draco
11 secs ago
add a comment |Â
Why do people post algebraic solutions when the OP is asking specifically (in boldface) for a combinatorial proof? Not gonna vote down algebraic solutions though. Just saying. And +1 only to Achille Hui.
â Ken Draco
33 mins ago
1
@KenDraco I might have misread the question at first. Oops!
â Rushabh Mehta
32 mins ago
I got it. I myself am prone to such things. I just mean all the answers below -:)
â Ken Draco
23 mins ago
I feel dirty since I don't feel like this should be the accepted answer.
â Rushabh Mehta
7 mins ago
Don't. If you take a look at the mess and trolling/incompetency (I'm shocked) on other SE sites (including astronomy), than math and physics are a true paradise.
â Ken Draco
11 secs ago
Why do people post algebraic solutions when the OP is asking specifically (in boldface) for a combinatorial proof? Not gonna vote down algebraic solutions though. Just saying. And +1 only to Achille Hui.
â Ken Draco
33 mins ago
Why do people post algebraic solutions when the OP is asking specifically (in boldface) for a combinatorial proof? Not gonna vote down algebraic solutions though. Just saying. And +1 only to Achille Hui.
â Ken Draco
33 mins ago
1
1
@KenDraco I might have misread the question at first. Oops!
â Rushabh Mehta
32 mins ago
@KenDraco I might have misread the question at first. Oops!
â Rushabh Mehta
32 mins ago
I got it. I myself am prone to such things. I just mean all the answers below -:)
â Ken Draco
23 mins ago
I got it. I myself am prone to such things. I just mean all the answers below -:)
â Ken Draco
23 mins ago
I feel dirty since I don't feel like this should be the accepted answer.
â Rushabh Mehta
7 mins ago
I feel dirty since I don't feel like this should be the accepted answer.
â Rushabh Mehta
7 mins ago
Don't. If you take a look at the mess and trolling/incompetency (I'm shocked) on other SE sites (including astronomy), than math and physics are a true paradise.
â Ken Draco
11 secs ago
Don't. If you take a look at the mess and trolling/incompetency (I'm shocked) on other SE sites (including astronomy), than math and physics are a true paradise.
â Ken Draco
11 secs ago
add a comment |Â
up vote
5
down vote
Arrange $3n$ balls into 3 rows and each row contains $n$ balls.
There are $binomn3$ ways to select $3$ balls from them. We can group the ways into $3$ categories:
Select one ball from each row. There are $n$ choices for each row, this contribute $n^3$ ways of pick the balls.
Select two balls from one row and one ball from another row. There are $3 times 2$ ways to select the rows. Since there are $binomn2$ ways to select two balls from a row and $n$ ways to select one balls from a row, this contribute $6 binomn2 n$ ways to pick the balls.
Select three balls from a single row. There are $3$ ways to select the row and $binomn3$ ways to select three balls from that particular row. This contributes $3binomn3$ ways.
These $3$ categories of choicing doesn't overlap and exhaust all possible ways to select three balls. As a result,
$$binom3n3 = n^3 + 6binomn2 n + 3binomn3$$
Great answer +1!
â Rushabh Mehta
51 mins ago
add a comment |Â
up vote
5
down vote
Arrange $3n$ balls into 3 rows and each row contains $n$ balls.
There are $binomn3$ ways to select $3$ balls from them. We can group the ways into $3$ categories:
Select one ball from each row. There are $n$ choices for each row, this contribute $n^3$ ways of pick the balls.
Select two balls from one row and one ball from another row. There are $3 times 2$ ways to select the rows. Since there are $binomn2$ ways to select two balls from a row and $n$ ways to select one balls from a row, this contribute $6 binomn2 n$ ways to pick the balls.
Select three balls from a single row. There are $3$ ways to select the row and $binomn3$ ways to select three balls from that particular row. This contributes $3binomn3$ ways.
These $3$ categories of choicing doesn't overlap and exhaust all possible ways to select three balls. As a result,
$$binom3n3 = n^3 + 6binomn2 n + 3binomn3$$
Great answer +1!
â Rushabh Mehta
51 mins ago
add a comment |Â
up vote
5
down vote
up vote
5
down vote
Arrange $3n$ balls into 3 rows and each row contains $n$ balls.
There are $binomn3$ ways to select $3$ balls from them. We can group the ways into $3$ categories:
Select one ball from each row. There are $n$ choices for each row, this contribute $n^3$ ways of pick the balls.
Select two balls from one row and one ball from another row. There are $3 times 2$ ways to select the rows. Since there are $binomn2$ ways to select two balls from a row and $n$ ways to select one balls from a row, this contribute $6 binomn2 n$ ways to pick the balls.
Select three balls from a single row. There are $3$ ways to select the row and $binomn3$ ways to select three balls from that particular row. This contributes $3binomn3$ ways.
These $3$ categories of choicing doesn't overlap and exhaust all possible ways to select three balls. As a result,
$$binom3n3 = n^3 + 6binomn2 n + 3binomn3$$
Arrange $3n$ balls into 3 rows and each row contains $n$ balls.
There are $binomn3$ ways to select $3$ balls from them. We can group the ways into $3$ categories:
Select one ball from each row. There are $n$ choices for each row, this contribute $n^3$ ways of pick the balls.
Select two balls from one row and one ball from another row. There are $3 times 2$ ways to select the rows. Since there are $binomn2$ ways to select two balls from a row and $n$ ways to select one balls from a row, this contribute $6 binomn2 n$ ways to pick the balls.
Select three balls from a single row. There are $3$ ways to select the row and $binomn3$ ways to select three balls from that particular row. This contributes $3binomn3$ ways.
These $3$ categories of choicing doesn't overlap and exhaust all possible ways to select three balls. As a result,
$$binom3n3 = n^3 + 6binomn2 n + 3binomn3$$
answered 56 mins ago
achille hui
92.2k5127248
92.2k5127248
Great answer +1!
â Rushabh Mehta
51 mins ago
add a comment |Â
Great answer +1!
â Rushabh Mehta
51 mins ago
Great answer +1!
â Rushabh Mehta
51 mins ago
Great answer +1!
â Rushabh Mehta
51 mins ago
add a comment |Â
up vote
0
down vote
$2!=2, 3!=6$, so:
$$binom3n3=frac n2(3n-1)(3n-2)$$
$$3binomn3=frac n2(n-1)(n-2)$$
$$6nbinomn2=3n^2(n-1)$$
I used that $$fracx!(x-a)!=x^underlinex-a=prod_n=0^a-1(x-n)$$
See falling factorials
2
This would be an algebraic proof, not a combinatorial proof.
â Mark S.
55 mins ago
add a comment |Â
up vote
0
down vote
$2!=2, 3!=6$, so:
$$binom3n3=frac n2(3n-1)(3n-2)$$
$$3binomn3=frac n2(n-1)(n-2)$$
$$6nbinomn2=3n^2(n-1)$$
I used that $$fracx!(x-a)!=x^underlinex-a=prod_n=0^a-1(x-n)$$
See falling factorials
2
This would be an algebraic proof, not a combinatorial proof.
â Mark S.
55 mins ago
add a comment |Â
up vote
0
down vote
up vote
0
down vote
$2!=2, 3!=6$, so:
$$binom3n3=frac n2(3n-1)(3n-2)$$
$$3binomn3=frac n2(n-1)(n-2)$$
$$6nbinomn2=3n^2(n-1)$$
I used that $$fracx!(x-a)!=x^underlinex-a=prod_n=0^a-1(x-n)$$
See falling factorials
$2!=2, 3!=6$, so:
$$binom3n3=frac n2(3n-1)(3n-2)$$
$$3binomn3=frac n2(n-1)(n-2)$$
$$6nbinomn2=3n^2(n-1)$$
I used that $$fracx!(x-a)!=x^underlinex-a=prod_n=0^a-1(x-n)$$
See falling factorials
answered 1 hour ago
Rhys Hughes
4,3741327
4,3741327
2
This would be an algebraic proof, not a combinatorial proof.
â Mark S.
55 mins ago
add a comment |Â
2
This would be an algebraic proof, not a combinatorial proof.
â Mark S.
55 mins ago
2
2
This would be an algebraic proof, not a combinatorial proof.
â Mark S.
55 mins ago
This would be an algebraic proof, not a combinatorial proof.
â Mark S.
55 mins ago
add a comment |Â
up vote
0
down vote
Brute force:
$27n^3 - 27n^2+ 6n = 27n^3 - 27n^2 + 6n$
$27n^3 - 9n^2 - 18n^2 + 6n = 3n^3 - 3n^2 - 6n^2 + 6n + 18n^3 - 18n^2 + 6n^3$
$(9n^2 - 3n)(3n - 2) = (3n^2 - 3n)(n - 2) + 18n^2(n-1) + 6n^3$
$3n(3n - 1)(3n - 2) = 3n(n - 1)(n - 2) + 3(6n)n(n-1) + 6n^3$
$3n(3n - 1)(3n - 2)/6 = 3n(n - 1)(n - 2)/6 + (6n)n(n-1)/2 + n^3$
$binom3n3 =3binomn3 +6nbinomn2 +n^3$
1
A proof that thinks about combination (as in choosing n objects from m objects) is better because it trains intuition. But for simple problems, algebra and brute force is sufficient.
â R zu
1 hour ago
2
This would be an algebraic proof, not a combinatorial proof.
â Mark S.
55 mins ago
add a comment |Â
up vote
0
down vote
Brute force:
$27n^3 - 27n^2+ 6n = 27n^3 - 27n^2 + 6n$
$27n^3 - 9n^2 - 18n^2 + 6n = 3n^3 - 3n^2 - 6n^2 + 6n + 18n^3 - 18n^2 + 6n^3$
$(9n^2 - 3n)(3n - 2) = (3n^2 - 3n)(n - 2) + 18n^2(n-1) + 6n^3$
$3n(3n - 1)(3n - 2) = 3n(n - 1)(n - 2) + 3(6n)n(n-1) + 6n^3$
$3n(3n - 1)(3n - 2)/6 = 3n(n - 1)(n - 2)/6 + (6n)n(n-1)/2 + n^3$
$binom3n3 =3binomn3 +6nbinomn2 +n^3$
1
A proof that thinks about combination (as in choosing n objects from m objects) is better because it trains intuition. But for simple problems, algebra and brute force is sufficient.
â R zu
1 hour ago
2
This would be an algebraic proof, not a combinatorial proof.
â Mark S.
55 mins ago
add a comment |Â
up vote
0
down vote
up vote
0
down vote
Brute force:
$27n^3 - 27n^2+ 6n = 27n^3 - 27n^2 + 6n$
$27n^3 - 9n^2 - 18n^2 + 6n = 3n^3 - 3n^2 - 6n^2 + 6n + 18n^3 - 18n^2 + 6n^3$
$(9n^2 - 3n)(3n - 2) = (3n^2 - 3n)(n - 2) + 18n^2(n-1) + 6n^3$
$3n(3n - 1)(3n - 2) = 3n(n - 1)(n - 2) + 3(6n)n(n-1) + 6n^3$
$3n(3n - 1)(3n - 2)/6 = 3n(n - 1)(n - 2)/6 + (6n)n(n-1)/2 + n^3$
$binom3n3 =3binomn3 +6nbinomn2 +n^3$
Brute force:
$27n^3 - 27n^2+ 6n = 27n^3 - 27n^2 + 6n$
$27n^3 - 9n^2 - 18n^2 + 6n = 3n^3 - 3n^2 - 6n^2 + 6n + 18n^3 - 18n^2 + 6n^3$
$(9n^2 - 3n)(3n - 2) = (3n^2 - 3n)(n - 2) + 18n^2(n-1) + 6n^3$
$3n(3n - 1)(3n - 2) = 3n(n - 1)(n - 2) + 3(6n)n(n-1) + 6n^3$
$3n(3n - 1)(3n - 2)/6 = 3n(n - 1)(n - 2)/6 + (6n)n(n-1)/2 + n^3$
$binom3n3 =3binomn3 +6nbinomn2 +n^3$
edited 58 mins ago
answered 1 hour ago
R zu
2379
2379
1
A proof that thinks about combination (as in choosing n objects from m objects) is better because it trains intuition. But for simple problems, algebra and brute force is sufficient.
â R zu
1 hour ago
2
This would be an algebraic proof, not a combinatorial proof.
â Mark S.
55 mins ago
add a comment |Â
1
A proof that thinks about combination (as in choosing n objects from m objects) is better because it trains intuition. But for simple problems, algebra and brute force is sufficient.
â R zu
1 hour ago
2
This would be an algebraic proof, not a combinatorial proof.
â Mark S.
55 mins ago
1
1
A proof that thinks about combination (as in choosing n objects from m objects) is better because it trains intuition. But for simple problems, algebra and brute force is sufficient.
â R zu
1 hour ago
A proof that thinks about combination (as in choosing n objects from m objects) is better because it trains intuition. But for simple problems, algebra and brute force is sufficient.
â R zu
1 hour ago
2
2
This would be an algebraic proof, not a combinatorial proof.
â Mark S.
55 mins ago
This would be an algebraic proof, not a combinatorial proof.
â Mark S.
55 mins ago
add a comment |Â
up vote
0
down vote
Notice that the LHS is:
$$frac3n times (3n-1) times (3n-2)3! = fracn times (3n-1) times (3n-2)2$$
$$to frac9n^3-9n^2+2n2$$
For the RHS:
$$3 times fracntimes(n-1)times(n-2)3! + 6n times fracntimes(n-1)2! + frac2n^32$$
$$Longrightarrow fracntimes(n-1)times(n-2)2 + frac6n^2 times(n-1)2 + frac2n^32$$
$$to frac9n^3-9n^2+2n2$$
Hence, RHS=LHS.
add a comment |Â
up vote
0
down vote
Notice that the LHS is:
$$frac3n times (3n-1) times (3n-2)3! = fracn times (3n-1) times (3n-2)2$$
$$to frac9n^3-9n^2+2n2$$
For the RHS:
$$3 times fracntimes(n-1)times(n-2)3! + 6n times fracntimes(n-1)2! + frac2n^32$$
$$Longrightarrow fracntimes(n-1)times(n-2)2 + frac6n^2 times(n-1)2 + frac2n^32$$
$$to frac9n^3-9n^2+2n2$$
Hence, RHS=LHS.
add a comment |Â
up vote
0
down vote
up vote
0
down vote
Notice that the LHS is:
$$frac3n times (3n-1) times (3n-2)3! = fracn times (3n-1) times (3n-2)2$$
$$to frac9n^3-9n^2+2n2$$
For the RHS:
$$3 times fracntimes(n-1)times(n-2)3! + 6n times fracntimes(n-1)2! + frac2n^32$$
$$Longrightarrow fracntimes(n-1)times(n-2)2 + frac6n^2 times(n-1)2 + frac2n^32$$
$$to frac9n^3-9n^2+2n2$$
Hence, RHS=LHS.
Notice that the LHS is:
$$frac3n times (3n-1) times (3n-2)3! = fracn times (3n-1) times (3n-2)2$$
$$to frac9n^3-9n^2+2n2$$
For the RHS:
$$3 times fracntimes(n-1)times(n-2)3! + 6n times fracntimes(n-1)2! + frac2n^32$$
$$Longrightarrow fracntimes(n-1)times(n-2)2 + frac6n^2 times(n-1)2 + frac2n^32$$
$$to frac9n^3-9n^2+2n2$$
Hence, RHS=LHS.
edited 36 mins ago
answered 45 mins ago
Maged Saeed
419215
419215
add a comment |Â
add a comment |Â
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2983705%2fcombinatorial-proof-identity%23new-answer', 'question_page');
);
Post as a guest
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
@MagedSaeed yes
â m.saza
9 mins ago