Round 2 (2005-2006) Grades 6-9 SOLUTIONS

Maine Mathematics Science and Engineering Talent Search

1. Type in an adding machine the sum 1+2+3+..+ 100. As each number is added to the previous sum, the machine displays the new sum of the numbers that you have typed into the machine. How many times is the number 97 displayed? Solution 1+2+ + N = N(N+1)/2. There is no integer solutions for N(N+1)/2=100 1+2+3+ + 13 =(13)(14)/2 = 91 and 1+2+3+ .+13+14= (14)(15)/2=105 The number 97 will never be displayed.

2. (a) What is the sum of the first three odd numbers? (b) The sum of the first five odd numbers? (c) The sum of the first seven odd numbers? (d) The sum of the first twenty six odd numbers? (e) The sum of the first 2189 odd numbers? Solution Since the sum of the first N odd numbers is:

2 k 1 = 2 k 1 =
k =1 k =1 k =1

2 N ( N + 1) N = N2. 2

(a) N=3 N2 = 9 (b) N=5, N2 = 25 (c) N=2189. N2 = 4791721

1 th ? 3. What is the 87 digit in the decimal representation of the fraction 7

Solution. 1/7 = 0.142857142857 = 0.142857 In the answer the digits 142857 repeats itself. The 87th decimal representation is 2 because 87 = (6)(14) + 3. Therefore, the 87th number is the 3rd digit in the sequence that is 2

4. Before a basketball game, the five starting players on the team are weighed. After weighing each player we calculate the average of the weight of the players already weighed. How much heavier the heaviest player is than the lightest one, if after every weighing the average weight of the players increased by one pound? Solution. Suppose the average of 5 players is K. In order to increase the average weight by one, from 4 players to 5 players, the fifth player must have the weight K+4. On the other hand, the average of first 4 players is K-1, the average of the first 3 players is K-2, the average of the first 2 players is K-3, and the weight of the first player is K-4. The different between the fifth player and the first player is (K+4)-(K-4)=8 5. We have one empty Gatorade bottle, water and a marker. Wed like to mark half of the volume of the bottle without any measuring device. We could partially empty or fill the bottle to make this decision and use the marker but no other bottles or cups are available for the experiment. How should we do this? Solution. If the bottle is half way full and it is marked, then the bottle can be turned upside down and it would still be at the half-full mark. To do this, take a little bit of trial and error. We fill the bottle to an estimated half point and we mark it. If we turn the bottle upside down and the water is below the mark, then we know that we have to put more water in. If it is above the mark, then we know we have to pour some water out. Each time we pour water in or out, we have to create a new mark. We keep doing this until at the two positions the water is at the mark.

6. Find two six-digit numbers such that the number obtained by writing them one after another is divisible by their product. Solution. lets call these numbers a and b. The number will be 1000000a+b. Since this number is divisible by a, so, b is divisible by a. Assume b=ka, where k is an integer. Since this number is divisible by b=ka. That is

ka|1000000a+b=1000000a+ka. This implies: k|1000000+k. Therefore, k must be a factor of 1000000. Since b=ka, and both a and b are 6-digit numbers, only possible values of k are 1, 2, and 5. If k=1, This number will be 1000000a+a=1000001a. Since This number is divisible by ab=a2, 1000001 is divisible by a. But 1000001 does not have any 6-digit factor. So, k1. If k=5, This number will be 1000000a +5a=1000005a. Since This number is divisible by ab=5a2, 1000005 is divisible by 5a. 200001 is divisible by a. 200001 does not have any 6-digit factor. So, k5. If k=2, This number will be 1000000a +2a=1000002a. This number is divisible by ab=2a2. 1000002 is divisible by 2a, and 500001 is divisible by a. a=166667 is the only 6digit factor of 500001. b=2a=333334. After checking, the pair (166667,333334) is the only solution.

7. There are 16 participants in a boxing tournament. Suppose that always the better competitor wins and there is a winner in each fight. What is the lowest number of matches to find the best, the second best and the third best boxer? Design a system of matches and describe how to decide who is the best, the second best and the third best boxer. Solution: We need 4 round of matches to find the best boxer: Round A1: Pair all 16 boxers. There are 8 games. Round A2: Pair 8 winners from Round A1. There are 4 games. Round A3: Pair 4 winners from Round A2. There are 2 games. Round A4: There is one game between two winners from Round A3. The winner is the best boxer. There are 15 matches to find the best player. Lets consider the second best boxer. This is the play better than everyone else except the best boxer. He never lost any games to anyone else except the best player. He is not the best boxer, because he lost a game to the best boxer. To find him, we just need to check all boxers in the above 4 round who lost game to the best boxer. There are 4 losers to the best boxer in all 4 rounds. We will have anther 2 rounds of matches: Round B1: Pair these 4 losers. There are 2 games. Round B2: There is one game between two winners from Round B1. The winner is the second best boxer. We need 3 more matches to find the second best player. Now, lets find the third best player: Since the third best player must loss a game to the second best player. The second best player won the game at most 5 times. (Round A1, A2, A3, B1, and B2) There are at most 5 losers to the second best boxer. The third best boxer is among them. To find him, we need the following matches: Round C1: Pair the first 4 of all 5 losers. There are 2 games.

Round C2: There is one game between two winners from Round C1. Round C3: There is one game between the winner and the fifth loser. The winner is the third best player. The total number of matches is at most 22.

9. We have 100 pieces of wooden cubes, each is one cubic inch. Build different square based columns from these cubes. How many different columns could you design? Give the surface area of each column. Solution. The 100 cubes can be placed in the following forms to make different columns: Columns A column of 100 1x1 cubes A column of 25 2x2 small cubes A column of 4 5x5 small cubes A column of 1 10x10 small cubes Surface area 402 sq in 208 sq in 130 sq in 240 sq in

10. We have a five digit number. The sum of the digits is A. The sum of the digits of the number A is B. What is the largest possible value for B? Solution. The largest possible sum of the digits of B is 12. The largest possible value of A is 45, if the five- digit number is 99999. In order to get the largest B, we need to get the largest sum of the 10th digit and single digit of A. If the single digit is 9, the largest possible 10th digit can be 3 only, because the largest value of A is no more than 45. If A is 39, then B is 12. There are many numbers, for example: 99993, 39999, 66999