学霸学习网 这下你爽了
当前位置:首页 >> 学科竞赛 >>


This test consists of 10 short-answer problems to be solved individually in 50 minutes. Problems will be weighted with point values after the contest based on how many competitors solve each problem. There is no penalty for guessing. No translators, books, notes, slide rules, calculators, abaci, or other computational aids are permitted other than the of?cial translation sheets. Similarly, graph paper, rulers, protractors, compasses, and other drawing aids are not permitted. Our goal is that a closed form answer equivalent to the correct answer will be accepted. However, we do not always have the resourses to determine whether a complicated or strange answer is equivalent to ours. To assist us in awarding you all the points that you deserve, you answers should be simpli?ed as much as possible. Answers must be exact unless otherwise speci?ed. Correct mathematical notation must be used. No partial credit will be given unless otherwise speci?ed. If you believe the test contains an error, please submit your protest in writing to Science Center 109 during lunchtime. Enjoy!

15th Annual Harvard-MIT Mathematics Tournament
Saturday 11 February 2012

Algebra Test
1. Let f be the function such that f (x) = 2x 2 ? 2x if x ≤ if x >
1 2 1 2

What is the total length of the graph of f (f (...f (x)...)) from x = 0 to x = 1?
2012f ′ s

2. You are given an unlimited supply of red, blue, and yellow cards to form a hand. Each card has a point value and your score is the sum of the point values of those cards. The point values are as follows: the value of each red card is 1, the value of each blue card is equal to twice the number of red cards, and the value of each yellow card is equal to three times the number of blue cards. What is the maximum score you can get with ?fteen cards? 3. Given points a and b in the plane, let a ⊕ b be the unique point c such that abc is an equilateral triangle with a, b, c in the clockwise orientation. Solve (x ⊕ (0, 0)) ⊕ (1, 1) = (1, ?1) for x. 4. During the weekends, Eli delivers milk in the complex plane. On Saturday, he begins at z and delivers milk to houses located at z 3 , z 5 , z 7 , . . . , z 2013 , in that order; on Sunday, he begins at 1 and delivers milk to houses located at z 2 , z 4 , z 6 , . . . , z 2012 , in that order. Eli always walks directly (in a straight line) between two houses. If the distance he must travel from his starting point to the last house is √ 2012 on both days, ?nd the real part of z 2 . 5. Find all ordered triples (a, b, c) of positive reals that satisfy: ?a?bc = 3, a?b?c = 4, and ab?c? = 5, where ?x? denotes the greatest integer less than or equal to x. 6. Let a0 = ?2, b0 = 1, and for n ≥ 0, let an+1 = an + bn + bn+1 = an + bn ? Find a2012 . 7. Let ? be a binary operation that takes two positive real numbers and returns a positive real number. Suppose further that ? is continuous, commutative (a ? b = b ? a), distributive across multiplication (a ? (bc) = (a ? b)(a ? c)), and that 2 ? 2 = 4. Solve the equation x ? y = x for y in terms of x for x > 1. 8. Let x1 = y1 = x2 = y2 = 1, then for n ≥ 3 let xn = xn?1 yn?2 + xn?2 yn?1 and yn = yn?1 yn?2 ? xn?1 xn?2 . What are the last two digits of |x2012 |? 9. How many real triples (a, b, c) are there such that the polynomial p(x) = x4 + ax3 + bx2 + ax + c has exactly three distinct roots, which are equal to tan y, tan 2y, and tan 3y for some real y? 10. Suppose that there are 16 variables {ai,j }0≤i,j≤3 , each of which may be 0 or 1. For how many settings of the variables ai,j do there exist positive reals ci,j such that the polynomial f (x, y) =

a2 + b2 , n n a2 + b2 . n n

ai,j ci,j xi y j

(x, y ∈ R) is bounded below?

15th Annual Harvard-MIT Mathematics Tournament
Saturday 11 February 2012

Algebra Test

Name School Team

Team ID#

1. 2. 3. 4. 5. 6. 7. 8. 9. 10.


网站首页 | 网站地图
All rights reserved Powered by 学霸学习网
copyright ©right 2010-2021。