2012AIMEI试题.docVIP

Problem 1 Find the number of positive integers with three not necessarily distinct digits, , with a≠0 and such that both and are multiples of . Solution Problem 2 The terms of an arithmetic sequence add to . The first term of the sequence is increased by , the second term is increased by , the third term is increased by , and in general, the th term is increased by the th odd positive integer. The terms of the new sequence add to . Find the sum of the first, last, and middle terms of the original sequence. Solution Problem 3 Nine people sit down for dinner where there are three choices of meals. Three people order the beef meal, three order the chicken meal, and three order the fish meal. The waiter serves the nine meals in random order. Find the number of ways in which the waiter could serve the meal types to the nine people so that exactly one person receives the type of meal ordered by that person. Solution Problem 4 Butch and Sundance need to get out of Dodge. To travel as quickly as possible, each alternates walking and riding their only horse, Sparky, as follows. Butch begins by walking while Sundance rides. When Sundance reaches the first of the hitching posts that are conveniently located at one-mile intervals along their route, he ties Sparky to the post and begins walking. When Butch reaches Sparky, he rides until he passes Sundance, then leaves Sparky at the next hitching post and resumes walking, and they continue in this manner. Sparky, Butch, and Sundance walk at and miles per hour, respectively. The first time Butch and Sundance meet at a milepost, they are miles from Dodge, and they have been traveling for minutes. Find . Solution Problem 5 Let be the set of all binary integers that can be written using exactly zeros and ones where leading zeros are allowed. If all possible subtractions are performed in which one element of is subtracted from another, find the number of times the answer is obtained. Solution Problem 6 The complex numbers