1998 AIME 详解
向下滚动即可查看来自 LIVE by Po-Shen Loh 的精心整理的解答,打印PDF 解答,查看答案,或参加完整限时模拟考试。
所有题目均经美国数学协会(MAA)官方合法授权使用。
1.
有多少个 值,使 是正整数 、 和 的最小公倍数?
For how many values of is the least common multiple of the positive integers and
小提示:
把所有数都分解成 和 的幂:,,
Factor everything into powers of and
大提示:
和 的最小公倍数已经提供了 ,但只提供 ,所以 必须恰好提供
The lcm of and already supplies but only so must contribute exactly
解答:
因为 ,,且 ,所以 不能含有 和 以外的质因数。设 。这三个数的最小公倍数为 。
要等于 ,必须有 ,即 ,并且 ,即 。这样共有 种 的选择, 有一种选择,所以共有 个 的值。
Since and the number can involve no primes other than and so write The least common multiple of the three numbers is then
Matching this to requires i.e. and i.e. That gives choices for and one for so there are values of
2.
求正整数有序对 的个数,其中 且 。
Find the number of ordered pairs of positive integers that satisfy and
小提示:
四个限制条件合起来把 限制在正方形 中
All four constraints together confine to the square
大提示:
在这个正方形内,减去满足 的有序对和满足 的有序对;这两个不合格集合互不相交且大小相同
Inside that square, subtract the pairs with and those with the two bad sets are disjoint and have equal size
解答:
两个链式不等式展开为四个条件:、、 和 。所以 位于正方形 内,并且要排除 和 ,这两个条件不可能同时发生。
对于满足 的有序对,当 从 到 时, 都可行,因此共有 对。由交换 与 的对称性,也有 对满足 的有序对。
所以答案是 。
The chains unpack into four conditions: and So lies in the square and within it we must avoid and which cannot both happen.
Pairs with for each from to the values work, giving pairs. By the symmetry swapping and there are also pairs with
The answer is
3.
方程 的图像把平面分成若干区域。求有界区域的面积。
The graph of partitions the plane into several regions. What is the area of the bounded region?
小提示:
当 时,方程可整理为 ,右边可以因式分解
For the equation rearranges to and the right side factors
大提示:
每种符号情形都会给出两条直线;这四条射线围成一个平行四边形,其水平边在 和 上
Each sign case yields two lines; the four rays bound a parallelogram with horizontal sides on and
解答:
当 时,把方程改写为 ,所以 或 。当 时,方程变为 ,所以 或 。因此图像由两条水平射线和两条斜率为 的射线组成。
这些射线围成一个平行四边形:上边从 到 ,在 上;下边从 到 ,在 上;两条斜率为 的斜边把它们连接起来。
这个平行四边形的水平底为 ,高为 ,也就是两条直线 和 之间的距离,所以面积为 。
For rewrite the equation as so either or For it becomes so either or The graph therefore consists of two horizontal rays and two rays of slope
These rays bound a parallelogram: the top edge runs from to along the bottom edge from to along and the two slanted edges of slope connect them.
The parallelogram has horizontal base and height between the lines and so its area is
4.
九张牌分别编号为 、、、、。三名玩家各自随机选择并保留三张牌,然后求自己三张牌上的数之和。三名玩家所得和全为奇数的概率为 ,其中 和 是互质正整数。求 。
Nine tiles are numbered respectively. Each of three players randomly selects and keeps three of the tiles, and sums those three values. The probability that all three players obtain an odd sum is where and are relatively prime positive integers. Find
小提示:
一名玩家的和为奇数,当且仅当他拿到奇数张奇数牌;总共有五张奇数牌
A player’s sum is odd exactly when the player holds an odd number of odd tiles; there are five odd tiles in all
大提示:
奇数牌必须按 、、 分给三名玩家。分别计算奇数牌和偶数牌的分配方式。
The odd tiles must split among the players. Count the ways to deal odds and evens separately.
解答:
一名玩家的三张牌之和为奇数,当且仅当他拿到奇数张奇数牌,也就是一张或三张。九张牌中有五张奇数牌和四张偶数牌,把五张奇数牌分到三个组中且每组奇数牌数为一或三,唯一的分法类型是 。
计算有利的发牌方式:选择哪名玩家得到三张奇数牌,有 种;选择这名玩家的三张奇数牌,有 种;把剩下两张奇数牌各给另外两名玩家,有 种;再把四张偶数牌按二二分给这两名玩家,有 种。因此有利发牌方式为 种。总发牌方式为 种。
概率为 ,所以 。
A player’s three tiles have an odd sum exactly when the player holds an odd number of odd tiles — one or three. The nine tiles include five odd and four even, and the only way to split five odd tiles into three groups of size one or three is
Count favorable deals: choose which player gets three odd tiles ( ways), choose that player’s odd tiles ( ways), give one of the two remaining odd tiles to each other player ( ways), then split the four even tiles two and two between those players ( ways), for deals. The total number of deals is
The probability is so
5.
已知 ,求 。
Given that find
小提示:
是整数,所以每个余弦值都是 ,其符号只取决于
is an integer, so each cosine is with sign depending only on
大提示:
把这 项从 开始分成连续的四项一组;相邻三角形数相差 ,所以每组都会化简
Group the terms into consecutive blocks of four starting at consecutive triangular numbers differ by so each block collapses
解答:
因为 为偶数, 是整数,且 。三角形数 的奇偶性只取决于 :当 时为偶数,当 时为奇数。所以 当 ,而 当 。
把这 项分成 个连续四项组,从 开始。利用 ,每个 的组都化简为
总和为 ,所以所求绝对值为 。
Since is even, is an integer and The parity of the triangular number depends only on it is even for and odd for So when and when
Group the terms into consecutive blocks of four starting at Using each block with collapses:
The total is so the requested absolute value is
6.
设 是一个平行四边形。将 经过 延长到点 ,并令 与 交于 ,与 交于 。已知 且 ,求 。
Let be a parallelogram. Extend through to a point and let meet at and at Given that and find
小提示:
有两组相似三角形: 给出 ,而 给出
Two pairs of similar triangles: gives and gives
大提示:
令 ,这些比值给出 ;用 求出
With the ratios give use to find
解答:
令 。因为 ,三角形 与 相似,所以 。因为 ,也就是 ,三角形 与 相似,所以 ,从而 。
设 ,则 ,,并且 因此 ,所以 ,因式分解为 ,得到 。
最后 。
Let Since triangles and are similar, so Since i.e. triangles and are similar, so which gives
Writing we get and Hence so which factors as giving
Finally
7.
设 为正奇整数有序四元组 的个数,这些四元组满足 。求 。
Let be the number of ordered quadruples of positive odd integers that satisfy Find
小提示:
代入 ,把奇数变量转化为任意正整数变量
Substitute to turn the odd variables into arbitrary positive integers
大提示:
新方程是 ;用插板法计算它的正整数解个数
The new equation is count its positive solutions with stars and bars
解答:
令 ,其中每个 都是正整数。于是 变为 ,所以 。
由插板法,正整数解的个数为 。因此 。
Write where each is a positive integer. Then becomes so
By stars and bars, the number of solutions in positive integers is Therefore
8.
除前两项外,数列 、、、 的每一项都是用前前一项减去前一项得到的。数列的最后一项是遇到的第一个负数。哪个正整数 能使这个数列的长度最大?
Except for the first two terms, each term of the sequence is obtained by subtracting the preceding term from the one before that. The last term of the sequence is the first negative term encountered. What positive integer produces a sequence of maximum length?
小提示:
写出各项:、、、,系数是斐波那契数
Write out terms: — the coefficients are Fibonacci numbers
大提示:
要让第十二项和第十三项非负,会把 限制在 和 之间,这个区间内恰好有一个整数
Keeping the twelfth and thirteenth terms nonnegative pins between and an interval containing exactly one integer
解答:
逐项计算得 、、、。一般地, 其中 、 是斐波那契数。数列能继续的充要条件是各项保持非负,所以要让数列越来越长, 必须夹在 和 之间,其中 越来越大。
要使前 项非负,需要 且 ,即 ,所以 。若 ,数列到 时已经变负;若 ,数列到 时已经变负,因此其他整数都会给出更短的数列。
事实上 时得到 、、,这是长度最大的 项数列。答案是 。
Computing terms, and in general where are the Fibonacci numbers. The sequence keeps going exactly as long as its terms stay nonnegative, so a long sequence requires to be squeezed between the ratios and for larger and larger
For the first terms to be nonnegative we need and i.e. so If the sequence turns negative by and if it turns negative by so every other integer gives a shorter sequence.
Indeed yields a sequence of terms, the maximum possible. The answer is
9.
两位数学家每天上午都喝咖啡休息。他们独立地在上午 点到 点之间的随机时刻到达自助餐厅,并停留恰好 分钟。其中一人到达时另一人正在自助餐厅的概率为 ,且 ,其中 、 和 是正整数,且 不被任何质数的平方整除。求 。
Two mathematicians take a morning coffee break each day. They arrive at the cafeteria independently, at random times between a.m. and a.m., and stay for exactly minutes. The probability that either one arrives while the other is in the cafeteria is and where and are positive integers, and is not divisible by the square of any prime. Find
小提示:
把两人的到达时间画成 正方形中的一个点;他们相遇当且仅当
Plot the two arrival times as a point in a square; they meet exactly when
大提示:
补集由两个直角三角形组成,合起来面积等于一个边长为 的正方形,所以
The complement consists of two right triangles that fit together into a square of side so
解答:
令两人的到达时间分别为 分钟和 分钟,单位是上午 点后的分钟,则 在一个 的正方形中均匀分布。两人相遇当且仅当 。
不相遇区域 由两个直角边长为 的直角三角形组成,总面积为 。相遇概率为 ,意味着 所以 。
因此 ,且 。
Let the arrival times be and minutes after a.m., so is uniform in a square. The two people meet exactly when
The non-meeting region consists of two right triangles with legs with total area Meeting with probability means so
Thus and
10.
八个半径为 的球放在一个平面上,使得每个球都与另外两个球相切,并且它们的球心是一个正八边形的顶点。第九个球也放在这个平面上,并且与其他八个球都相切。这个最后放入的球的半径为 ,其中 、 和 是正整数,且 不被任何质数的平方整除。求 。
Eight spheres of radius are placed on a flat surface so that each sphere is tangent to two others and their centers are the vertices of a regular octagon. A ninth sphere is placed on the flat surface so that it is tangent to each of the other eight spheres. The radius of this last sphere is where and are positive integers, and is not divisible by the square of any prime. Find
小提示:
八个球心都在高度 处,并位于边长为 的正八边形顶点上;第九个球心在八边形中心正上方,高度为
All eight centers lie at height at the vertices of an octagon of side the ninth center is at height above the octagon’s center
大提示:
相切给出 ,其中 是外接圆半径,且
Tangency gives where is the circumradius and
解答:
八个球心高度均为 ,位于边长为 的正八边形顶点上,因为相邻球相切。若第九个球半径为 ,则它放在平面上,球心在八边形中心正上方,高度为 。它与每个球相切,给出 ,其中 是八边形的外接圆半径。因此
正八边形的一条边在圆心处所对圆心角为 ,所以 。利用 ,得
于是 ,所以 。
The eight centers are at height at the vertices of a regular octagon of side (adjacent spheres are tangent). If the ninth sphere has radius it rests on the surface with its center at height directly above the octagon’s center, and tangency to each sphere gives where is the octagon’s circumradius. Hence
A side of a regular octagon subtends at the center, so and, using
Then so
11.
一个立方体的三条棱为 、 和 ,且 是一条体对角线。点 、 和 分别在 、 和 上,满足 、、 且 。平面 与立方体相交所得多边形的面积是多少?
Three of the edges of a cube are and and is an interior diagonal. Points and are on and respectively, so that and What is the area of the polygon that is the intersection of plane and the cube?
小提示:
设 、、、,并求过 、、 的平面
Set and find the plane through
大提示:
平面 截出一个六边形。投影到 -平面时,面积会乘以单位法向量的竖直分量
The plane cuts a hexagon. Projecting to the -plane scales area by the vertical component of the unit normal.
解答:
立方体边长为 。取 、、,以及 ,这样 是一条体对角线。于是 、、,过这三点的平面为 。
在立方体各顶点处代入 ,并检查十二条棱,可知平面还经过棱上的 、 和 ,所以截面是按顺序顶点为 、、、、、 的六边形。它在 -平面上的投影是六边形 、、、、、,用鞋带公式可得面积为 。
该平面的单位法向量 的竖直分量绝对值为 ,所以投影到 -平面会把面积乘以 。因此截面面积为 。
The cube has side Take and so is an interior diagonal. Then and the plane through them is
Evaluating at the cube’s vertices and checking all twelve edges, the plane also crosses the edges at and so the cross-section is the hexagon with vertices in order. Its projection onto the -plane is the hexagon whose area by the shoelace formula is
The plane’s unit normal has vertical component of magnitude so projecting onto the -plane multiplies area by The cross-section therefore has area
12.
设 为等边三角形,、 和 分别为 、 和 的中点。存在点 、 和 ,分别在 、 和 上,满足 在 上, 在 上,且 在 上。三角形 的面积与三角形 的面积之比为 ,其中 、 和 是整数,且 不被任何质数的平方整除。求 ?
Let be equilateral, and and be the midpoints of and respectively. There exist points and on and respectively, with the property that is on is on and is on The ratio of the area of triangle to the area of triangle is where and are integers, and is not divisible by the square of any prime. What is
小提示:
将 、、 分别用比例 、、 参数化,使它们依次位于 、、 上;把三个共线条件转化为方程
Parameterize and by separate fractions and along and ; translate the three collinearities into equations
大提示:
三个方程是 、 和 ;证明它们推出 ,再比较两个等边三角形公共中心到顶点的距离平方
The equations are and show they force then compare squared distances from the common center of the two equilateral triangles
解答:
取 、、,于是 、、。设 、、,其中 。计算三个二维叉积,三个共线条件 、 和 分别给出
令 。这些方程表示 、、,所以 因此 ,由正性得 。这些方程进而推出 ;把这个公共值记为 。这证明了所求构型确实具有对称性,而不是预先假设它对称。
此时 ,。两个三角形都是等边三角形,且中心同为 ,所以面积比为 。利用 ,
因此 所以 、、,且 。
Place so Write and where Computing the three two-dimensional cross products, the collinearities and give, respectively,
Let The equations say and so Hence and positivity gives The equations then force call this common value Thus the desired configuration really is the symmetric one, rather than merely being assumed to be.
With and both triangles are equilateral with center Therefore the area ratio is Using
Hence so and
13.
若 是一个实数集合,并按 编号,则它的复幂和定义为 ,其中 。令 为 的所有非空子集的复幂和之和。已知 ,且 ,其中 和 是整数。求 。
If is a set of real numbers, indexed so that its complex power sum is defined to be where Let be the sum of the complex power sums of all nonempty subsets of Given that and where and are integers, find
小提示:
将 的子集按是否包含 来划分;不含 的子集贡献
Split the subsets of by whether they contain those without contribute
大提示:
在 中,元素 总是最大元素,并贡献 ;对所有 求和得到
In the element is always largest and adds summing over all gives
解答:
将 的非空子集按是否包含 来划分。不含 的子集贡献 。包含 的子集可写成 ,其中 可以为空;因为 是其中最大的元素,它的复幂和等于 的复幂和再加上 。对所有 求和,又得到一个 外加
因为 ,所以 ,于是
因此 。
Split the nonempty subsets of by whether they contain Those without contribute A subset containing is for a (possibly empty) and since is its largest element, its complex power sum is the complex power sum of plus Summing over all gives another plus
Since we get so
Therefore
14.
一个 长方体的体积是一个 长方体体积的一半,其中 、 和 是整数,且 。 的最大可能值是多少?
An rectangular box has half the volume of an rectangular box, where and are integers, and What is the largest possible value of
小提示:
把体积条件改写为 ,并测试较小的
Rewrite the volume condition as and test small
大提示:
不可能,且 会把 限制得较小;当 时,方程因式分解为
are impossible and caps low; for the equation factors as
解答:
条件 可改写为 若 ,第一个因子本身就是 ;若 ,第一个因子等于 ,而其他因子都大于 。两者都不可能。若 ,则由于 ,前两个因子至多为 ,从而迫使 ,即 。
当 时,方程变为 ,即 ,所以 。当 时,方程变为 ,即 ,或 。两个因子必须为正;若 ,乘积 至多为 。因此最大的 来自 :,。确实有 。
因为其他所有情况都给出 ,所以最大可能值是 。
The condition rewrites as If the first factor alone is and if it equals while the other factors exceed both are impossible. If then since the first two factors are at most forcing i.e.
For the equation becomes i.e. so For it becomes i.e. or Both factors must be positive (if the product is at most ), so the largest comes from and Indeed
Since every other case yields the largest possible value is
15.
定义一张多米诺牌为一个由不同正整数组成的有序对。一个合法的多米诺序列是一列互不相同的多米诺牌,其中第一张之后每张牌的第一坐标都等于前一张牌的第二坐标,并且 与 对任意 和 都不能同时出现。令 为所有坐标不大于 的多米诺牌组成的集合。求使用 中的多米诺牌所能形成的最长合法多米诺序列的长度。
Define a domino to be an ordered pair of distinct positive integers. A proper sequence of dominos is a list of distinct dominos in which the first coordinate of each pair after the first equals the second coordinate of the immediately preceding pair, and in which and do not both appear for any and Let be the set of all dominos whose coordinates are no larger than Find the length of the longest proper sequence of dominos that can be formed using the dominos of
小提示:
多米诺牌就是 个顶点完全图中的边,而合法序列就是一条迹,也就是不重复边的游走
Dominos are the edges of the complete graph on vertices, and a proper sequence is a trail — a walk repeating no edge
大提示:
所有 个顶点的度都是奇数 ,但一条迹只允许有两个奇度顶点,所以必须有一些边不用;用互不相交的不用边来修正奇偶性
All vertices have odd degree but a trail allows only two odd-degree vertices, so some edges must go unused; disjoint unused edges fix the parities
解答:
一张多米诺牌 是顶点 上完全图的一条有向边,而 与 不能同时出现的规则意味着 条无向边每条至多使用一次。一个合法序列正是一条迹:不重复边的游走。在任何迹中,除两个端点外,每个顶点进入和离开的次数相等,所以它在已用边集合中的度为偶数。
完全图中每个顶点的度都是奇数 ,所以在未用边集合中至少有 个顶点必须是奇度顶点,而一个有 个奇度顶点的图至少有 条边。因此最多能使用 张多米诺牌。
反过来,先放弃 条互不相交的边 、、、。剩下的图连通,且只有顶点 和 为奇度顶点,所以存在一条遍历剩余全部 条边的欧拉迹;按这条迹行进的方向给每条边定向,就得到长度为 的合法序列。
A domino is an oriented edge of the complete graph on vertices and the rule that and cannot both appear means each of the edges is available at most once. A proper sequence is exactly a trail: a walk that repeats no edge. In any trail, every vertex other than the two endpoints is entered and left equally often, so it has even degree in the set of edges used.
In the complete graph every vertex has odd degree so at least vertices must have odd degree in the set of unused edges, and a graph with odd-degree vertices has at least edges. Hence at most dominos can be used.
Conversely, set aside the disjoint edges The remaining graph is connected and only vertices and have odd degree, so it has an Euler trail traversing all remaining edges; orienting each edge in the direction of travel gives a proper sequence of length