2000 AIME I 第 12 题

先试着解答 2000 AIME I 第 12 题,然后核对你的答案与精心整理的解答,解答来自 LIVE by Po-Shen Loh。你也可以参加完整限时模拟考试、查看全部 2000 AIME I 解答,或核对答案。

所有题目均经美国数学协会(MAA)官方合法授权使用。

12.

给定函数 ff,对所有实数 xx 都满足 f(x)=f(398−x)=f(2158−x)=f(3214−x) \begin{aligned} f(x) &= f(398 - x) \\ &= f(2158 - x) \\ &= f(3214 - x) \end{aligned} 列表 f(0)f(0),f(1)f(1),f(2)f(2),…\ldots,f(999)f(999) 中最多能出现多少个不同的值?

Given a function ff for which f(x)=f(398−x)=f(2158−x)=f(3214−x) \begin{aligned} f(x) &= f(398 - x) \\ &= f(2158 - x) \\ &= f(3214 - x) \end{aligned} holds for all real x,x, what is the largest number of different values that can appear in the list f(0),f(0), f(1),f(1), f(2),f(2), …,\ldots, f(999)?f(999)?

答案:177
知识点:函数方程最大公约数对称性
难度评级:2920
小提示:

两个反射对称复合成一个平移:f(398−x)=f(2158−x)f(398 - x) = f(2158 - x) 强制 f(t)=f(t+1760)f(t) = f(t + 1760),类似地 f(t)=f(t+1056)f(t) = f(t + 1056)。

Two reflection symmetries compose to a translation: f(398−x)=f(2158−x)f(398 - x) = f(2158 - x) forces f(t)=f(t+1760),f(t) = f(t + 1760), and similarly f(t)=f(t+1056)f(t) = f(t + 1056)

大提示:

因此 ff 的周期为 gcd⁡(1760,1056)=352\gcd(1760, 1056) = 352,并且还有对称性 f(x)=f(46−x)f(x) = f(46 - x);对模 352352 的剩余类按配对计数。

So ff has period gcd⁡(1760,1056)=352,\gcd(1760, 1056) = 352, plus the symmetry f(x)=f(46−x);f(x) = f(46 - x); count residues mod 352352 up to that pairing

解答:

由于 f(398−x)=f(2158−x)f(398 - x) = f(2158 - x) 对所有 xx 都成立,令 t=398−xt = 398 - x,得到 f(t)=f(t+1760)f(t) = f(t + 1760);同理,f(2158−x)=f(3214−x)f(2158 - x) = f(3214 - x) 给出周期 10561056。因此 ff 有周期 gcd⁡(1760,1056)=352\gcd(1760, 1056) = 352。把 398398 对模 352352 化简,原对称性 f(x)=f(398−x)f(x) = f(398 - x) 变为 f(x)=f(46−x)f(x) = f(46 - x)。

因此 ff 由模 352352 的剩余类决定,且剩余类 rr 与 46−r46 - r 被迫取同值。配对方程 2r≡46(mod352)2r \equiv 46 \pmod{352} 有两个固定点:r=23r = 23 和 r=199r = 199。所以最多有 352−22+2=177\frac{352 - 2}{2} + 2 = 177 个等价类;又 0,1,…,9990, 1, \ldots, 999 覆盖模 352352 的所有剩余类,列表中最多有 177177 个不同值。

这个上界可达到:例如 f(x)=cos⁡2π(x−23)352f(x) = \cos\frac{2\pi(x - 23)}{352} 满足给定三个对称性(398398、21582158、32143214 都 ≡46\equiv 46 模 352352),并且只有被配对的剩余类会取相同值。所以答案是 177177。

Since f(398−x)=f(2158−x)f(398 - x) = f(2158 - x) for all x,x, substituting t=398−xt = 398 - x gives f(t)=f(t+1760);f(t) = f(t + 1760); likewise f(2158−x)=f(3214−x)f(2158 - x) = f(3214 - x) gives period 1056.1056. Combining, ff has period gcd⁡(1760,1056)=352.\gcd(1760, 1056) = 352. Reducing 398398 mod 352,352, the symmetry f(x)=f(398−x)f(x) = f(398 - x) becomes f(x)=f(46−x).f(x) = f(46 - x).

So ff is determined by residues mod 352,352, with residues rr and 46−r46 - r forced to share a value. This pairing has exactly two fixed points, from 2r≡46(mod352):2r \equiv 46 \pmod{352}: r=23r = 23 and r=199.r = 199. Hence there are at most 352−22+2=177\frac{352 - 2}{2} + 2 = 177 classes, and since 0,1,…,9990, 1, \ldots, 999 covers every residue mod 352,352, the list contains at most 177177 different values.

This is achievable: f(x)=cos⁡2π(x−23)352f(x) = \cos\frac{2\pi(x - 23)}{352} satisfies all three given symmetries (each of 398,398, 2158,2158, 32143214 is ≡46\equiv 46 mod 352352), and two integers get equal values only when their residues are paired. So the answer is 177.177.

第 11 题#11
完整试卷

其他年份的第 12 题