计时
1:15:00
1.
Helena 收藏的黑胶唱片中有 张 LP 唱片和 张 EP 唱片。一张 LP 唱片的播放时长是一张 EP 唱片的三倍。Helena 还需要再买多少张 EP 唱片,才能使她所有 EP 唱片的总播放时长等于她所有 LP 唱片的总播放时长?
Helena’s vinyl record collection contains LP records and EP records. An LP record plays for three times as long as an EP record. How many more EP records must Helena buy so that the total playing time of her EP records equals the total playing time of her LP records?
小提示:
张 LP 唱片的播放时长等于 张 EP 唱片
LP records play as long as EP records
大提示:
减去 Helena 已有的 张 EP 唱片
Subtract the EP records Helena already has
解答:
每张 LP 唱片的播放时长相当于三张 EP 唱片,所以这 张 LP 唱片合起来相当于 张 EP 唱片。Helena 已经有 张 EP 唱片,所以她还需要再买 张。
因此,正确答案是 B。
Each LP record plays as long as three EP records, so the LP records together play as long as EP records. Helena already has EP records, so she needs more.
Thus, the correct answer is B.
2.
停车场的一块告示牌上写着:总价中包含 的税。精确到整数,这笔税占顾客所付金额的百分之多少?
A sign in a parking lot states that the total price includes a tax. To the nearest whole number, what percentage of the amount a customer pays is this tax?
小提示:
价格为 时,税为 ,共付
A price means tax and paid
大提示:
接近
is close to
解答:
设税前价格为 。那么税是 ,顾客一共支付 。所以税占所付金额的 。
这接近 ,所以税约为 。而 ,, 更接近 。所以精确到整数,税占所付金额的 。
因此,正确答案是 A。
Say the price before tax is Then the tax is and the customer pays in all. So the tax is of the amount paid.
This is close to so the tax is near Now and and is closer to So to the nearest whole number the tax is of the amount paid.
Thus, the correct answer is A.
3.
正方形 的边长为 。设 是 的中点, 是 与 的交点。
的面积是多少?
Square has side length Let be the midpoint of and let be the intersection of and
What is the area of
小提示:
,所以三角形 与 相似
so triangles and are similar
大提示:
是 的一半,所以 的高是 的一半
is half of so is half as tall as
解答:
因为 ,三角形 与 相似,且 是 的一半。所以 的高是 的高的一半。两个高之和等于边长 ,所以 在三分之一高处,即高度为 。
于是 的面积为 。
另一种方法: 是 的一条中线。对角线 经过正方形的中心,也就是 的中点,所以它包含从 出发的中线。所以 是 的重心。三条中线把 分成六个面积相等的三角形, 是其中之一。所以它的面积是 乘以 ,即 。
因此,正确答案是 D。
Since triangles and are similar, and is half of So the height of is half the height of The two heights add up to the side so is one third of the way up, at height
Then has area
Alternatively, is a median of The diagonal passes through the center of the square, which is the midpoint of so it contains the median from So is the centroid of The three medians cut into six triangles of equal area, and is one of them. So its area is of which is
Thus, the correct answer is D.
4.
一个多边形的内角中,一半的内角每个都是 ,另一半的内角每个都是 。这个多边形有多少条边?
Half of the internal angles of a polygon measure each, and the other half of its internal angles measure each. How many sides does the polygon have?
小提示:
每个外角为 减内角,即使有负的,外角和仍是
Exterior angles, each minus the interior angle, sum to even when some are negative
大提示:
内角的平均值为
The interior angles average
解答:
每个顶点处的外角等于 减去内角:外角 对应 的角,外角 对应 的角,在那里边界朝反方向转。绕任何多边形走一圈共转过 ,所以外角之和为 。
内角平均为 ,所以外角平均为 。设有 条边,则 ,所以 。
因此,正确答案是 A。
The exterior angle at each corner is minus the interior angle: at the angles and at the angles, where the boundary turns back the other way. Going once around any polygon turns through in all, so the exterior angles add up to
The interior angles average so the exterior angles average With sides, so
Thus, the correct answer is A.
5.
设 、、、 是一个数列,其中 ,,并且 等于前 项的算术平均数,这里 。 的值是多少?
Let be a sequence with and equal to the arithmetic mean of the previous terms for What is the value of
小提示:
是 和 的平均数
is the mean of and
大提示:
添上当前的平均数,平均数不变
Appending the current mean leaves the mean unchanged
解答:
首先,。现在前三项的平均数是 ,因为 等于它前面两项的平均数。所以 。
每次添加一个等于当前平均数的项,平均数都保持不变。因此从 起的每一项都等于 ,从而 。
因此,正确答案是 C。
First, Now the first three terms have mean because equals the mean of the two terms before it. So
Each time we append a term equal to the current mean, the mean stays the same. Therefore every term from on equals and
Thus, the correct answer is C.
6.
一个边长为 、 和 的三角形内接于一个圆,把圆的内部分成四个区域。设 、 和 是其中三个非三角形区域的面积,且 最大。 的值是多少?
A triangle with sides and is inscribed in a circle, dividing the interior of the circle into four regions. Let and be the areas of the non-triangular regions, with being the greatest. What is the value of
答案:A
小提示:
把三边减半:、、
Halve the sides:
大提示:
直角三角形的斜边是其外接圆的直径
A right triangle’s hypotenuse is a diameter of its circle
解答:
把三边减半得到 、、,这是一组勾股数,所以这个三角形是直角三角形。它的斜边 是直径,半径为 。
这条直径把圆分成两半,每半的面积都是 。其中一半不含三角形的任何部分,所以它就是最大的区域 。另一半由三角形以及区域 和 组成,所以 。
因此,正确答案是 A。
Halving the sides gives a Pythagorean triple, so the triangle is right. Its hypotenuse is a diameter, and the radius is
The diameter cuts the disk into two halves of area each. One half contains no part of the triangle, so it is the largest region The other half is the triangle together with regions and so
Thus, the correct answer is A.
7.
有多少个正整数有序三元组 同时满足下面两个方程?
How many ordered triples of positive integers satisfy both of the following equations?
小提示:
用第二个方程减去第一个方程
Subtract the first equation from the second
大提示:
由此确定 和 。数出把 拆成两个正整数之和的方法数。
That fixes and Count the ways to split into two positive integers.
解答:
用第二个方程减去第一个方程,得到 ,所以 ,。数对 可以是 、、 或 ,所以共有 个三元组。
因此,正确答案是 A。
Subtracting the first equation from the second gives so and The pair can be or so there are triples.
Thus, the correct answer is A.
8.
一位司机看到高速公路上的电子指示牌显示:下一个出口在 英里外,到达那里需要 分钟。假设这两个数都已四舍五入到最接近的整数。在下列选项中,能使司机有可能在给定时间内合法到达出口的最低限速是每小时多少英里?
A driver sees an electronic highway sign stating that the next exit is miles away and it will take minutes to reach it. Assume both numbers have been rounded to the nearest integer. Among the following options, what is the lowest speed limit (in miles per hour) that would possibly allow the driver to legally reach the exit within the given time frame?
小提示:
距离至少为 英里,时间少于 分钟
The distance is at least miles, and the time is under minutes
大提示:
取最短距离和最长时间,按英里每小时计算
Use the shortest distance and the longest time, in miles per hour
解答:
出口至少在 英里外,而行程少于 分钟,因为 会被四舍五入成 。所以速度必须大于 英里每小时,能做到的最低选项是 。(以每小时 英里行驶, 英里需要 分钟。)
因此,正确答案是 C。
The exit is at least miles away, and the trip takes less than minutes, since would round up to So the speed must be more than miles per hour, and the lowest choice that can work is (At mph, miles takes minutes.)
Thus, the correct answer is C.
9.
两个相似但不全等的不等边三角形,各有一条长为 的边和一条长为 的边。较大三角形的最长边是多少?
Two similar but not congruent scalene triangles each have a side with length and a side with length What is the length of the longest side of the larger triangle?
小提示:
放大 倍会使每条边都变长,所以较小三角形的 必须变成较大三角形的
Scaling by lengthens every side, so the smaller triangle’s must become the larger triangle’s
大提示:
较大三角形的 必须来自较小三角形的第三条边
The larger triangle’s must come from the smaller triangle’s third side
解答:
设较小三角形的边长为 、 和 ,把它放大 倍。较大三角形的边长为 、 和 ,其中两条是 和 。因为 且 ,唯一的可能是 且 。
所以 ,较大三角形的边长为 、 和 。它由边长为 、 和 的较小三角形放大而来,由于 ,这是一个真正的三角形。答案是 。
因此,正确答案是 D。
Let the smaller triangle have sides and and scale it by The larger triangle has sides and two of which are and Since and the only possibility is and
So and the larger triangle has sides and It comes from the smaller triangle with sides and which is a genuine triangle since The answer is
Thus, the correct answer is D.
10.
对于哪个正奇数 ,、、、、、 的平均数恰好比它们的中位数大 ?
For what odd positive integer is the mean of exactly greater than its median?
小提示:
平均数是 ,中位数是
The mean is and the median is
大提示:
两者之比是 。令它等于 。
Their ratio is Set it to
解答:
这 个平方数的平均数是 ,又因为 是奇数,中位数就是正中间的平方数 。在两者之比中,因子 可以约去:
令它等于 ,得到 ,所以 。
因此,正确答案是 C。
The mean of the squares is and since is odd, the median is the middle square, The factor cancels in their ratio:
Setting this equal to gives so
Thus, the correct answer is C.
11.
Gary 写下六个不同的正整数:、、、、,以及一个三位数 。这六个数中有一个是全部六个数的最小公倍数。 的所有可能值之和是多少?
Gary writes down six distinct positive integers: and a three-digit number One of those six numbers is the least common multiple of all six of them. What is the sum of all possible values of
小提示:
、、 和 都是 的约数
and all divide
大提示:
六个数的最小公倍数若是 ,则 ;若是 ,则
The least common multiple of all six is so or it is so
解答:
、、 和 都整除 ,所以这六个数的最小公倍数是 和 的公倍数。它至少是 ,而 、、 和 都比它小,所以它一定是 或 。
如果它是 ,那么 是 的一个三位数因数,且不等于 本身,所以 。如果它是 ,那么 是 的一个三位数倍数,且不等于 ,所以 是 、 或 。它们的和为 。
因此,正确答案是 D。
Each of and divides so the least common multiple of all six numbers is a multiple of both and It is at least and and are all smaller, so it must be or
If it is then is a three-digit divisor of other than itself, so If it is then is a three-digit multiple of other than so is or The sum is
Thus, the correct answer is D.
12.
一个抽屉里有 只红袜子和 只蓝袜子。Pippi 每次随机取出一只袜子,不放回,直到某一种颜色的袜子全部被取出为止。这时抽屉里恰好剩下 只袜子的概率是多少?
A drawer has red socks and blue socks. Pippi randomly removes one sock at a time, without replacement, until all the socks of one color have been removed. What is the probability that there are exactly socks left in the drawer once that happens?
小提示:
设想取出全部 只袜子。剩下的袜子就是末尾同色的那一段。
Imagine all socks drawn. The socks left are the final run of one color.
大提示:
最后两只同色而倒数第三只不同色时,恰好剩 只
Exactly are left when the last two match and the third-to-last does not
解答:
设想全部 只袜子按随机顺序被取出。某种颜色取完时 Pippi 就停下,这时还留在抽屉里的袜子,正是这个顺序末尾那一段同色的袜子。所以当最后两只袜子同色而倒数第三只不同色时,恰好剩下 只。
无论最后一只袜子是什么颜色,倒数第二只与它同色的概率为 ,接着倒数第三只是另一种颜色的概率为 。答案是 。
因此,正确答案是 D。
Picture all socks coming out in a random order. Pippi stops when one color runs out, and the socks still in the drawer are the final run of one color at the end of the order. So exactly are left when the last two socks match and the third-to-last does not.
Whatever the color of the last sock, the second-to-last matches it with probability and then the third-to-last has the other color with probability The answer is
Thus, the correct answer is D.
13.
两个成员互不重叠的自行车俱乐部一起去骑行。骑行当天早上,成员们互相握手问候。每个人都与其他每个人恰好握手一次。同一俱乐部的成员之间共握手 次,不同俱乐部的成员之间共握手 次。来自较大俱乐部的人比来自较小俱乐部的人多多少?
Two bicycle clubs, with disjoint memberships, go on a tour together. On the morning of the tour, members greet each other with a handshake. Everyone shakes hands with everyone else exactly once. There were handshakes between members of the same club and handshakes between members of different clubs. How many more people came from the larger club than from the smaller club?
小提示:
共握手 次, 个人握手 次
handshakes, and people make
大提示:
人和 人的两个俱乐部之间握手 次。比较 和 。
Clubs of and people make handshakes between clubs. Compare and
解答:
每个人都与其他每个人握手一次,所以如果来了 个人,那么 。于是 ,所以 。
如果两个俱乐部分别有 人和 人,那么 ,并且俱乐部之间的握手次数为 。所以 ,较大的俱乐部比较小的多 人。
因此,正确答案是 C。
Everyone shook hands once with everyone else, so if people came, Then so
If the clubs have and people, then and the handshakes between the clubs number So and the larger club has more people.
Thus, the correct answer is C.
14.
考虑一个面积为正的三角形,它的边长是关于 的函数:,,。 可以取多少个不同的整数值?
Consider a triangle with positive area whose side lengths are functions of given by and How many different integer values of are possible?
无穷多个
infinitely many
小提示:
计算 和 ,并分别因式分解
Compute and and factor each
大提示:
两者都含因式 ,它必须为正
Both have the factor which must be positive
解答:
要使 为正,需要 ,这时 和 也为正。
三角形不等式中的式子都能简洁地因式分解。首先, 总是正的。其次, , 。因为 ,所以需要 且 。
所以 、、、,共 个值。
因此,正确答案是 B。
For to be positive we need and then and are positive too.
The triangle inequalities factor neatly. First, is always positive. Next, and Since we need and
So which is values.
Thus, the correct answer is B.
15.
下面树形图中的每个结点都标有一个有理数。最上面的结点位于第 层,它是 。每个结点 在它下面一层长出两个结点: 和 。例如,第 层的结点是 和 。
结点 出现在图中的第几层?
The tree diagram below has nodes labeled with rational numbers. The top node, at level is Each node sprouts two nodes in the level below it, and For example, level has nodes and
At what level does the node appear in the diagram?
结点 不会出现在图中。
The node does not appear in the
diagram.
小提示:
往上一层, 变成由 和 组成的分数
Going up a level, becomes a fraction made of and
大提示:
从 和 开始,不断用较大的数减去较小的数,直到得到 和
Starting from and keep subtracting the smaller number from the larger until you reach and
解答:
每个结点都是小于 的最简分数。如果一个结点是 ,那么它的父结点由 和 组成,按使分数小于 的顺序排列。所以每往上一步,就把这对数换成其中较小的数和两数之差,就像辗转相除法一样。
从 开始,依次得到数对 、、、、、、 和 。这样往上走 步到达 ,所以 在第 层。
因此,正确答案是 B。
Every node is a fraction less than in lowest terms. If a node is its parent is made of and in whichever order gives a fraction less than So each step up replaces the pair of numbers by the smaller one and their difference, as in the Euclidean algorithm.
Starting from the pairs are and That is steps up to so is at level
Thus, the correct answer is B.
16.
一个坛子里有 个红球、 个黑球和 个白球。假设从中随机不放回地取出 个球,并按如下方式计分:
• 每个红球得 分,红球最多共得 分。
• 每个黑球得 分,黑球最多共得 分。
• 每个白球得 分,白球最多共得 分。
例如,取出 个红球、 个黑球和 个白球,得分为 。得到最低可能分数的概率是多少?
An urn contains red balls, black balls, and white balls. Suppose balls are drawn at random without replacement and a score is computed as follows:
• point is given for each red ball up to a maximum of points.
• point is given for each black ball up to a maximum of points.
• point is given for each white ball up to a maximum of points.
For example, drawing red ball, black balls, and white balls would earn a score of What is the probability of getting the lowest possible score?
小提示:
得分等于 减去超出各自颜色上限的球数。尽量多浪费球。
The score is minus the balls beyond their color’s cap. Waste as many balls as possible.
大提示:
最多能浪费 个球: 个红球加 个其他球,或者另一种颜色 个、最后一种颜色 个
At most balls can be wasted: reds and other, or of one other color and of the last
解答:
如果一个球超出了它所属颜色的得分上限,就称它被浪费了。于是得分等于 减去被浪费的球数,所以我们要让尽可能多的球被浪费。
浪费 个球是不可能的。有 个红球时, 个红球被浪费,另外 个球没有被浪费。有 个红球时, 个红球被浪费,另外 个球都不会被浪费。有 个红球时, 个红球被浪费,另外 个球最多浪费 个。红球至多 个时,只有黑球和白球可能被浪费,而黑球和白球各浪费 个就需要 个球。所以最多浪费 个球,最低分是 。
恰好浪费 个球的情形有: 个红球加 个球,这个球取自其余 个球( 种), 个黑球加 个白球( 种),或者 个黑球加 个白球( 种)。这样共有 种,而等可能的取法共有 种,所以概率为 。
因此,正确答案是 D。
Call a ball wasted if it is beyond its color’s cap. Then the score is minus the number of wasted balls, so we want to waste as many as possible.
Wasting is impossible. With reds, reds are wasted and the other ball is not. With reds, reds are wasted and the other balls waste nothing. With reds, red is wasted and the other balls waste at most With at most reds, only black and white can be wasted, and wasting of each would take balls. So at most are wasted, and the lowest score is
Exactly are wasted with reds and of the other balls ( ways), with black and white ( ways), or with black and white ( ways). That is of the equally likely draws, for a probability of
Thus, the correct answer is D.
17.
在边长为 的正六边形内部,以每条边为一边各作一个正方形。位于全部六个正方形内部的区域,是一个较小六边形的内部,如下图阴影部分所示。
较小六边形的面积可以表示为 的形式,其中 、、 和 都是正整数, 与 互质,且 不能被任何质数的平方整除。 是多少?
For each edge of a regular hexagon with side length a square is constructed inside the hexagon with that edge as one of its sides. The region interior to all six squares is the interior of a smaller hexagon, shown shaded in the figure below.
The area of the smaller hexagon can be expressed in the form where and are positive integers, and are relatively prime, and is not divisible by the square of any prime. What is
小提示:
中心到每条边的距离是 ,每个正方形向内伸出
The center is from each edge, and each square reaches inward
大提示:
小六边形是同中心的正六边形,它的边到中心的距离是
The small hexagon is regular with the same center, and its sides are from it
解答:
设 为中心。每条边到中心的距离是 ,而这条边上的正方形朝 的方向向内延伸 ,所以正方形的内侧边刚好越过 ,落在另一侧与中心相距 的地方。它与对边上的正方形一起截出一条宽为 、以 为中心的带状区域。
三条带状区域相交成一个与大六边形中心相同、方向也相同的正六边形,它的每条边到 的距离都是 。(它的顶点到 的距离只有约 ,而正方形的其他边到 的距离是 ,所以截不到它。)它是大六边形按 的比例缩小得到的。
大六边形的面积是 ,所以小六边形的面积为 于是 。
因此,正确答案是 C。
Let be the center. Each edge is from and the square on that edge reaches inward, so its inner side lies just past at distance on the far side. Together with the square on the opposite edge, it cuts out a strip of width centered on
The three strips meet in a regular hexagon with the same center and orientation as the big one, whose sides are from (Its corners are only about from so the squares’ other sides, from do not cut it.) It is the big hexagon scaled by
The big hexagon has area so the small one has area So
Thus, the correct answer is C.
18.
由 个正整数组成的严格递减数列 由递推关系 定义,其中 。设 是 的最小可能值。 的各位数字之和是多少?
The strictly decreasing sequence of positive integers is defined by the recursive rule for Let be the minimum possible value of What is the sum of the digits of
小提示:
减去 :
Subtract :
大提示:
所以 必须是整数
So must be an integer
解答:
在递推式两边同时减去 ,得到 。所以每走一步,与 的距离就减半,因此 。
全部 项都是整数,当且仅当 整除 。数列严格递减,当且仅当 ,这时每一项都大于 ,因而都是正数。最小的选择是 ,所以 ,它的各位数字之和为 。
因此,正确答案是 D。
Subtracting from both sides of the rule gives So the distance from halves at every step, and
All terms are integers exactly when divides The sequence is strictly decreasing exactly when and then every term is above so positive. The smallest choice is so and its digit sum is
Thus, the correct answer is D.
19.
三个 的正方体放在桌面上,其中两个正方体共用一个面,而第三个正方体的一个面以另外两个正方体的一条公共棱为中线贴在它们旁边,如图所示。
把一个半球形的罩子罩在这些正方体上,使罩子的圆形边缘落在桌面上,并且所有正方体都在罩子下面。罩子半径的最小可能值是多少?
Three cubes sit on a table so that two of the cubes share a face, and a face of the third cube is centered along a shared edge of the other two cubes, as shown.
A hemispherical cover is placed over the cubes so that its circumference rests on the table and the cubes are under the cover. What is the least possible value of the radius of the cover?
答案:C
小提示:
高度为 的点到中心的水平距离不超过 时被罩住
A point at height is covered when its horizontal distance from the center is at most
大提示:
从上往下看,正方体构成一个 的长方形,一条长边的中间贴着一个 的正方形。求包住它的最小圆。
From above, the cubes form a rectangle with a square centered on a long side. Find the smallest circle around it.
解答:
罩子的中心在桌面上。高度为 、到中心的水平距离为 的点在罩子下面,当且仅当 。正方体顶面的角点最难被罩住,所以我们要找桌面上能包含这些正方体投影的最小圆。设它的半径为 ,则 。
把并排的两个正方体放在 、 的上方,把第三个正方体放在 、 的上方。这个圆必须覆盖角点 和 。由对称性,尝试取圆心为 ,使四个角点到它的距离都相等: 解得 ,。角点 都在这个圆内。圆心位于以这四个角点为顶点的梯形内部,所以没有更小的圆能把它们全部包含。
于是 ,。
因此,正确答案是 C。
The center of the cover lies on the table. A point at height whose horizontal distance from the center is is under the cover exactly when The top corners of the cubes are the hardest points to cover, so we need the smallest circle on the table that contains the cubes’ shadow. If its radius is then
Put the two side-by-side cubes over and the third cube over The circle must reach the corners and By symmetry, try the center with all four corners at the same distance: which gives and The corners are inside this circle. The center lies inside the trapezoid with those four corners, so no smaller circle holds them all.
Then and
Thus, the correct answer is C.
20.
尺寸为 或 的盒子,体积都是 。包括这两个在内,有多少个不同的盒子,其边长都是至少为 的整数,并且体积为 ?尺寸不同的盒子才算作不同的盒子。
Boxes with dimensions or have volume How many different boxes with integer side lengths at least including these two, have volume Boxes are considered different if they have different dimensions.
小提示:
。把这些质数分成三个非空组。
Split these primes into three nonempty groups.
大提示:
数有序分法:共 种,减去使某条边等于 的分法
Count ordered splits: ways, minus those that leave a side equal to
解答:
因为 ,按顺序选定三条边长,就相当于把七个质数中的每一个分给其中一条边。每条边都至少为 ,所以每条边都至少要分到一个质数。
分配质数共有 种方法。某条指定的边没有分到质数的分法有 种,某两条指定的边都没有分到质数的分法有 种。所以有序三元组共有 个。
三条边用到的质数各不相同,所以它们是三个不同的数,每个盒子都被计算了 次。所以共有 个盒子。
因此,正确答案是 C。
Since choosing the three side lengths in order means sending each of the seven primes to one of the sides. Every side must be at least so every side must get at least one prime.
There are ways to send the primes. Leaving a particular side empty happens in ways, and leaving two particular sides empty happens in way. So the ordered triples number
The three sides use different primes, so they are three different numbers, and each box is counted times. There are boxes.
Thus, the correct answer is C.
21.
Gerry 正在玩“三格游戏”。她的任务是把上图所示的 方格表划分成三个区域,每个区域由三个相连的方格组成。(如果三个方格中的每一个都与另外两个中的至少一个有公共边,就称这三个方格是相连的。)X 比 O 多的区域,每个得一分。下图是一个示例划分,它总共得一分。得分为两分或更多的划分就能赢得游戏。对于这个特定的方格表,在所有可能的划分中,能让 Gerry 获胜的划分占几分之几?
Gerry is playing the Triples Game. Her task is to partition the grid of squares shown at the top into three sections, each containing three adjoining squares. (Three squares are adjoining if each shares an edge with at least one of the other two.) One point will be awarded for each section containing more X’s than O’s. Shown below it is a sample partition that will earn one point in total. A partition that earns two or more points will win the game. What fraction of the possible partitions of this particular grid will result in a win for Gerry?
小提示:
只有 个方格是 X。获胜需要两个区域各含 个 X,所以第三个区域全是 O。
Only squares hold X’s. A win needs two sections with X’s each, so the third section is all O’s.
大提示:
只有底行和一个 L 形由三个 O 组成。分别检查包含它们的划分。
Only the bottom row and one L-shape consist of three O’s. Check the partitions that contain each.
解答:
每个区域要么是排成一条直线的三个方格,要么是 L 形。L 形可以放进一个 的方块中,所以它最多覆盖方格表的一个角,而中间的一行或一列一个角也不覆盖。三个区域要覆盖全部四个角,所以其中一个区域是沿着边的一整行或一整列。
剩下的是一个 的长方形,它有 种分法:分成两个直条,或用 种方法分成两个 L 形。四条边共给出 种,但“三行”和“三列”这两种划分各被数了两次,所以共有 种划分。
方格表中只有 个 X,而一个区域至少要有 个 X 才能得分。所以获胜的划分中有两个区域各含 个 X,第三个区域由三个 O 组成。由三个 O 组成的区域只有两个:底行,以及由中右、下中、下右三个方格组成的 L 形。
若取底行,上面两行可以分成两行(XOX 和 XXO)或两个 L 形(同样是 XOX 和 XXO),都能获胜;也可以分成 XXX 和 OXO,只得 分。若取这个 L 形,其余六个方格只能分成顶行加一个 L 形(XOX 和 XXO),或左列加一个 L 形(XXO 和 OXX),都能获胜。
所以共有 种划分能获胜,占全部 种划分的 。
因此,正确答案是 C。
Each section is a straight line of three squares or an L-shape. An L-shape fits in a block, so it covers at most one corner of the grid, and a middle row or column covers none. The three sections cover all four corners, so one of them is a full row or column along the edge.
That leaves a rectangle, which splits in ways: into two straight pieces, or into two L-shapes in ways. Four edges give but the three-rows and three-columns partitions are each counted twice, so there are partitions.
The grid has only X’s, and a section earns a point only with at least of them. So a winning partition has two sections with X’s each and a third section of three O’s. Only two sections consist of three O’s: the bottom row, and the L made of the middle-right, bottom-center, and bottom-right squares.
With the bottom row, the top two rows split as two rows (XOX and XXO) or as two L-shapes (XOX and XXO again), both wins, or as XXX and OXO, which earns only point. With the L, the other six squares split only as the top row plus an L (XOX and XXO) or as the left column plus an L (XXO and OXX), both wins.
So of the partitions win, a fraction of
Thus, the correct answer is C.
22.
一位工程师正在设计一个由 台风力发电机紧密排列而成的风电场。图中每台风力发电机的中心用一个带标签的点标出,每台风力发电机占据 个全等椭圆区域中的一个。同一行的风力发电机中心相距 个单位,同一列的风力发电机中心相距 个单位,如下图所示。
每个椭圆的长轴长为 ,其中 和 是正整数,且 不能被任何质数的平方整除。 是多少?
An engineer is designing a closely packed field of wind turbines for electricity production. Each turbine, whose center is marked by a labeled dot in the figure, occupies one of congruent elliptical regions. Turbines in the same row have centers that are units apart, and turbines in the same column have centers that are units apart, as shown in the figure below.
The major axis of each ellipse is where and are positive integers and is not divisible by the square of any prime. What is
小提示:
每个椭圆宽 。竖直方向压缩,把它们变成半径为 的圆。
Each ellipse is wide. Squeeze vertically to make them circles of radius
大提示:
和 水平相距 ,竖直相距 ,且它们的椭圆相切
and are apart across and apart vertically, and their ellipses touch
解答:
同一行的两台风力发电机所在的椭圆,在两个中心的正中间相切,所以每个椭圆的水平半轴为 。设竖直半轴为 。
把整个图在竖直方向上压缩为原来的 。每个椭圆都变成半径为 的圆,原来相切的椭圆仍然相切。中心 和 原来水平相距 、竖直相距 ,现在水平相距 、竖直相距 。半径为 的两个圆相切时,圆心相距 ,所以 解得 ,。
因为 ,所以长轴是竖直的,长度为 。所以 。
因此,正确答案是 A。
Turbines in the same row touch halfway between their centers, so each ellipse has horizontal semi-axis Call the vertical semi-axis
Squeeze the whole picture vertically by the factor Every ellipse becomes a circle of radius and ellipses that touched still touch. The centers and were apart across and apart up and down, so now they are across and up and down. Touching circles of radius have centers apart, so which gives and
Since the major axis is vertical, with length So
Thus, the correct answer is A.
23.
在由一个或多个连续整数组成的一列数中,有 个 的倍数和 个 的倍数。这列数可能对应多少个有序数对 ,其中 和 都在 到 之间(含端点)?
In a list of one or more consecutive integers, there are multiples of and multiples of How many ordered pairs are possible for this list if and are between and inclusive?
小提示:
在 个连续整数中, 是 向上或向下取整, 是 向上或向下取整
In consecutive integers, is rounded up or down, and is rounded up or down
大提示:
于是 和 都接近 。它们最多能相差多少?
Then and are both close to How far apart can they be?
解答:
取一列 个连续整数。其中 的倍数的个数是 向上或向下取整,所以 。 的倍数的个数是 向上或向下取整,所以 。两种取整的每种组合都会出现: 向哪边取整只取决于第一个数是偶数还是奇数, 向哪边取整只取决于第一个数除以 的余数,而任意连续六个起点覆盖了这两者的所有组合。
所以 可能出现,当且仅当存在正整数 同时满足 和 。这样的 存在,当且仅当 与 相差不超过 ,即 。(此时 与 中较小的那个可以作为 ,而且它是正数。)
下面按 计数。条件表明 与 相差不超过 。如果 整除 ,那么可取 个 值,否则可取 个。在 、、、 中,有 个 的倍数,其余 个不是。 只在 时出现,去掉它,得到 。(求出的每个 都不超过 ,所以 成立。)
因此,正确答案是 D。
Take a list of consecutive integers. The number of multiples of in it is rounded up or down, so The number of multiples of is rounded up or down, so Every combination of roundings occurs. Which way rounds depends only on whether the first number is even or odd, and which way rounds depends only on its remainder when divided by Any six consecutive starting points cover every combination of the two.
So is possible exactly when some positive satisfies both and Such an exists exactly when and are at most apart, that is, when (In that case the smaller of and works as and it is positive.)
Now count by The condition says is within of If divides that allows values of and otherwise Among there are multiples of and others. Dropping at gives (Every found is at most so holds.)
Thus, the correct answer is D.
24.
有多少个 次多项式 满足 并且首项系数等于 ,所有系数都是 到 之间(含端点)的整数?
How many polynomials of degree satisfying are there that have leading coefficient equal to and all of whose coefficients are integers between and inclusive?
小提示:
令 ,于是两个输入是
Put so that the two inputs are
大提示:
把 换成 只改变 的奇次幂
Replacing by changes only the odd powers of
解答:
设 。输入 关于 对称,所以令 。展开 、 和 , 的系数是 , 的系数是 。
把 换成 , 的奇次幂变号,偶次幂不变,所以 当 时,它等于 ,必须为 。所以 。
要使 ,需要 ,对应的 、、 和 ,都在范围内。常数项 有 种取法,可以是从 到 的任意整数。所以共有 个多项式。
因此,正确答案是 D。
Write The inputs are symmetric about so put Expanding and the coefficient of is and the coefficient of is
Replacing by flips the signs of the odd powers of and leaves the even powers alone, so At this is which must be So
For we need giving and all in range. The constant can be any of the integers from to So there are polynomials.
Thus, the correct answer is D.
25.
松鼠 Chris 的洞穴里有 个用来储存食物的房间。第一个房间里有 颗坚果,第二个房间里有 颗坚果,第三个房间里有 颗坚果,依此类推,第 个房间里有 颗坚果。从今天开始,Chris 每天会再收集 颗坚果,并把它们放进洞穴里 个不同的房间,每个房间放一颗。他的目标是在完成时让所有房间里的坚果数都相同。完成这个目标最少需要多少天?
Chris the squirrel has rooms in his cavern for storing food. The first room contains nut, the second room contains nuts, the third room contains nuts, and so on, with the th room containing nuts. Starting from today, Chris will collect additional nuts each day and store them one per room in distinct rooms in his cavern. His goal is to have all the rooms contain the same number of nuts once he is finished. What is the minimum number of days required to accomplish this goal?
小提示:
房间 每天最多增加一颗坚果,所以最后最多有 颗
Room gains at most one nut a day, so it ends with at most
大提示:
天后, 颗坚果必须等于每个房间最终数量的 倍
After days the nuts must be times the final count per room
解答:
假设 天后每个房间都有 颗坚果。这些房间一开始共有 颗坚果,所以 。房间 每天最多得到一颗坚果,所以 。于是 所以 。
当 时,。Chris 每天恰好跳过两个房间,而房间 需要 颗坚果,所以它必须被跳过 次。这些跳过次数加起来是 ,正好符合要求。
为了安排这些跳过,把 次跳过按顺序列出来:房间 一次,然后房间 两次,依此类推,最后是房间 十九次。在第 天,跳过列表中第 个和第 个位置上的房间。没有哪个房间出现 次,所以这两个位置上总是两个不同的房间。所以 天就是最少天数。
因此,正确答案是 B。
Suppose that after days every room holds nuts. The rooms start with nuts, so Room gets at most one nut a day, so Then so
With we get Each day Chris skips exactly two rooms, and room needs nuts, so it must be skipped times. These skips add up to as they should.
To schedule them, list the skips in order: room once, then room twice, and so on up to room nineteen times. On day skip the rooms in positions and of the list. No room appears times, so these are always two different rooms. So days is the minimum.
Thus, the correct answer is B.