2019 AMC 12A 第 24 题

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

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

24.

在 11 到 5050 之间(含端点),有多少个整数 nn 使得 (n2−1)!(n!)n \dfrac{(n^2 - 1)!}{(n!)^n} 是整数?(规定 0!=10! = 1。)
For how many integers nn between 11 and 50,50, inclusive, is (n2−1)!(n!)n \dfrac{(n^2 - 1)!}{(n!)^n} an integer? (Recall that 0!=1.0! = 1.)
3131
3232
3333
3434
3535
答案:D
知识点:勒让德公式质数数字
小提示:
用 vp(m!)=m−sp(m)p−1v_p(m!) = \dfrac{m - s_p(m)}{p - 1} 比较分子和分母中素数 pp 的指数
Compare the exponent of a prime pp in numerator and denominator using vp(m!)=m−sp(m)p−1v_p(m!) = \dfrac{m - s_p(m)}{p - 1}
大提示:
失败要求 nn 是素数幂 pap^a,且 pa−1<2a(p−1)p^a - 1 \lt 2a(p - 1)
Failure requires nn to be a prime power pap^a with pa−1<2a(p−1)p^a - 1 \lt 2a(p - 1)
解答:
固定一个质数 p≤np\le n。由勒让德公式,分子中 pp 的指数减去分母中该质数的指数为 Dp=∑k≥1⌊n2−1pk⌋−n∑k≥1⌊npk⌋。 \begin{aligned} D_p &=\sum_{k\ge1}\left\lfloor\dfrac{n^2-1}{p^k}\right\rfloor\\ &\quad-n\sum_{k\ge1}\left\lfloor\dfrac{n}{p^k}\right\rfloor \end{aligned}\text{。}若 rkr_k 是 nn 除以 pkp^k 的余数,则第 kk 个加项为 ⌊nrk−1pk⌋\left\lfloor\dfrac{nr_k-1}{p^k}\right\rfloor。
令 a=vp(n)a=v_p(n)。前 aa 个加项都是 −1-1。如果 nn 不是 pp 的幂,写成 n=pamn=p^a m,其中 m≥2m\ge2。当 a≥1a\ge1 时,下一个加项至少为 np−1≥a\dfrac{n}{p}-1\ge a,其后各项都非负;当 a=0a=0 时,所有加项本来就非负。因此除非 nn 是 pp 的幂,否则 Dp≥0D_p\ge0。
当 n=pan=p^a 时,勒让德公式将条件化为 pa−1≥2a(p−1)p^a-1\ge2a(p-1)。在不超过 5050 的质数幂中,这个条件恰好在 a=1a=1(即 nn 为质数)以及 n=22=4n=2^2=4 时失败。不超过 5050 的质数共有 1515 个,再加上 n=4n=4,共 1616 个失败值。因此有 50−16=3450 - 16 = 34 个 nn 满足条件。
因此,正确答案是 D。
Fix a prime p≤n.p\le n. By Legendre’s formula, the difference between the exponent of pp in the numerator and its exponent in the denominator is Dp=∑k≥1⌊n2−1pk⌋−n∑k≥1⌊npk⌋. \begin{aligned} D_p &=\sum_{k\ge1}\left\lfloor\dfrac{n^2-1}{p^k}\right\rfloor\\ &\quad-n\sum_{k\ge1}\left\lfloor\dfrac{n}{p^k}\right\rfloor. \end{aligned} If rkr_k is the remainder of nn modulo pk,p^k, the kkth summand is ⌊nrk−1pk⌋.\left\lfloor\dfrac{nr_k-1}{p^k}\right\rfloor.
Let a=vp(n).a=v_p(n). The first aa summands are −1.-1. If nn is not a power of p,p, write n=pamn=p^a m with m≥2.m\ge2. When a≥1,a\ge1, the next summand is at least np−1≥a,\dfrac{n}{p}-1\ge a, and all later summands are nonnegative; when a=0,a=0, every summand is already nonnegative. Thus Dp≥0D_p\ge0 unless nn is a power of p.p.
For n=pa,n=p^a, Legendre’s formula reduces the requirement to pa−1≥2a(p−1).p^a-1\ge2a(p-1). Among prime powers at most 50,50, this fails exactly when a=1a=1 (so nn is prime) and when n=22=4.n=2^2=4. There are 1515 primes at most 50,50, plus n=4,n=4, giving 1616 failures. Hence 50−16=3450 - 16 = 34 values of nn work.
Thus, the correct answer is D.
LIVE by Po-Shen Loh
LIVE项目

LIVE直播课程

Self-Paced录播课程

启明星Star计划

奖学金项目

关于我们

罗博深是谁?

邮件联系

订阅英文简报

加入我们

申请明星导师

For a more Thought Full world.

© 2026 Expii, Inc.