2025 AMC 12B 真题
计时
1:15:00
1.
一袋 克的咖啡豆说明上写着:正确冲泡一大杯手冲咖啡需要 克咖啡豆。用这袋咖啡豆最多可以正确冲泡多少大杯咖啡?
The instructions on a -gram bag of coffee beans say that proper brewing of a large mug of pour-over coffee requires grams of coffee beans. What is the greatest number of properly brewed large mugs of coffee that can be made from the coffee beans in that bag?
答案:B
小提示:
用咖啡豆的总克数除以每杯所需的克数。
Divide the total grams by the grams needed per mug
大提示:
只能计算完整的杯数,所以要将 向下取整。
Only whole mugs count, so round down
解答:
每杯需要 克,而 。由于只能冲泡完整的一杯,最多可冲 杯。
所以正确答案是 B。
Each mug uses grams, and Only complete mugs can be brewed, so the greatest number is
Thus, the correct answer is B.
2.
Jerry 写下前 个正平方数的个位数字:,,,,,,。他写下的所有数字之和是多少?
Jerry wrote down the ones digit of each of the first positive squares: What is the sum of all the numbers Jerry wrote down?
小提示:
的个位数字只由 的个位数字决定,所以这个列表每 项循环一次。
The ones digit of depends only on the ones digit of so the list repeats every terms
大提示:
求出一个完整 项循环的和,乘以循环次数,再加上剩余项。
Sum one full block of multiply by the number of blocks, then add the leftover terms
解答:
的个位数字依次为 ,其和为 。这 项包含 个完整的循环块(共 项),另外还有 项,它们的个位数字为 ,和为 。因此总和为 。
所以正确答案是 D。
The ones digits of are which sum to The terms contain full blocks ( terms) plus more with digits summing to The total is
Thus, the correct answer is D.
3.
若 ,求 的值。
What is the value of where
答案:D
小提示:
分组相乘:先算 和 。
Multiply in pairs: and
大提示:
利用 化简每个乘积,再将两个结果相乘。
Use to reduce each product before multiplying the two results
解答:
,而 。于是
所以正确答案是 D。
and Then
Thus, the correct answer is D.
4.
以七为底的两位数 的值等于以九为底的两位数 的值。 是多少?
The value of the two-digit number in base seven equals the value of the two-digit number in base nine. What is
小提示:
按位值计算,以七为底的 是 ,以九为底的 是 。
Write each number in terms of its base: is and is
大提示:
令 ,再化简得到 与 的比例关系。
Set and simplify to a ratio between and
解答:
令 ,得到 ,所以 。因而 且 。因为两者都是七进制数字并且 ,只有 可行。因此 ,而且确实有 。所以 。
因此,正确答案是 A。
Setting gives so Thus and Because both are base-seven digits and only works. Hence and indeed Therefore
Thus, the correct answer is A.
5.
正整数 和 满足方程 。求 的最小可能值。
Positive integers and satisfy the equation What is the least possible value of
小提示:
将 对 取模,以确定 的可能形式。
Reduce modulo to pin down
大提示:
因为 为正整数且 ,所以只需检查很少几个 的值。
Since is positive and only a few values of are possible
解答:
对 取模,方程变为 ,所以 。又 ,正整数解只能有 。代回得 ,所以 。因此 。
所以正确答案是 E。
Modulo the equation gives so With the only option is which gives so Then
Thus, the correct answer is E.
6.
Emmy 对 Max 说:“我今天订了 件数学俱乐部卫衣。”Max 问:“每件多少钱?”Emmy 回答:“给你一个提示:总价是 ,其中 和 是数字,且 。”停顿片刻后,Max 说:“这价格真不错。”求 。
Emmy says to Max, “I ordered math club sweatshirts today.” Max asks, “How much did each shirt cost?” Emmy responds, “I’ll give you a hint. The total cost was where and are digits and ” After a pause, Max says, “That was a good price.” What is
小提示:
以美分计,总价为 且必须能被 整除。
In cents the total is and it must be divisible by
大提示:
对 取模得 ,再检查满足 的数字解。
Reduce modulo to get then test digits with
解答:
以美分为单位,总额为 ,它必须是 的倍数。因为 且 ,条件为 ,即 。再对 取模,得到 ,所以唯一可能的非零数字是 。此时 只有当数字 时才能被 整除。确实,,所以 。
因此,正确答案是 C。
The total in cents is which must be a multiple of Since and the condition is i.e. Reducing once more modulo gives so the only possible nonzero digit is Then is divisible by only for the digit Indeed so
Thus, the correct answer is C.
7.
8.
存在整数 和 ,使得多项式 有根 。 是多少?
There are integers and such that the polynomial has as a root. What is
小提示:
整数系数会迫使共轭数 也是一个根。
Integer coefficients force the conjugate to be a root as well
大提示:
三个根的和为 ,先求第三个根,再展开读出 和 。
The three roots sum to so find the third root, then expand to read off and
解答:
共轭数 也是根,而两者对应的二次因式是 。设第三个根为 ,由根和得 ,所以 。展开 ,故 ,,。
所以正确答案是 C。
The conjugate is also a root, and these two are the roots of The third root satisfies so Then giving and so
Thus, the correct answer is C.
9.
的十位数字是多少?
What is the tens digit of
小提示:
十位数字由 决定。
The tens digit is determined by
大提示:
当 时, 以周期 循环;把指数 对 取模。
For cycles with period reduce the exponent modulo
解答:
先算得 。当 时, 的末两位以周期 循环:。因为 ,所以 的末两位是 ,十位数字为 。
所以正确答案是 C。
Here For the last two digits of cycle with period through Since ends in so the tens digit is
Thus, the correct answer is C.
10.
一个 直角三角形斜边上的高,被到最短边的中线分成长度为 的两段。 是多少?
The altitude to the hypotenuse of a right triangle is divided into two segments of lengths by the median to the shortest side of the triangle. What is the ratio
小提示:
把直角放在原点,两条直角边沿坐标轴,然后给每个关键点设坐标。
Place the right angle at the origin with the legs along the axes and coordinatize every point
大提示:
求到最短边的中线与斜边上的高的交点,再看这个交点如何分割高。
Find where the median to the shortest side crosses the altitude to the hypotenuse, then split the altitude at that point
解答:
取 、、,则 是斜边, 是最短边。从 到 的高交点为 。从 到最短边中点 的中线与高交于 。于是 ,,所以 ,。
所以正确答案是 A。
Take so is the hypotenuse and is the shortest side. The altitude from meets at The median from to crosses the altitude at This splits the altitude into and so and
Thus, the correct answer is A.
11.
九名运动员参加篮球队选拔,且没有两人身高相同。他们依次从一个袋子中随机抽取腕带,不放回;袋中有 条蓝色、 条红色、 条绿色腕带。他们被分成蓝组、红组和绿组。每组最高的成员被指定为该组队长。三名队长正好是最高的三名运动员的概率是多少?
Nine athletes, no two of whom are the same height, try out for the basketball team. One at a time, they draw a wristband at random, without replacement, from a bag containing blue bands, red bands, and green bands. They are divided into a blue group, a red group, and a green group. The tallest member of each group is named the group captain. What is the probability that the group captains are the three tallest athletes?
小提示:
队长是最高的三人,当且仅当这三人分到三个不同的组。
The captains are the three tallest exactly when the three tallest land in three different groups
大提示:
依次放置前三高的人;每个人都必须避开已经用过的组,而剩余位置数也在减少。
Place the tallest three one at a time; each must avoid the groups already used, whose slots shrink the pool
解答:
每组有 个位置。最高的三名运动员正好成为队长,当且仅当他们落在三个不同的组中。将三人依次放入 个位置,第二人在剩下的 个位置中有 个可选,第三人在剩下的 个位置中有 个可选。因此概率为 。
所以正确答案是 C。
Each group has slots. The three tallest athletes are the captains precisely when they fall into three different groups. Placing them one at a time into the slots, the second must avoid the first’s group ( of the remaining slots) and the third must avoid both used groups ( of the remaining slots). The probability is
Thus, the correct answer is C.
12.
下图显示了一辆大型公交车驾驶员一侧的雨刷。
雨刷臂 绕点 来回转动,扫过 的弧,并且关于过 的竖直线对称。雨刷片 在其中点处连到 ,并且在雨刷臂运动时始终保持竖直。雨刷臂长 英尺,雨刷片高 英尺。雨刷清洁的挡风玻璃面积是多少平方英尺?答案四舍五入到百分位。(假设挡风玻璃是平的竖直平面。)
The windshield wiper on the driver’s side of a large bus is depicted below.
Arm pivots back and forth around point sweeping out an arc of symmetric about the vertical line through The wiper blade is attached to at its midpoint and stays vertical as the arm moves. The arm is feet long, and the wiper blade is feet tall. What is the area of the windshield cleaned by the wiper, in square feet, to the nearest hundredth? (Assume that the windshield is a flat vertical surface.)
小提示:
雨刷臂转动时, 走过半径为 的圆弧;雨刷片始终是以 为中点、高为 的竖直线段。
As the arm turns, traces an arc of radius the blade is always a vertical segment of height centered at
大提示:
每条竖直线与清洁区域的交集长度恒为 ,所以面积等于这个高度乘以扫过的水平宽度。
Each vertical line meets the cleaned region in a segment of constant height so the area is that height times the horizontal width swept
解答:
把 放在原点。则 ,其中 ,所以 的水平坐标范围是 ,宽度为 。每个水平位置都有一条高度为 的竖直雨刷片经过,所以由卡瓦列里原理,清洁面积为 平方英尺。
所以正确答案是 C。
Put at the origin. Then for so the horizontal coordinate of ranges over a width of At each horizontal position exactly one vertical blade of height passes through, so by Cavalieri’s principle the cleaned area is square feet.
Thus, the correct answer is C.
13.
一个圆被分成 个大小不同的扇形。接着把其中 个扇形涂红、 个涂绿、 个涂蓝,并要求相邻的两个扇形颜色不同。下图展示了一种涂色方式。
一共有多少种不同的涂色方式?
A circle has been divided into sectors of different sizes. Then of the sectors are painted red, painted green, and painted blue so that no two neighboring sectors are painted the same color. One such coloring is shown below.
How many different colorings are possible?
小提示:
同色扇形不能相邻,所以每种颜色的两个扇形必须形成一对不相邻的位置。
Because same-colored sectors cannot touch, the two sectors of each color form a non-adjacent pair
大提示:
先数把 个扇形分成三对不相邻扇形的方法,再把三种颜色分配给这些对。
Count the ways to split the sectors into three non-adjacent pairs, then assign the three colors to the pairs
解答:
每种颜色的两个扇形必须不相邻,所以一种涂色方案就是将 个环形排列的扇形分成三对不相邻的位置,再为三对分配颜色。不相邻的位置对应于 环的补图,该补图是三棱柱图,有 个完美匹配。再用 种方式将三种颜色分配给三对,共有 种涂色方案。
所以正确答案是 D。
The two sectors of each color must be a non-adjacent pair, so a coloring is a way to split the cyclic sectors into three non-adjacent pairs together with an assignment of the three colors. The non-adjacent pairs are the edges of the complement of the -cycle, the triangular prism, which has perfect matchings. Assigning the three colors in ways gives colorings.
Thus, the correct answer is D.
14.
考虑一个由 个正整数组成的递减序列 ,满足以下两个条件:
• 序列前 项的平均数(算术平均值)是 。
• 对所有满足 的整数,序列前 项的平均数比前 项的平均数小 。
的最大可能值是多少?
Consider a decreasing sequence of positive integers that satisfies the following two conditions:
• The average (arithmetic mean) of the first terms in the sequence is
• For all the average of the first terms in the sequence is less than the average of the first terms in the sequence.
What is the greatest possible value of
小提示:
令 为前 项的平均数;第二个条件给出 ,其中 。
Let be the average of the first terms; the second condition gives for
大提示:
由 求出 ,其中 ,再要求每一项都为正数。
From recover for then require every term to stay positive
解答:
当 时,前 项的平均数为 ,所以部分和为 。当 时,,它为正数当且仅当 。取合适的开头,例如 ,可使整个序列严格递减,所以 的最大可能值为 。
所以正确答案是 B。
The average of the first terms is for so the partial sum is For which is positive exactly when A valid start such as keeps the whole sequence strictly decreasing, so the greatest possible is
Thus, the correct answer is B.
15.
一个容器底部是 的正方形,顶部开口是 的正方形,四个侧面是全等的梯形,如图所示。从空容器开始,一根以恒定速率出水的水管用 分钟把容器装到梯形侧面的中线高度。
还需要多少分钟才能把容器剩余部分装满?
A container has a square bottom, a open square top, and four congruent trapezoidal sides, as shown. Starting when the container is empty, a hose that runs water at a constant rate takes minutes to fill the container up to the midline of the trapezoids.
How many more minutes will it take to fill the remainder of the container?
小提示:
在高度比例为 处,水平截面是边长 的正方形,所以面积为
At height fraction the cross-section is a square of side so its area is
大提示:
比较到中线()的体积与总体积;装水时间与体积成正比。
Compare the volume up to the midline () with the total volume; fill time is proportional to volume
解答:
在高度比例为 处,水平截面正方形的边长为 ,所以装到高度 的体积为 。装到中线 时,这个体积为 ,而总体积为 。剩余体积为 ,是前一部分的 倍。因此装满剩余部分还需 分钟。
所以正确答案是 D。
At height fraction the square cross-section has side so the volume filled up to height is Up to the midline this is and the full volume is The remaining volume is which is times the first part. So the remainder takes more minutes.
Thus, the correct answer is D.
16.
一个指针钟从午夜开始走了 分钟后停止。停止时,时针和分针之间的锐角的正切值是多少?
An analog clock starts at midnight and runs for minutes before stopping. What is the tangent of the acute angle between the hour hand and the minute hand when the clock stops?
小提示:
将 分钟按 小时取余,找出钟面显示的时间。
Reduce minutes modulo hours to find where the hands point
大提示:
分别求时针和分针的角度,取锐角差,再计算 。
Find each hand’s angle, take the acute difference, then evaluate
解答:
分钟是 小时 分钟,按 小时取余后为 。分针指向 ,时针指向 ,所以两针之间的锐角是 。由半角值,。
所以正确答案是 B。
minutes is hours minutes, which modulo hours reads The minute hand points at and the hour hand at so the acute angle between them is Using the half-angle value,
Thus, the correct answer is B.
17.
一个 方格中的 个小正方形要被涂成红、蓝、黄三色,要求每个红色小方格至少与一个蓝色小方格共边,每个蓝色小方格至少与一个黄色小方格共边,每个黄色小方格至少与一个红色小方格共边。可以通过旋转和/或反射互相得到的涂色视为相同。共有多少种不同的涂色?
Each of the squares in a grid is to be colored red, blue, or yellow in such a way that each red square shares an edge with at least one blue square, each blue square shares an edge with at least one yellow square, and each yellow square shares an edge with at least one red square. Colorings that can be obtained from one another by rotations and/or reflections are to be considered the same. How many different colorings are possible?
小提示:
每种颜色都必须出现,而且红 蓝 黄 红的循环条件会强烈限制布局。
Every color must appear, and the cyclic conditions red blue yellow red tightly constrain the layout
大提示:
先数固定带标号的方格上所有合法涂色,再用 Burnside 引理按 个旋转和反射对称化简。
Count all valid colorings of the fixed (labeled) grid, then reduce by the rotations and reflections using Burnside’s lemma
解答:
先在方格位置带标号的情形下数涂色数。依次检查 种可能的行,一旦某个方格的邻格都已确定却缺少所需的下一种颜色就立即舍弃该行,这样按红、蓝、黄方格的个数可得如下完整计数: 因此恒等对称固定了 种涂色。
对于其余的对称,被固定的涂色数为:每个非恒等旋转 种,关于水平轴或竖直轴的每个反射 种,每个对角线反射 种。(对于关于轴的反射,直接检查三个回文行即可得到这 种可能。)因此由 Burnside 引理得
因此,正确答案是 C。
First count colorings of the grid with its positions labeled. Checking the possible rows in succession and rejecting a row as soon as a square whose neighbors are now known lacks its required next color gives the following complete count by the numbers of red, blue, and yellow squares: Thus the identity symmetry fixes colorings.
For the other symmetries, the fixed-coloring counts are for each nontrivial rotation, for each reflection across a horizontal or vertical axis, and for each diagonal reflection. (For an axis reflection, a direct check of the three palindromic rows gives the possibilities.) Therefore Burnside’s lemma gives
Thus, the correct answer is C.
18.
Awnik 反复玩一个获胜概率为 的游戏。各局结果相互独立。直到他至少赢过一次且输过一次为止,他所玩的局数的期望值是多少?
Awnik repeatedly plays a game that has a probability of winning of The outcomes of the games are independent. What is the expected value of the number of games he will play until he has both won and lost at least once?
小提示:
第一局后已经出现了一种结果;之后只需要等待相反的结果。
After the first game you already have one outcome; you then wait only for the opposite outcome
大提示:
等待概率为 的结果首次出现的期望次数是 ;按第一局是赢还是输分类。
The expected number of games to get an outcome of probability is condition on whether the first game is a win or a loss
解答:
第一局会产生一种结果。如果第一局赢了(概率 ),则等待一次失败的期望局数为 ;如果第一局输了(概率 ),则等待一次获胜的期望局数为 。所以总期望为 。
所以正确答案是 D。
The first game produces one outcome. If it was a win (probability ), the expected wait for a loss is if it was a loss (probability ), the expected wait for a win is So the expected total is
Thus, the correct answer is D.
19.
一个由小正方形组成的矩形网格有 行和 列。每个小正方形里有放两个数字的空间。Horace 和 Vera 都把从 到 的数字填入网格。Horace 按行填写:他把 到 依次从左到右填入第 行,把 到 依次从左到右填入第 行,并如此继续到第 行。Vera 按列填写:她把 到 依次从上到下填入第 列,再把 到 依次从上到下填入第 列,并如此继续到第 列。有多少个小正方形中两人写下了相同的数字?
A rectangular grid of squares has rows and columns. Each square has room for two numbers. Horace and Vera each fill in the grid by putting the numbers from through into the squares. Horace fills the grid horizontally: he puts through in order from left to right into row puts through into row in order from left to right, and continues similarly through row Vera fills the grid vertically: she puts through in order from top to bottom into column then through into column in order from top to bottom, and continues similarly through column How many squares get two copies of the same number?
小提示:
分别写出第 行第 列中 Horace 和 Vera 填入的数字,并将结果表示为 和 的公式
Write the Horace-number and the Vera-number of the square in row column as formulas in and
大提示:
令两式相等可得 ;找出哪些 会使 是指定范围内的整数
Setting them equal gives find which make an integer in range
解答:
在第 行第 列,Horace 写的是 ,Vera 写的是 。令二者相等,得 ,即 。这要求 ,所以 ,共有 个值;每个都给出合法的 ,且在 到 之间。因此有 个小正方形匹配。
所以正确答案是 C。
In row column Horace writes and Vera writes Setting these equal gives i.e. This requires so — that is values, and each yields a valid between and So squares match.
Thus, the correct answer is C.
20.
一只青蛙按如下规则在数轴上跳跃。
• 它从 开始。
• 如果它在 ,那么它移动到 的概率为 ,并以概率 消失。
• 对于 , 或 ,如果它在 ,那么它移动到 的概率为 ,移动到 的概率为 ,并以概率 消失。
青蛙到达 的概率是多少?
A frog hops along the number line according to the following rules.
• It starts at
• If it is at then it moves to with probability and it disappears with probability
• For or if it is at then it moves to with probability it moves to with probability and it disappears with probability
What is the probability that the frog reaches
小提示:
令 为从 出发最终到达 的概率;对每个状态写出第一步方程
Let be the probability of eventually reaching starting from write a first-step equation at each state
大提示:
取 ,并把青蛙消失后的值看作 ,解这个线性方程组。
Solve the linear system with and value whenever the frog disappears
解答:
令 为从 出发最终到达 的概率。则 ,且对 有 ,并且 。依次求解得 和 ;再由 得 ,从而 。
所以正确答案是 E。
Let be the probability of reaching from Then and for with Solving upward gives and then yields so
Thus, the correct answer is E.
21.
两个不全等三角形面积相同。每个三角形都有两条边长为 和 ,并且第三边的长度是整数。求这两个第三边长度的和。
Two non-congruent triangles have the same area. Each triangle has sides of length and and the third side of each triangle has integer length. What is the sum of the lengths of the third sides?
小提示:
若边长 和 的夹角为 ,面积为 ,所以相同面积来自 与 。
With sides and and included angle the area is so equal areas come from and
大提示:
由余弦定理,两个第三边满足 ,所以
By the law of cosines the third sides satisfy so
解答:
夹角为 时,面积为 ,因此两个等面积三角形的夹角为 和 ,余弦分别为 。由余弦定理,第三边满足 ,因此 。因为 ,所以两条整数边都必须是奇数。在三角形不等式给出的范围 内检查各个奇数的平方,只剩下 。因此这两条第三边的长度之和为 。
所以正确答案是 C。
The area with included angle is so two triangles of equal area use angles and with cosines By the law of cosines the third sides satisfy hence Since both integer sides must be odd. Checking the odd squares in the triangle-inequality range leaves only Therefore the sum is
Thus, the correct answer is C.
22.
在复平面中,复数 满足 ,一个三角形的三个顶点为 、、。这个三角形的最大可能面积是多少?
What is the greatest possible area of the triangle in the complex plane with vertices and where is a complex number satisfying
小提示:
这些顶点是将固定点 同时乘以 得到的,所以三角形按 的比例缩放。
The vertices are times the fixed points so the triangle is that fixed triangle scaled by
大提示:
面积等于固定三角形的面积乘以 ;条件 表示一个圆,所以要在圆上使 最大。
Its area is times a fixed area; the condition is a circle, so maximize on it
解答:
三个顶点是 、、,所以该三角形是顶点为 的面积为 的固定三角形按比例 缩放得到的,面积为 。条件 等价于 ,所以 最大为 。最大面积为 。
所以正确答案是 C。
The vertices are and so the triangle is the fixed triangle with vertices — which has area — scaled by giving area The condition is the circle on which is at most So the greatest area is
Thus, the correct answer is C.
23.
设 是所有整数 组成的集合,且这些整数满足:对于所有满足 的非负整数对 , 除以 的余数小于 除以 的余数。求 中所有元素的和。
Let be the set of all integers such that for all pairs of nonnegative integers with the remainder when is divided by is less than the remainder when is divided by What is the sum of the elements of
小提示:
条件表示映射 在 上严格递增。
The condition says the map is strictly increasing on
大提示:
从 开始的 的递增重排只能是自身,所以迫使 。
An increasing rearrangement of starting at must be the identity, forcing
解答:
条件要求 在集合 上严格递增。这些值都是模 后落在 中的不同数,所以递增列表只能是 。因此 ,即 是 的倍数。由于 ,其所有正因数之和为 。排除 后,和为 。
所以正确答案是 E。
The condition requires to be strictly increasing on A strictly increasing list of distinct values in must be so i.e. is divisible by Since the sum of all its divisors is Excluding leaves
Thus, the correct answer is E.
24.
有多少个实数满足方程 ?
How many real numbers satisfy the equation
小提示:
解必须满足 ,所以 位于 。
A solution needs so lies in
大提示:
在 的每个单调半波上,缓慢上升的对数曲线恰好相交一次;在两端仔细清点分支。
On each monotonic half-wave of the slowly rising log crosses once; count the branches carefully at both ends
解答:
因为 ,每个解都位于 。当 时,对数为负,所以 中只有 个负的正弦波瓣可能有解。每个波瓣在最低点两侧各有一个交点;在最后一个波瓣中,第二个交点就是端点 。因此这一部分贡献 个解。
当 时,只有正波瓣有贡献。这样的波瓣有 个:对 ,从 到 的每个区间中有一个。除第一个之外,每个波瓣都在最高点两侧各有一个交点。第一个波瓣只有一个新交点,因为其左端点是已经计数的解 。因此 再贡献 个解。
为完整起见,每个半波瓣上交点唯一,可以通过对两边之差求导来证明。在下降的正半波瓣上,它严格递减。在上升的正半波瓣上,其导数先增后减一次,所以差值只会从负变正一次。对 使用同样的论证即可处理负波瓣。总数为 。
因此,正确答案是 D。
Since every solution lies in For the logarithm is negative, so only the negative sine lobes in can contribute. Each has one crossing on each side of its minimum; on the last lobe, the second crossing is the endpoint Hence this part contributes solutions.
For only positive lobes contribute. There are of them: one in each interval from to for Every one after the first has one crossing on each side of its maximum. The first has only one new crossing because its left endpoint is the already-counted solution Thus contributes more solutions.
For completeness, the claimed uniqueness on each half-lobe follows by differentiating the difference of the two sides. On a falling positive half-lobe it is strictly decreasing. On a rising positive half-lobe its derivative increases and then decreases once, so the difference crosses from negative to positive only once. Applying the same argument to handles a negative lobe. The total is
Thus, the correct answer is D.
25.
三个同心圆的半径分别为 ,,。一个边长为 的等边三角形在每个圆上各有一个顶点。求 。
Three concentric circles have radii An equilateral triangle with side length has one vertex on each circle. What is
小提示:
若一点到边长为 的等边三角形三个顶点的距离分别为 ,则 之间存在一个对称关系
For a point at distances from the vertices of an equilateral triangle of side there is a symmetric relation among
大提示:
使用 ,并代入 。
Use with
解答:
公共圆心到边长为 的等边三角形三个顶点的距离为 ,因此有恒等式 。化简得 ,即 ,所以 。
所以正确答案是 E。
For the common center at distances from the vertices of an equilateral triangle of side the identity holds. This simplifies to i.e. so
Thus, the correct answer is E.