2014COMC加拿大數(shù)學(xué)公開(kāi)賽真題答案免費(fèi)下載

歷年 Canadian Open Mathematics Challenge加拿大數(shù)學(xué)公開(kāi)賽

真題與答案下載

翰林國(guó)際教育全網(wǎng)首發(fā)

力爭(zhēng)超快速發(fā)布最全資料

助你在升學(xué)路上一帆風(fēng)順

為你

千千萬(wàn)萬(wàn)遍

2014 COMC真題答案免費(fèi)下載

共計(jì)2.5小時(shí)考試時(shí)間

此套試卷由三部分題目組成

4題簡(jiǎn)答題，每題4分

4題挑戰(zhàn)題，每題6分

4題解答題，每題10分

共計(jì)12題，滿分80分

不可使用任何計(jì)算器

完整版下載鏈接見(jiàn)文末

部分真題預(yù)覽：

Part A Introductory Questions' Solutions:

A3)Two solutions:

1. Solution 1: For a number to be divisible by 3, the sum of the digits must be a multiple of 3, so 3|(A + 4), which means A ∈{2, 5, 8}.
   For a number to be divisible by 4, the number formed by the last two digits must be divisible by 4, so 4|(10A + 2): This gives A∈ {1, 3, 5, 7, 9}.
   The only number in common is A = 5; so n = 2052.
2. Solution 2: The number n - 12 is divisible by 5, so n is of the form 60k + 12 for some k.60 × 34 + 12 = 2052; so n = 2052. It is easy to verify that no other value of k works.

Part B Challenging Questions' Solutions:

B3) If we have a horizontal (or vertical) line of all Os, then since there are 5Xs for the other two lines, there must be a horizontal (or vertical) line of all Xs. Thus, our line of 3 Os must be a diagonal.
When one of the diagonal lines is all Os, then no other line can be all Xs, since each diagonal line intersects all other lines. Thus, each configuration with one diagonal line of Os is a
desired solution.
When we have the diagonal line 1 5 9; there are 6 places that the last O could be: 2, 3, 4, 6, 7, 8. Each of these will give a valid solution. Similarly, we have 6 solutions when we have the diagonal line 7 - 5 - 3:
It is not possible for both diagonal lines to have only Os, since there are only 4 Os, thus we have not counted the same configuration twice. Thus 12 of the 126 ways contain a line of 3 Os and no line of 3 Xs.

Part C Long-form Proof Problems' Solutions:

C3)

1. There are 11 students in the club other than Jeffrey and each field trip that Jeffrey is on has 5 other students. In order for Jeffrey to go on a field trip with each other student, he must go on at least 11/5=2.2 = 3 field trips .
   To see that 3 trips is sufficient, we let the other students be {s₁, s₂, ..., s₁₁}.On the first trip, Jeffrey can go with {s_1,... _; s₅}, on the second trip with{s₆, ... , s₁₀} and on the third trip with s₁₁ and any other 4 students. .
2. From part (a), we know that each student must go on at least 3 trips. Since there are 12 students in total, if we count the number of trips that each student went on, we would get a minimum of 12×3 = 36: Since 6 students attend each field trip, that means there must be at least 36/6 = 6 trips.
   We now show that it is possible to do this with exactly 6 trips. Divide the students into 4 groups of 3 students each (groups A, B, C, D). There are 6 different pairs of groups (AB, AC, AD, BC, BD, CD). Let these pairs of groups be our 6 field trips. We see that since each group goes on a trip with each other group, that each pair of students goes on a trip together. Hence, this can be done with 6 trips.

完整版真題資料可以底部二維碼免費(fèi)領(lǐng)取↓↓↓

[vc_btn title="查看更多COMC加拿大數(shù)學(xué)奧賽相關(guān)詳情" color="primary" align="center" i_icon_fontawesome="fa fa-globe" css_animation="zoomIn" button_block="true" add_icon="true" link="url:http%3A%2F%2Fwww.linstitute.net%2Farchives%2F99767||target:%20_blank|"]
[products columns="2" orderby="title" order="ASC" ids="310579,310582 "]