1. The problem statement, all variables and given/known data 1. In the manufacture of commercial license plates, a valid identifier consists of four digits followed by two eltters. Among all possible plate identifiers how many contain only the letters W, X, Y, or Z with a four digit number divisible by 5? 2. All the vertices of a decagon are to be connected by straight lines called the diagonals. a. If a side of a decagon does not count as a diagonal, then how many diagonals can be drawn? b. If the decagon is drawn so that no more than two diagonals intersect at any one point, then into how many line segments will the diagonals be divided by the intersecting diagonals? 3. Consider the set of 6-digit itnergers, where leading 0's are permitted. Two integers are considered to be "equivalent" if one can be obtained from the other by a permutation of the digits. Thus 129450 and 051294 are "equivalent". Among all the 10^6 six digit integers" a. How many are non-equivalent integers are there? b. If digits 0 and 9 can appear at most once, how many non-equivalent integers are there? 2. Relevant equations 3. The attempt at a solution 1. 10 * 10 * 10 * 10 = 10000 possibly number combinations 4 * 4 = 16 possible letter combinations 10000/5 = 2000 divisible by 5 16 * 2000 = 32000 combos <-- Is this correct? 2a. Each vertice can make 7 diagonals not including the sides. There are 10 sides so there are 70 diagonals. Since some vertices share the same diagonals, there are 70/2 = 35 diagonals. 2b. Is there a formula for this? 3a. Is it 10^6 - P(10, 6) = 848800? 3b. ... Thanks.