263 views
0 votes
0 votes
How   this is true ?

$_{r}^{\frac{n(n-1)}{2}}\textrm{C} = 2^{\frac{n(n-1))}{2}}$

Please log in or register to answer this question.

Related questions

0 votes
0 votes
2 answers
2
gshivam63 asked May 31, 2016
1,069 views
If average weight of a minimum spanning tree is Aavg.Then minimum spanning tree will have weight almost (n-1)Aavg, where n is no of vertices in the graph. It is true or f...
0 votes
0 votes
0 answers
3
Malusi asked Jan 12
88 views
Consider a weighted undirected graph with positive edge weights and let (u, v) be an edge in the graph. It is known that the shortest path from source vertex r to u hasw...
0 votes
0 votes
2 answers
4
iarnav asked Sep 11, 2017
453 views
How come L1∩ L2 = (L1' U L2')'