2013COMC加拿大數(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)遍

2013 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:

Question A3)In the figure below, the circles have radii 1, 2, 3, 4, and 5. The total area that is contained inside an odd number of these circles is m for a positive number m. What is the value of m?

Question A4)A positive integer is said to be bi-digital if it uses two different digits, with each digit used exactly twice. For example, 1331 is bi-digital, whereas 1113, 1111, 1333, and 303 are not. Determine the exact value of the integer b, the number of bi-digital positive integers.

Part B Challenging Questions:

Question B3)Teams A and B are playing soccer until someone scores 29 goals. Throughout the game the score is shown on a board displaying two numbers – the number of goals scored by A and the number of goals scored by B. A mathematical soccer fan noticed that several times throughout the game, the sum of all the digits displayed on the board was 10. (For example, a score of 12 : 7 is one such possible occasion). What is the maximum number of times throughout the game that this could happen?

Part C Long-form Proof Problems:

Question C3)Alphonse and Beryl play the following game. Two positive integers m and n are written on the board. On each turn, a player selects one of the numbers on the board, erases it, and writes in its place any positive divisor of this number as long as it is different from any of the numbers previously written on the board. For example, if 10 and 17 are written on the board, a player can erase 10 and write 2 in its place. The player who cannot make a move loses. Alphonse goes first.

1. Suppose m = 2⁴⁰ and n = 3⁵¹. Determine which player is always able to win the game and explain the winning strategy.
2. Suppose m = 2⁴⁰ and n = 2⁵¹. Determine which player is always able to win the game and explain the winning strategy.

完整版真題資料可以底部二維碼免費(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|"]

以上就是關(guān)于【2013COMC加拿大數(shù)學(xué)公開(kāi)賽真題免費(fèi)下載】的解答，如需了解學(xué)校/賽事/課程動(dòng)態(tài)，可至翰林教育官網(wǎng)獲取更多信息。

往期文章閱讀推薦：

競(jìng)賽獲獎(jiǎng)≠名校offer，但拿下哈佛、MIT、牛劍Offer的學(xué)霸履歷里，都有一個(gè)共同點(diǎn)……

【十問(wèn)十答】別盲目刷競(jìng)賽！10 個(gè)核心問(wèn)答，理清國(guó)際賽事規(guī)劃底層邏輯！