This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: L = d  1 , there is one digit larger than L and it can appear in any of d  1 places; if L = d  2 , there are two digits larger than L and they take up two of the following d  1 places; and so on. This gives the total number to be C(d  1,0) + C(d  1,1) + C(d  1,2) + . .. + C(d  1,d  2) + C(d  1,d  1), where C(d1,k) is the number of ways to select a subset of size k from a set of size d  1 . The above sum is the desired number given above. this page....
View
Full
Document
This note was uploaded on 03/01/2010 for the course MATH 301 taught by Professor Albertodelgado during the Spring '10 term at Bradley.
 Spring '10
 AlbertoDelgado
 Combinatorics, Integers

Click to edit the document details