AMC 8 2026 Problem 24
AMC8 2026 年第 24 题
整除与因数★★★★☆
The notation n! (read " factorial") is defined as the product of the first positive integers. (For example, .) Define the superfactorial of a positive number, denoted by , to be the product of the first factorials. (For example, .) How many factors of 7 appear in the prime factorization of , the superfactorial of 51?
记号 n!(读作" 阶乘")定义为前 个正整数的乘积(例如 )。定义超阶乘 为前 个阶乘的乘积(例如 )。在 的质因数分解中,因子 7 出现了多少次?
- A.147
- B.150
- C.156
- D.168
- E.171
正确答案 · Correct Answer
E
解析 · Solution
解法1
常规解法·数每个数在超阶乘里被乘了几遍
。第一步换个角度看这个大乘积:整数 出现在哪些阶乘里?只有编号 的阶乘()才含有 ,共 52-k 个。所以在 里,每个整数 被乘了 52-k 遍。
因子 7 只能来自 7 的倍数,逐个数:
7 被乘 52-7=45 遍,每遍给 1 个 7;14:52-14=38 遍;21:31 遍;28:24 遍;35:17 遍;42:10 遍;:被乘 52-49=3 遍,但每遍给 2 个 7,贡献 3×2=6。
合计 45+38+31+24+17+10+6=171,选 E。
考场速算:把 49 的贡献拆成「第一份 3+第二份 3」,前一半 45、38、31、24、17、10、3 是公差 -7 的等差数列,和 ;再补上 49 作为 的第二份 3,得 171。
易错提醒:干扰项 D =168 正是「把 49 只当一个 7」的结果——等差求和收工前记得补那 3 个;这类题几乎必埋「恰好差一项」的干扰项。
巧解·按「每个阶乘含几个 7」分组竖着数
换个方向:先问单个阶乘 k! 含几个 7——等于 里 7 的倍数个数,到 再额外多 1 个()。按 7 个一组竖排:
(7 个阶乘):各含 1 个 → 7×1=7
:各含 2 个 → 14;:21;:28;:35;:42
(只有 3 个):49 额外多给 1 个,各含 7+1=8 个 → 3×8=24
总计 7+14+21+28+35+42+24=171。草稿纸上按 7 个一组竖排数,不容易漏项——干扰项 A =147 正是把最后一组 整个漏掉的结果()。
前置(等差数列求和):和=(首项+末项)×项数÷2;阶乘 ,题面已给。
Solution 1
*(Elementary — count how many times each integer gets multiplied in.)*
. First re-view the big product: which factorials contain the integer ? Only those with index — namely , that is 52-k of them. So inside , each integer is multiplied in 52-k times.
Factors of 7 come only from multiples of 7. Count them:
7 appears 52-7=45 times, one factor of 7 each; 14: 52-14=38; 21: 31; 28: 24; 35: 17; 42: 10; : appears 52-49=3 times but gives TWO factors each, contributing 3×2=6.
Total 45+38+31+24+17+10+6=171, choice E.
Exam shortcut: split 49's contribution into "first 3 + second 3." The first parts 45, 38, 31, 24, 17, 10, 3 form an arithmetic sequence with difference -7: sum ; then add 49's second 3 as a to get 171.
Watch out: trap choice D =168 is exactly "treating 49 as a single 7" — after the arithmetic-series shortcut, remember to add those 3; problems like this almost always plant an "off by one term" trap.
*(Slick — group vertically by how many 7s each factorial holds.)*
Flip the direction: a single factorial k! contains as many 7s as there are multiples of 7 up to , plus 1 extra from once . Group in sevens:
(7 factorials): 1 each → 7×1=7
: 2 each → 14; : 21; : 28; : 35; : 42
(only 3): the extra 7 from 49 makes 7+1=8 each → 3×8=24
Total 7+14+21+28+35+42+24=171. Column-grouping on scratch paper makes terms hard to miss — trap choice A =147 is precisely the last group dropped entirely ().
Prerequisite (arithmetic series): sum ; and , as the problem states.
继续练习