1990 AIME 第 5 题

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

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

5.

nn 是既为 7575 的倍数又恰有 7575 个正整数因数(包括 11 和它本身)的最小正整数。求 n75\frac{n}{75}

Let nn be the smallest positive integer that is a multiple of 7575 and has exactly 7575 positive integral divisors, including 11 and itself. Find n75.\frac{n}{75}.

答案:432
知识点:因数个数质因数分解最优化
难度评级:2100
小提示:

7575 分解为若干可能的乘积,其中每个因数都比相应的质因数指数大一

Factor 7575 into possible products of numbers one greater than prime exponents

大提示:

指数模式 (4,4,2)(4,4,2) 可以包含所需的因数 33525^2,并把最大的指数分配给最小的质数

The exponent pattern (4,4,2)(4,4,2) can include the required factors 33 and 525^2 while assigning the largest exponents to the smallest primes

解答:

7575 的乘法分拆给出指数模式 (74)(74)(24,2)(24,2)(14,4)(14,4)(4,4,2)(4,4,2)。能被 75=35275=3\cdot5^2 整除的数必须同时含有质因数 3355,所以只含一个质因数的模式不可能。两个质因数模式中的最小候选数分别是 324523^{24}5^2314543^{14}5^4。最小的三质因数候选数为 n=243452n=2^4\cdot3^4\cdot5^2\text{。}它有 (4+1)(4+1)(2+1)=75(4+1)(4+1)(2+1)=75 个因数,而且每个二质因数候选数都更大,因为 32452n=32016>1 \frac{3^{24}5^2}{n}=\frac{3^{20}}{16}\gt1 以及 31454n=3105216>1 \frac{3^{14}5^4}{n}=\frac{3^{10}5^2}{16}\gt1\text{。}因此 n75=243452352=2433=432\frac n{75}=\frac{2^4\cdot3^4\cdot5^2}{3\cdot5^2}=2^4\cdot3^3=432\text{。}

The multiplicative partitions of 7575 give exponent patterns (74),(74), (24,2),(24,2), (14,4),(14,4), and (4,4,2).(4,4,2). A number divisible by 75=35275=3\cdot5^2 needs both primes 33 and 5,5, so the one-prime pattern is impossible. The smallest candidates from the two-prime patterns are 324523^{24}5^2 and 31454,3^{14}5^4, respectively. The smallest three-prime candidate is n=243452.n=2^4\cdot3^4\cdot5^2. It has (4+1)(4+1)(2+1)=75(4+1)(4+1)(2+1)=75 divisors, and each two-prime candidate is larger because 32452n=32016>1 \frac{3^{24}5^2}{n}=\frac{3^{20}}{16}\gt1 and 31454n=3105216>1. \frac{3^{14}5^4}{n}=\frac{3^{10}5^2}{16}\gt1. Therefore n75=243452352=2433=432.\frac n{75}=\frac{2^4\cdot3^4\cdot5^2}{3\cdot5^2}=2^4\cdot3^3=432.

← 第 4 题#4
完整试卷

其他年份的第 5 题