2017 AIME II 第 14 题

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

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

14.

一个 10×10×1010 \times 10 \times 10 的点阵由空间中所有形如 (i,j,k)(i, j, k) 的点组成,其中 iijj, 和 kk 是从 111010,(含端点)的整数。求恰好包含这些点中 88 个点的不同直线数量。

A 10×10×1010 \times 10 \times 10 grid of points consists of all points in space of the form (i,j,k),(i, j, k), where i,i, j,j, and kk are integers between 11 and 10,10, inclusive. Find the number of different lines that contain exactly 88 of these points.

答案:168
知识点:格点立体几何分类讨论对称性
难度评级:3370
解答:

取直线的本原方向向量为 (a,b,c)(a, b, c)。任何非零分量的绝对值若至少为 22,这条线最多只能穿过 55 个点阵点,所以每个分量只能是 00±1\pm 1。平行于坐标轴的直线含有 1010 个点, 不会恰好含有 88 个点。若恰有一个分量为 00,这条线位于 3030 个平行于立方体面的平面之一 (33 种方向,1010 个位置)中;在这个 10×1010 \times 10 网格内,它是斜率为 ±1\pm 1 的对角线,并从中心对角线平移开。对两条主对角线各向两个方向平移 22 都恰好得到 88 个点。 因此每个平面有 44 条这样的线,并且每条只属于这 3030 个平面中的一个: 430=1204 \cdot 30 = 120 条。

否则方向是四个空间对角线方向 (1,±1,±1)(1, \pm 1, \pm 1) 之一(不区分整体反向);由对称性, 只需计数平行于 (1,1,1)(1, 1, 1) 的直线再乘以 44。这样的直线 (d+t, e+t, f+t)(d + t,\ e + t,\ f + t) 与点阵相交于 1010 (max(d,e,f)min(d,e,f))- (\max(d,e,f) - \min(d,e,f)) 个点,因此恰好 88 个点意味着 maxmin=2\max - \min = 2。把基点规范化为 min(d,e,f)=1\min(d, e, f) = 1,需要 (d,e,f)(d, e, f) 的各项在 {1,2,3}\{1, 2, 3\} 中并且同时用到 1133:共有 2788+1=1227 - 8 - 8 + 1 = 12 个,因此每个方向有 1212 条线,总共 412=484 \cdot 12 = 48 条。

总数为 120+48=168120 + 48 = 168

Take a primitive direction vector (a,b,c)(a, b, c) for the line. Any nonzero component of absolute value 22 or more limits the line to at most 55 grid points, so every component is 00 or ±1.\pm 1. Lines parallel to a coordinate axis contain 1010 points, never 8.8. If exactly one component is 0,0, the line lies in one of the 3030 planes parallel to a face of the cube (33 orientations, 1010 positions), and within that 10×1010 \times 10 grid it is a diagonal of slope ±1\pm 1 shifted off center; the shift by 22 in either direction from each of the two main diagonals gives exactly 88 points. That is 44 lines per plane, and each lies in only one of the 3030 planes: 430=1204 \cdot 30 = 120 lines.

Otherwise the direction is one of the four space-diagonal directions (1,±1,±1)(1, \pm 1, \pm 1) up to sign; by symmetry, count lines parallel to (1,1,1)(1, 1, 1) and multiply by 4.4. Such a line (d+t, e+t, f+t)(d + t,\ e + t,\ f + t) meets the grid in 1010 (max(d,e,f)min(d,e,f))- (\max(d,e,f) - \min(d,e,f)) points, so exactly 88 points means maxmin=2.\max - \min = 2. Normalizing the base point so that min(d,e,f)=1,\min(d, e, f) = 1, we need (d,e,f)(d, e, f) with entries in {1,2,3}\{1, 2, 3\} using both 11 and 3:3: there are 2788+1=1227 - 8 - 8 + 1 = 12 of them, hence 1212 lines per direction and 412=484 \cdot 12 = 48 in all.

The total is 120+48=168.120 + 48 = 168.

← 第 13 题#13
完整试卷

其他年份的第 14 题