Combinatorial proofs of identities use double counting and combinatorial characterizations of binomial coefficients, powers, factorials etc. They avoid complicated algebraic manipulations.

learn more… | top users | synonyms

1
vote
1answer
37 views

Question about some properties of combinatorial structures

Consider $\mathcal A$ as the set of perfect matchings in the complete bipartite graph $K_{n,n}$ and let $i$ be an edge of $K_{n,n}$. Let $$ B_i=\{a\in \mathcal A: \hbox{matching }a\hbox{ has edge ...
1
vote
1answer
23 views

Give an combinatorial argument

I need to find the possible value of $R_i$ and prove it by giving combinatorial argument, for following identity. I was able to give an argument like this. Consider double counting. Count ...
0
votes
2answers
20 views

Modulo congruence

I have a problem here that I have no idea how to go about solving. It states: Let $n∈Z$ with $n>1$. (a) If $n=2k$ for some odd integer $k$, prove that $k^3≡k \pmod{2n}$. (b) If $n=2k$ for ...
2
votes
3answers
48 views

Combinatorial Argument with Natural Numbers

Give a combinatorial argument to show that all natural numbers c(n,k) = c(n,m) where c stands for combination.
1
vote
1answer
58 views

combinatorial proof that $\sum_{i=r}^{n}(2i-r)\binom{i-1}{r-1}^2=r\binom{n}{r}^2$

I came accros the following identity when I was doing an olympiad problem (IMOSL 1997 - 13), but I'm having troubles finding a combinatorial interpretation. Can someone help me? ...
0
votes
0answers
16 views

Special partitions for cubic 3-edge connected graphs

I'm trying to prove the following A cubic 3-edge connected graph $G = (V, E)$ allows partitions $T_{i}\subset E$ such that $G\setminus T_{i}$ is 2-edge connected, for $i = 1,\ldots, 5$. In ...
0
votes
0answers
8 views

In each conjecture, G represents a finite simple graph. If x and y are in the periphery of G and x ≠ y, then d(x,y) = diam(G)

I have several HW problems I need assistance with... this is just one In each conjecture, G represents a finite simple graph. If x and y are in the periphery of G and x ≠ y, then d(x,y) = diam(G)
-2
votes
0answers
9 views

Why doesnt a (43, 43, 7, 7, 1)-design exist according to the conditions?

I have tested this using the necessary conditions for a BIBD and it's giving me a green light but I know this isn't a design. Why not?
5
votes
4answers
379 views

Give a combinatorial argument

Give a combinatorial argument to show that $$\binom{6}{1} + 2 \binom{6}{2} + 3\binom{6}{3} + 4 \binom{6}{4} + 5 \binom{6}{5} + 6 \binom{6}{6} = 6\cdot2^5$$ Not quite where to starting proving this ...
3
votes
4answers
163 views

proving an invloved combinatorial identity

How to prove following Identity? $$\sum_{k=0}^n (-1)^k {n-k \choose k} m^k (m+1)^{n-2k} = \frac {m^{n+1}-1}{m-1}, m \ge 2$$ This seems very hard to me. Any idea about how to prove it combinatorialy? ...
1
vote
3answers
65 views

Combinatorial proof of $ k{n \choose k} = n {n-1\choose k-1} $

I have to prove this using a combinatorial proof $$ k{n \choose k} = n {n-1\choose k-1} $$ What's the standard procedure on doing this? The only thing I managed was to split it into: (by fixing one ...
6
votes
5answers
156 views

Verify the following combinatorial identity: $\sum_{k=0}^{r} \binom{m}{k}\binom{n}{r-k} = \binom{m+n}{r}$ [duplicate]

$$\sum_{k=0}^{r} \binom{m}{k}\binom{n}{r-k} = \binom{m+n}{r}$$ Nice, so I've proven some combinatorial identities before via induction, other more simple ones by committee selection models.... But ...
2
votes
1answer
98 views

Proof with combinatorial argument

Show with combinatorial argument that this is equal : $$\dbinom{n}{k+1} = \dbinom{n-1}{k}+ \dbinom{n-2}{k} +...+ \dbinom{k}{k}$$ I have no idea how to do that so it would be really helpful ...
0
votes
0answers
15 views

extreme points of a symmetric doubly stochastic polytope

I have a problem with Katz's paper (On the extreme points of a certain convex polytope)... I did not understand the proof of lemma3 on pages 420-421...I have a problem with getting the values of u ...
0
votes
1answer
37 views

Combinatorial Proof: How many length-n lists can we form using the elements in {1,2,3} [PROOF]

I'm trying to prove that $2\times(3^0) + 2\times(3^1) + 2\times(3^2) + \cdots+ 2\times(3^(n-1)) = 3^n - 1$ by answering the question "how many length-n lists can we form using the elements in ...
0
votes
2answers
86 views

combinatorial proof of summation

Prove $\sum_{i=1}^n2^{i-1}=\sum_{i=0}^{n-1}2^i=2^n-1$ combinatorially. This is easy to prove inductively. I know that $\sum_{i=0}^n{n\choose i}=2^n$ so maybe change $\sum_{i=0}^{n-1}2^i$ to ...
0
votes
1answer
17 views

Proving overlap when distributing certain number of balloons to forty children.

Sorry for the title, couldn't think of a better way to phrase it. The problem is this: Forty children go to a carnival. Twenty-five are given a blue balloon, 30 a red balloon, 35 a green, and 33 a ...
1
vote
2answers
97 views

Give a combinatorial proof to show the following for all integers $n \geq 2$.

$$2^{n-2} n (n -1) = \sum\limits_{k=2}^n k (k - 1) \binom{n}{k}.$$ I'm completely stumped. I just have no idea how to do this. What I've tried so far has been simplifying the right hand side slightly ...
0
votes
2answers
43 views

Understanding a combinatorial relation.

I would like some insight as to why the following expression is true. $$\sum_{i=0}^n {{n}\choose{i}} 2^{n-i} = 3^n $$ I arrived at this relation in solving a subset problem, and I understand the ...
0
votes
5answers
64 views

Combinatorial argument for the sum of the first $n$ integers.

Can someone give a combinatorial argument (at least for $\binom{n+1}{2}$) for why $\binom{n+1}{2}=(n^2+n)/2$?
0
votes
1answer
73 views

Prove with combinatorial arguments this equation [duplicate]

Prove with combinatorial arguments, that, $\forall n \in \mathbb{N}$. $$\sum_{k=0}^n (-1)^k {n \choose k} =0$$
1
vote
0answers
77 views

A sum with binomial coefficients in the numerator and denominator.

I am struggling with a combinatorial sum as apart of a long statistical-mechanics derivation. I would appreciate any help. I seek the result of the following summation, for integer $\ell,n$, and ...
0
votes
2answers
73 views

Combinatorial argument $a(n-a)$ $n \choose a $ = $n(n-1)$ $n-2 \choose a-1$

I can not make sense of this; I am looking for a combinatorial argument that would prove the equivalence of this statement. I can prove it with algebraic manipulation. $a(n-a)$ $n \choose a $ = ...
1
vote
3answers
135 views

Prove this combinatorial identity

$${n \choose k}{k \choose 1}{k-1 \choose 1} = n(n-1){n-2 \choose k-2}$$
2
votes
1answer
127 views

Combinatorial proof involving reciprocals

This is a follow-up to this question: show that if $n$ is a positive integer then $$\sum_{k=1}^{n}\frac{(-1)^{k+1}}{k}\binom{n}{k} =\sum_{k=1}^{n}\frac{1}{k}\ .$$ I was able to answer the question by ...
10
votes
3answers
367 views

Help with combinatorial proof of identity: $\sum_{k=1}^{n} \frac{(-1)^{k+1}}{k} \binom{n}{k} = \sum_{k=1}^{n} \frac{1}{k}$

How to prove this identity? Can someone please give me some insight ? $$\sum_{k=1}^{n} \frac{(-1)^{k+1}}{k} \binom{n}{k} = \sum_{k=1}^{n} \frac{1}{k}$$
2
votes
2answers
84 views

Combinatorial proof of $n! = {n\choose k}k!(n-k)!$

Can someone give me some insight on the proof of $$n! = {n\choose k}k!(n-k)!$$ I understand algebraically why they are equal but I'm having trouble seeing what the right side is actually saying. On ...
3
votes
1answer
108 views

Combinatorial proof of $k\binom{n}{k} = n\binom{n-1}{k-1}$ [duplicate]

I'm trying to prove this combinatorially. $$k\binom{n}{k} = n\binom{n-1}{k-1}$$ I know the first step is to relate a question to the equation. My question was if you have $n$ friends how many ways can ...
1
vote
1answer
58 views

Finite sum identity involving Stirling numbers

I was given the following identities (note: $s_{n,k},S_{n,k}$ are the Stirling numbers of first and second kind respectively): (1) $s_{n+1,k+1}=\sum_{i=k}^{n}\binom{i}{k}s_{n,i}$ (2) ...
0
votes
1answer
108 views

Combinatorial proofs - how?

I'm suppose to proof the following with combinatorial proofs. 1)$$\sum_{i=0}^{n} {a+i \choose i} = {a+n+1 \choose n}$$ 2)$$\sum_{i=0}^{n} i{n \choose i} = n2^{n-1}$$ 3)$$\sum_{i=0}^{n} {n \choose ...
2
votes
1answer
49 views

Confirming the correctness of Combinatoric permutation formula

for the ordering and distinguishable non-empty, is it $$ (n)k = n(n-1)(n-2)\cdots(n-k+1) $$ for no ordering distinguishable non-empty, i got $$ \sum_{i=0}^{n-1}(-1)^i\dbinom{n}{i}(n-i)^k $$ please ...
12
votes
3answers
212 views

Prove $1^2+2^2+\cdots+n^2 = {n+1\choose2}+2{n+1\choose3}$

Prove that: $$ 1^2+2^2+\cdots+n^2 = {n+1\choose2}+2{n+1\choose3} $$ Now, if I simplify the right hand combinatorial expression, it reduces to $\frac{n(n+1)(2n+1)}{6}$ which is well known and can be ...
1
vote
1answer
92 views

The properties of graph and its relation with the largest eigenvalue

When I was solving questions from a graph theory book by Bondy and Murty, I came across this problem: ( Note: $\Delta$ represents the maximum degree. ) Show that: a) no eigenvalue of a graph ...
1
vote
1answer
37 views

Discrete Mathematics Proof odd degree

Show that for a graph letting r be the number of vertices with odd degree( with an odd number of edges) show that r is even. Is that about Euler's criterion or is there any other solution?
2
votes
3answers
97 views

Combinatorial proofs of the identity $(a+b)^2 = a^2 +b^2 +2ab$

The question I have is to give a combinatorial proof of the identity $(a+b)^2 = a^2 +b^2 +2ab$. I understand the concept of combinatorial proofs but am having some trouble getting started with this ...
4
votes
2answers
153 views

Prove that $(n!)^2$ is greater than $n^n$ for all values of n greater than 2. [duplicate]

This problem , I assume can be proved using induction, however I am trying to find another way. Is there a simple combinatorial approach? One notices that $(n!)^2$ is equal to the number of ...
3
votes
1answer
257 views

Combinatorial Proof - $\ {1 \over n+1} {2n\choose n} = {2n-1\choose n-1} - {2n-1\choose n+1} = {2n\choose n} - {2n\choose n-1}$

I'm been struggling with this proof for quite a while now - I'm trying to combinatorially prove this expression: $$ {1 \over n+1} {2n\choose n} = {2n-1\choose n-1} - {2n-1\choose n+1}$$ $$= ...
2
votes
1answer
227 views

Combinatorial Proof -$\ n \choose r $ = $\frac nr$$\ n-1 \choose r-1$

I'm reading about combinatorics, specifically 'Cohen's Introduction to Combinatorial Theory', and am stuck on one of the problems. I'm looking for a combinatorial proof for the following : $\ n ...
13
votes
3answers
361 views

Show that $\sum_{k=0}^n\binom{2n}{2k}^{\!2}-\sum_{k=0}^{n-1}\binom{2n}{2k+1}^{\!2}=(-1)^n\binom{2n}{n}$

How can I prove the identity: $$ \sum_{k=0}^n\binom{2n}{2k}^2-\sum_{k=0}^{n-1}\binom{2n}{2k+1}^2=(-1)^n\binom{2n}{n}? $$ Maybe, can we expand $$ f(x)=(1+x)^{2n}? $$ Thank you.
4
votes
1answer
99 views

Combinatorial Identity Proof

What is a combinatorial proof for this identity: $1 \times 1! + 2 \times 2! + ... + n \times n! = (n + 1)! - 1$ I am trying to figure out what are both sides trying to count.
2
votes
2answers
76 views

Using a combinatorial proof [duplicate]

How should I solve this problem? can anyone help? Thanks.
9
votes
1answer
198 views

A congruence in the number of certain ternary strings

Let $a_n$ be the number of ternary strings of length $n$ which do not contain three consecutive symbols that are all different. That is, $$a_n = \Bigl|\bigl\{\,(b_k)_{1\leq k\leq n}\in ...
1
vote
2answers
106 views

Combinatorial proof with binomial coefficients

I need to prove this with combinatorial arguments. I don't know how to start. $$ \sum_{j = r}^{n + r - k}{j - 1 \choose r - 1}{n - j \choose k - r} = {n \choose k}\,, \qquad\qquad 1\ \leq\ r\ \leq\ ...
3
votes
3answers
132 views

Proof of combinatorial identity

I need a edit:combinatorial proof of the following identity: $$1 = \sum_{k=0}^n \binom {n} {n-k}2^{n-k}(-1)^k$$ I know that I should use inclusion-exclusion, but I am getting stuck. Thanks!
1
vote
2answers
90 views

A (combinatorics?) problem about shoes

"30 shoes are arbitrary ordered in a row, 15 left and 15 right shoes. In this row there will always be 10 succeeding shoes such that 5 of theme are left shoes (and 5 of theme are right shoes. Prove ...
4
votes
3answers
995 views

Combinatorial Proof of Multinomial Theorem - Without Induction or Binomial Theorem

I've been trying to rout out an exclusively combinatorial proof of the Multinomial Theorem with bounteous details but only lighted upon this one - see P2. Any other helpful ones? ...
1
vote
4answers
268 views

For all positive integers n,m,k where $n\ge m\ge k$ , $\binom {n}{m}\binom {m}{k}=\binom {n}{k}\binom {n-k}{n-m}$ [duplicate]

For all positive integers n,m,k where $n\ge m\ge k$ , $\binom {n}{m}\binom {m}{k}=\binom {n}{k}\binom {n-k}{n-m}$ Prove the following statements using combinatorial proofs. I can't come up ...
8
votes
2answers
119 views

Seeking a combinatorial proof of the identity$1+3+\cdots+(2n-1)=n^2$

I would appreciate if somebody could help me with the following problem Q: Seeking a combinatorial proof $$1+3+\cdots+(2n-1)=n^2$$
5
votes
1answer
459 views

Combinatorial Proof for Series of Stirling Numbers & Binomial Coefficients

I am struggling with the following question from an assignment for an introductory course to combinatorics. Show, by means of a combinatorial argument, that the following holds: ...
3
votes
2answers
136 views

proofs for combinatorial identities?

by using the identity $(1-x^2)^n=(1+x)^n(1-x)^n$, show that for each $m \in \Bbb N$ with $m < n$, summation of $$\sum_{i=0}^n(-1)^i\binom{n}i^2=\begin{cases} 0,&\text{if }n\text{ is odd}\\ ...