RMO Combinatorics DPP 1
First of all, let's figure out whether we want ordered triplets or unordered ones. In combinatorics, if the question says "number of ways" it usually means ordered. If they wanted unordered triplets, they would have said: "Find the number of sets of 3 integers..." "Find the number of unordered combinations of 3 factors..." “in non-decreasing order”, “up to permutation”, “as an unordered product”. etc. Once it has been established that we want ordered triplets, it calls for stars and bars . 10^6 = 2^6 * 5^6 Let 10^6 = N then: N = a * b * c Here a,b,c are 3 distinct buckets in which 6 identical objects have to be distributed(for powers of 2), and similarly for powers of 5. So number of ways to distribute powers of 2 = (6 + 3 - 1)C(3-1) = 8C2 = 28 Similarly for powers of 5 = 8C2 = 28 Total: 28*28 = 784 But this number includes the cases where 1 or more factors could be 1. Let's count them: Cases where at least one factor is 1: A = set of triplets a,...