Top PDF 2014IMAS First Round Middle Primary Division Full Solutions

Notice: Individual students, nonprofit libraries, or schools are permitted to make fair use of the papers and its solutions. Republication, systematic copying, or multiple reproduction of any part of this material is permitted only under license from the Chiuchang Mathematics Foundation.

Notice: Individual students, nonprofit libraries, or schools are permitted to make fair use of the papers and its solutions. Republication, systematic copying, or multiple reproduction of any part of this material is permitted only under license from the Chiuchang Mathematics Foundation.

【Solution】 It is obvious the model is contained in a cube of edge length 3 and contains some of the 27 unit cubes of the large cube. The unit cube in the center has to appear in the model. The cubes at the center of faces of the large cube must not appear. The cubes at the middle of edges of the large cube must not appear. Moreover, one of the two unit cubes at any adjacent corners of the large cube must appear. It is then obvious by pigeonhole principle, one needs at least 5 unit cubes. One such construction is in the figure below.

Notice: Individual students, nonprofit libraries, or schools are permitted to make fair use of the papers and its solutions. Republication, systematic copying, or multiple reproduction of any part of this material is permitted only under license from the Chiuchang Mathematics Foundation.

Notice: Individual students, nonprofit libraries, or schools are permitted to make fair use of the papers and its solutions. Republication, systematic copying, or multiple reproduction of any part of this material is permitted only under license from the Chiuchang Mathematics Foundation.

Notice: Individual students, nonprofit libraries, or schools are permitted to make fair use of the papers and its solutions. Republication, systematic copying, or multiple reproduction of any part of this material is permitted only under license from the Chiuchang Mathematics Foundation.

By observation, we discover that each of the number in the first set when divided by 3 will give a remainder of 1, each number in the second set when divided by 3 will give a remainder of 2 and each number in the third set when divided by 3 or when each of them is divided by 3 will give a remainder of 0. Hence, according to the meaning of the problem, we must form a three-digit number where the digit in each place is selected from each set and the sum of all the digits formed when divided by 3 will give a remainder of 0, that is; the arrangement of all the three-digit numbers that formulate is always divisible by 3. Hence, we just need to find all those three-digit numbers from the above that are divisible by 2; or the digit in the units place is an even number.

Since 2014 = 335 × 6 + 4, it means that in the first 2014 terms in the sequence, there are 335 complete periods with an incomplete period of four remaining terms. Therefore, there are 335 terms in the sequence that are divisible by 4. Answer: 335 22. The inside lane of a track has length 400 m and the outside lane has length less than 500 m. From the marked line, as shown in the diagram, Max and Lynn start running counterclockwise along the track at the same time. Max runs at constant speed on the inside lane. Lynn, whose constant speed is 3 times that of Max, runs on the outside lane. The first time both are back together at the marked line, Max has completed 3 laps. What is the length, to the nearest m, of the outside lane?

Notice: Individual students, nonprofit libraries, or schools are permitted to make fair use of the papers and its solutions. Republication, systematic copying, or multiple reproduction of any part of this material is permitted only under license from the Chiuchang Mathematics Foundation.

Notice: Individual students, nonprofit libraries, or schools are permitted to make fair use of the papers and its solutions. Republication, systematic copying, or multiple reproduction of any part of this material is permitted only under license from the Chiuchang Mathematics Foundation.

Notice: Individual students, nonprofit libraries, or schools are permitted to make fair use of the papers and its solutions. Republication, systematic copying, or multiple reproduction of any part of this material is permitted only under license from the Chiuchang Mathematics Foundation.

Notice: Individual students, nonprofit libraries, or schools are permitted to make fair use of the papers and its solutions. Republication, systematic copying, or multiple reproduction of any part of this material is permitted only under license from the Chiuchang Mathematics Foundation.

【Solution】 If there is no carry when the number is added by 1, sum of digits increases by 1, contradiction to that both sum of digits are divided by 4. If there is a carry, the last digit is 9. Since the sum of all digits changes by 8 when one carry happens and by 17 when two carries happens. It follows that only one carry should happen and the original number has the sum of all digits divided by 4. In order to take the number to be maximal, the first digit should also be 9. The second digit can be either 2 or 6. The largest one is 969.

Notice: Individual students, nonprofit libraries, or schools are permitted to make fair use of the papers and its solutions. Republication, systematic copying, or multiple reproduction of any part of this material is permitted only under license from the Chiuchang Mathematics Foundation.

Totally there are 20  20 8 4 1 53     isosceles right triangles. Hence (E). Answer： （E） 21. Mike constructs a sequence in the following way: the first two terms are 1 and 2. Starting from the third term, each term is the smallest possible integer that is not relatively prime to the previous term and has not yet appeared in any of the previous terms. Find the 20 th term of this sequence.

Notice: Individual students, nonprofit libraries, or schools are permitted to make fair use of the papers and its solutions. Republication, systematic copying, or multiple reproduction of any part of this material is permitted only under license from the Chiuchang Mathematics Foundation.

Answer: 45 number sentences 10. An ant starts from the top left corner square of a 3 5  chessboard. It moves from a square to the adjacent square in the same row or column. After visiting every square exactly once, it ends up at the square in the middle row second column from the right. How many different paths can the ant follow?

Notice: Individual students, nonprofit libraries, or schools are permitted to make fair use of the papers and its solutions. Republication, systematic copying, or multiple reproduction of any part of this material is permitted only under license from the Chiuchang Mathematics Foundation.

Notice: Individual students, nonprofit libraries, or schools are permitted to make fair use of the papers and its solutions. Republication, systematic copying, or multiple reproduction of any part of this material is permitted only under license from the Chiuchang Mathematics Foundation.

Notice: Individual students, nonprofit libraries, or schools are permitted to make fair use of the papers and its solutions. Republication, systematic copying, or multiple reproduction of any part of this material is permitted only under license from the Chiuchang Mathematics Foundation.