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

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

真題與答案下載

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

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

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

為你

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

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

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

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

Part A共8題，每題5分

Part B共4題，每題10分

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

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

完整版下載鏈接見文末

部分真題預(yù)覽：

Part A Solutions:

A2)We write 5073 in place value notation as 5 × 1000 + 7 × 10 + 3 or 5 × 10³ + 7 × 10¹ + 3 × 10⁰.
Thus, if a = 0, b = 3 and c = 1, then the left side (3 × 10^a + 5 × 10^b + 7 × 10^c) equals 5073.
Any other combination of values for a, b and c will not give 5073.
Therefore, a + b + c = 0 + 3 + 1 = 4.
(We can show that the only possibility is a = 0, b = 3 and c = 1. We start by noting that the remainder when the right side is divided by 10 is 3, so the remainder when the left side is divided by 10 must also be 3. If a = 0 and each of b and c is larger than 0, then the remainder on the left side will be 3. If more than one of a, b and c equals 0, then we can see by trying the possibilities that the remainder on the left side cannot be 3.
Therefore, a = 0 and b and c are positive.
We can then subtract 3 from both sides and divide by 10 to obtain the new equation 5 × 10^b-1 + 7 × 10^c-1 = 507 and repeat the argument to show that c = 1 and then b = 3.)
Answer: 4

Part B Solutions:

B1)

1. We want to find all positive integers a for which the smallest positive s with the property that a divides into 1 + 2 + 3 + ... + s is s = 8.
   Note that 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 = 36. (We use the term triangular number to mean a positive integer of the form 1 + 2 + 3 + ... + s.) The previous triangular numbers are 1, 3, 6, 10, 15, 21, 28. Therefore, we want to nd all positive integers a that are divisors of 36 but not of any of 1, 3, 6, 10, 15; 21; 28.
   The divisors of 36 are 1, 2, 3, 4, 6, 9, 12, 18, 36.
   The divisors 1, 2, 3, 4, 6 each divide into at least one of 6 and 28, so f(1) ≠ 8, f(2) ≠ 8,f(3) ≠ 8, f(4) ≠ 8, and f(6) ≠ 8.
   The divisors 9, 12, 18, 36 do not divide into any triangular number smaller than 36.
   Therefore, the complete solution to f(a) = 8 is a = 9,12, 18, 36.
2. For m a positive integer, we define T(m) = 1 + 2 + ... + m = 1/2m(m + 1). (T(m) is the mth triangular number.)
   First, we show that if T(z) is a multiple of w, then f(w)  z:
   We know that f(w) is the smallest integer m for which 1+2+3+...+m = T(m) is a multiple of w.
   Suppose that T(z) is a multiple of w.
   If z is the smallest positive integer with this property, then f(w) = z; otherwise, z is not the smallest such positive integer, so f(w) < z.
   In either case, f(w) < z.
   Next, we show that if y is an odd positive integer with y > 1, then f(y) ≤y - 1:
   Suppose that y = 2Y + 1 for some positive integer Y .
   Then T(y - 1) = 1/2 (y - 1)y = 1/2(2Y )(2Y + 1) = Y (2Y + 1) = Y y.
   Thus, T(y - 1) is a multiple of y, and so by the first fact above, f(y) ≤y - 1.
   Next, we show that f(2^a) = 2^a+1 - 1 for every positive integer a:
   Suppose that f(2^a) = m.
   Then 1/2m(m+1) is a multiple of 2^a, so 1/2m(m+1) = q2^a for some positive integer q or 2^a+1q = m(m + 1).
   Since one of m and m+1 is even and the other is odd, then the even one of these must contain at least a + 1 factors of 2 and so must be at least 2a+1.
   The smallest m for which this is possible is m = 2^a+1-1 which makes m+1 = 2^a+1.
   This tells us that f(2^a) ≥2^a+1 - 1.
   But T(2^a+1 - 1) = 1/2(2^a+1 - 1)2^a+1 = 2^a(2^a+1 - 1), which is divisible by 2^a, so f(2^a) ≤ 2^a+1 - 1.
   Therefore, f(2^a) = 2^a+1 - 1.
   We can now look at f(b + 1) - f(b) when b = 2^a - 1 for some positive integer a.
   Note that b is odd.
   In this case,
   f(b + 1) - f(b) = f(2^a) - f(2^a - 1) = 2^a+1 - 1 - f(2^a - 1) ≥ 2^a+1 - 1 - (2^a - 2) = 2^a + 1
   If a ≥ 11, then 2^a + 1 ≥ 2049 > 2009.
   Therefore, if b = 2^a-1 and a is a positive integer with a ≥ 11, then f(b+1)-f(b) > 2009, so there are infinitely many odd positive integers b for which f(b + 1) - f(b) > 2009.

 

完整版真題下載鏈接請(qǐng)注冊(cè)或登錄后查看

文件為PDF格式

推薦使用電腦下載

 

2009 COMC加拿大數(shù)學(xué)奧賽完整版真題免費(fèi)下載

請(qǐng)點(diǎn)擊下方鏈接訪問

2009 COMC真題題目

 

如需打包下載，請(qǐng)聯(lián)系小助手了解更多

翰林學(xué)員全站資料免費(fèi)打包下載，專享高速下載通道。

[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|"]