• edited by
30,043 views
93 93 votes
The number of $4$ digit numbers having their digits in non-decreasing order (from left to right) constructed by using the digits belonging to the set $\{1, 2, 3\}$ is ________.

19 Answers

Answer:
Position:
Show:

Related questions

51 51 votes
8 answers 8 answers
17.4k
17.4k views
Kathleen asked Sep 14, 2014
17,366 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...
43 43 votes
6 answers 6 answers
16.9k
16.9k views
Kathleen asked Sep 23, 2014
16,932 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
6 answers 6 answers
13.5k
13.5k views
Misbah Ghaya asked Nov 29, 2016
13,523 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.
68 68 votes
5 answers 5 answers
20.6k
20.6k views
go_editor asked Feb 16, 2015
20,632 views
Consider the following C program:#include<stdio.h int f1(void); int f2(void); int f3(void); int x=10; int main() { int x=1; x += f1() + f2 () + f3() + f2(); printf("%d", ...