• retagged by
580 views

Please log in or register to answer this question.

Position:
Show:

Related questions

51 51 votes
6 answers 6 answers
13.7k
13.7k views
Misbah Ghaya asked Nov 29, 2016
13,719 views
How many substrings (of all lengths inclusive) can be formed from a character string of length $n$? Assume all characters to be distinct, prove your answer.
43 43 votes
6 answers 6 answers
17.2k
17.2k views
Kathleen asked Sep 23, 2014
17,201 views
The number of binary strings of $n$ zeros and $k$ ones in which no two ones are adjacent is$^{n-1}C_k$$^nC_k$$^nC_{k+1}$None of the above
51 51 votes
8 answers 8 answers
17.6k
17.6k views
Kathleen asked Sep 14, 2014
17,641 views
A multiset is an unordered collection of elements where elements may repeat any number of times. The size of a multiset is the number of elements in it, counting repetiti...
0 0 votes
1 1 answer
2.3k
2.3k views
Sandy Sharma asked Mar 14, 2019
2,307 views
i am not able to understand the proof.How we reached statement 2 from statement 1 as I have marked in the picture (right side)Can some one elaborate?