4 answers
1
In how many ways can 3 non-negative integers be chosen such that a + b + c = 10 where a >= -1 , b >= -5 and c >= 3 ? 3666105None
2 answers
2
If G is a complete bipartite graph with n vertices (n >= 2) and minimum number of edges, then matching number of G is ____1n-1⌊n/2⌋⌈n/2⌉