A number is called proper if each successive digit in the number is either monotonically increasing, or equal to the preceding digit. If 0 is not allowed in any place value, how many 6 digit numbers are proper ?
2-Digit Example:
11, 12, 13, 14, 15, 16, 17, 18, 19, 22, 23, 24, 25, 26, 27, 28, 29, 33, 34, 35, 36, 37, 38, 39, 44, 45, 46, 47, 48, 49, 55, 56, 57, 58, 59, 66, 67, 68, 69, 77, 78, 79, 88, 89, 99
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Since we are looking for 6 digit numbers monotonically increasing, once we choose 6 digits out of 9 ( 1 to 9 ) , there's just one way of arranging them. Let's say we choose the digits: 7 , 1 , 1 , 3 , 4 , 4 . Once we order them, there's just ONE possible increasing order: 1 1 3 4 4 7 So our problem is finding the number of combinations we can make by choosing 6 digits (with repetition) out of 9 . The best way of doing this is imagining the amount of digits ( 6 ) as dots and separate them into 9 little homes (which correspond to the digits we are choosing out of 9 ( 1 to 9 ) ). For example, the combination 1 , 3 , 3 , 5 , 7 , 9 corresponds to: 1 ∗ 2 ∣ ∣ 3 ∗ ∗ 4 ∣ ∣ 5 ∗ 6 ∣ ∣ 7 ∗ 8 ∣ ∣ 9 ∗ It means we got: 1 digit 1 ; 0 digit 2 ; 2 digits 3 ; 0 digit 4 ; 1 digit 5 ; 0 digit 6 ; 1 digit 7 ; 0 digit 8 and 1 digit 9 . So in order to we calculate the total of proper numbers, we have to calculate the amount of permutations of: ∗ ∗ ∗ ∗ ∗ ∗ ∣ ∣ ∣ ∣ ∣ ∣ ∣ ∣ which is: ( 6 1 4 ) = 3 0 0 3 .
(from the 14 places available, we choose 6 to put the dots ∗ )