2004 AMC 10B 第 4 题

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

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

4.

掷一个标准六面骰子,令 PP 为可见的五个面上的数字之积。一定能整除 PP 的最大数是多少?

A standard six-sided die is rolled, and PP is the product of the five numbers that are visible. What is the largest number that is certain to divide P?P?

66

1212

2424

144144

720720

答案:B
知识点:质因数分解整除性极限情形界定
难度评级:1190
解答:

因为 6!=720=243256! = 720 = 2^4 \cdot 3^2 \cdot 5,所以可见乘积只会用到质数 2,32, 355

遮住 44 时剩下的因数 22 最少,为 222^2。遮住 3366 时剩下的因数 33 最少,为一个;遮住 55 时可能没有因数 55

因此 PP 一定能被 223=122^2 \cdot 3 = 12 整除,但不一定能被更大的数整除。

所以正确答案是 B

Since 6!=720=24325,6! = 720 = 2^4 \cdot 3^2 \cdot 5, the visible product uses only the primes 2,3,2, 3, and 5.5.

Hiding 44 leaves the fewest 22's, namely 22.2^2. Hiding 33 or 66 leaves the fewest 33's, namely one. Hiding 55 leaves no factor of 5.5.

Therefore PP is always divisible by 223=12,2^2 \cdot 3 = 12, but not necessarily by any larger number.

Thus, the correct answer is B.

← 第 3 题#3
完整试卷

其他年份的第 4 题