1999 Mathcounts National Sprint Round Solutions（1999年Mathcounts国家Sprint圆的解决方案）.pdf

1999 Mathcounts National Sprint Round Solutions 5 1. Solution: . 12 A 3-digit number is divisible by 3 if the sum of its digits is divisible by 3. The first digit cannot be 0, so we have the following four groups of 3 such that the three different numbers sum to a multiple of 3: 2, 4, 0; 8, 4, 0; 6, 4, 2; 8, 6, 4. These four cases produce 4, 4, 6, and 6 numbers respectively. There are 4 + 4 + 6 + 6 = 20 such numbers. There are a total of 443 = 48 three-digit numbers using the digits 0, 2, 4, 6, and 8. 20 5 The probability is P .   12 4 4 3 2. Solution: 9. A network of the cube is shown below. A network can be traversed without retracing any edge if it has two odd nodes. A node is one of the 8 vertices. An odd node is a vertex that has an odd number of edges coming out of it. This network has 8 odd nodes, so six such nodes need to be removed. One example is shown. The two odd nodes left with one being the starting point and the other one being the ending point. The longest distance is then 9. 11 3. Solution: . 18 Let the event of removing a red ball be A , the event of removing a white ball be A , and 1 2 the event of selecting a red ball be B . We have 4 2 3 1 P(A ) P(B A ) (The