Arrangements

yellowho wrote:How many integers from 100,000 to 1,000,000 are such that each integer contains no repeated
digits, and the integer’s digits are arranged in ascending order from least to greatest?

In other words, the question is asking how many 6 digit integers in which all the integers are different and they are arranged in ascending order from least to greatest.

Now note that only one arrangement is possible for any combination of 6 different integers such that they are arranged in ascending order from least to greatest. Thus the problem boils down to selection of 6 different integers out of 9 integers. We are not taking 10 integers as zero cannot be considered as a digit because if we consider zero as a digit, it must be placed in the beginning which will result a 5 digit number.

Hence, number of such integers = Number of possible selections of 6 different digits out of 9 = 9C6 = 84