- #1
e(ho0n3
- 1,357
- 0
I've been unable to solve the following problem for a while know: How many n-digit numbers a[1]a[2]...a[n] exits where 1 ≤ a ≤ i for i = 1, 2, ..., n? For example, with n = 3 there are five numbers:
111
112
122
113
123
I was trying to look at the pattern of 1's being generated but to not avail. Is there a simpler way of looking at this problem?
111
112
122
113
123
I was trying to look at the pattern of 1's being generated but to not avail. Is there a simpler way of looking at this problem?