2007 AIME II 第 7 题

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

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

7.

给定实数 xx,令 x\lfloor x \rfloor 表示小于或等于 xx 的最大整数。对某个整数 kk,恰好有 7070 个正整数 n1n_1n2,n_2, \ldotsn70n_{70} 满足 k=n13=n23==n703 \begin{aligned} k &= \lfloor\sqrt[3]{n_1}\rfloor = \lfloor\sqrt[3]{n_2}\rfloor \\ &= \cdots = \lfloor\sqrt[3]{n_{70}}\rfloor \end{aligned} 并且对所有满足 1i701 \le i \le 70iikk 都整除 nin_i。求 nik\frac{n_i}{k}1i701 \le i \le 70 时的最大值。

Given a real number x,x, let x\lfloor x \rfloor denote the greatest integer less than or equal to x.x. For a certain integer k,k, there are exactly 7070 positive integers n1,n_1, n2,,n_2, \ldots, n70n_{70} such that k=n13=n23==n703 \begin{aligned} k &= \lfloor\sqrt[3]{n_1}\rfloor = \lfloor\sqrt[3]{n_2}\rfloor \\ &= \cdots = \lfloor\sqrt[3]{n_{70}}\rfloor \end{aligned} and kk divides nin_i for all ii such that 1i70.1 \le i \le 70. Find the maximum value of nik\frac{n_i}{k} for 1i70.1 \le i \le 70.

答案:553
知识点:取整函数倍数区间内整数计数
难度评级:2510
解答:

条件 n3=k\lfloor\sqrt[3]{n}\rfloor = k 表示 k3n<(k+1)3k^3 \le n \lt (k+1)^3 =k3+3k2+3k+1= k^3 + 3k^2 + 3k + 1。这个范围内 kk 的倍数为 kk2k \cdot k^2k(k2+1),k(k^2 + 1), \ldotsk(k2+3k+3)k(k^2 + 3k + 3), 所以恰好有 3k+43k + 4 个。

3k+4=703k + 4 = 70,得 k=22k = 22nik\frac{n_i}{k} 的最大值为 k2+3k+3=484+66+3k^2 + 3k + 3 = 484 + 66 + 3 =553= 553

The condition n3=k\lfloor\sqrt[3]{n}\rfloor = k means k3n<(k+1)3k^3 \le n \lt (k+1)^3 =k3+3k2+3k+1.= k^3 + 3k^2 + 3k + 1. The multiples of kk in this range are kk2,k \cdot k^2, k(k2+1),,k(k^2 + 1), \ldots, k(k2+3k+3),k(k^2 + 3k + 3), so there are exactly 3k+43k + 4 of them.

Setting 3k+4=703k + 4 = 70 gives k=22.k = 22. The maximum of nik\frac{n_i}{k} is k2+3k+3=484+66+3k^2 + 3k + 3 = 484 + 66 + 3 =553.= 553.

← 第 6 题#6
完整试卷

其他年份的第 7 题