/

AMC12 2003 B

AMC12 2003 B · Q18

AMC12 2003 B · Q18. It mainly tests Primes & prime factorization.

Let $x$ and $y$ be positive integers such that $7x^5 = 11y^{13}.$ The minimum possible value of $x$ has a prime factorization $a^cb^d.$ What is $a + b + c + d?$
设 $x$ 和 $y$ 为正整数,满足 $7x^5 = 11y^{13}$。$x$ 的最小可能值的质因数分解为 $a^cb^d$。求 $a + b + c + d$?
(A) 30 30
(B) 31 31
(C) 32 32
(D) 33 33
(E) 34 34
Answer
Correct choice: (B)
正确答案:(B)
Solution
Substitute $a^cb^d$ into $x$. We then have $7(a^{5c}b^{5d}) = 11y^{13}$. Divide both sides by $7$, and it follows that: \[(a^{5c}b^{5d}) = \frac{11y^{13}}{7}.\] Note that because $11$ and $7$ are prime, the minimum value of $x$ must involve factors of $7$ and $11$ only. Thus, we try to look for the lowest power $p$ of $11$ such that $13p + 1 \equiv 0 \pmod{5}$, so that we can take $11^{13p + 1}$ to the fifth root. Similarly, we want to look for the lowest power $n$ of $7$ such that $13n - 1 \equiv 0 \pmod{5}$. Again, this allows us to take the fifth root of $7^{13n - 1}$. Obviously, we want to add $1$ to $13p$ and subtract $1$ from $13n$ because $11^{13p}$ and $7^{13n}$ are multiplied by $11$ and divided by $7$, respectively. With these conditions satisfied, we can simply multiply $11^{p}$ and $7^{n}$ and substitute this quantity into $y$ to attain our answer. We can simply look for suitable values for $p$ and $n$. We find that the lowest $p$, in this case, would be $3$ because $13(3) + 1 \equiv 0 \pmod{5}$. Moreover, the lowest $q$ should be $2$ because $13(2) - 1 \equiv 0 \pmod{5}$. Hence, we can substitute the quantity $11^{3} \cdot 7^{2}$ into $y$. Doing so gets us: \[(a^{5c}b^{5d}) = \frac{11(11^{3} \cdot 7^{2})^{13}}{7} = 11^{40} \cdot 7^{25}.\] Taking the fifth root of both sides, we are left with $a^cb^d = 11^{8} \cdot 7^{5}$. $a + b + c + d = 11 + 7 + 8 + 5 = \boxed{\textbf{(B)}\ 31}$
将 $a^cb^d$ 代入 $x$。则有 $7(a^{5c}b^{5d}) = 11y^{13}$。两边同除以 $7$,得到: \[(a^{5c}b^{5d}) = \frac{11y^{13}}{7}.\] 注意到 $11$ 和 $7$ 都是质数,$x$ 的最小值必须只包含 $7$ 和 $11$ 这两个因子。因此,我们寻找 $11$ 的最小幂 $p$,使得 $13p + 1 \equiv 0 \pmod{5}$,从而可以对 $11^{13p + 1}$ 开五次方根。同理,我们寻找 $7$ 的最小幂 $n$,使得 $13n - 1 \equiv 0 \pmod{5}$,从而可以对 $7^{13n - 1}$ 开五次方根。显然,我们要对 $13p$ 加 $1$、对 $13n$ 减 $1$,因为 $11^{13p}$ 与 $7^{13n}$ 分别要乘以 $11$、除以 $7$。满足这些条件后,我们只需将 $11^{p}$ 与 $7^{n}$ 相乘并代入 $y$,即可得到答案。 直接寻找合适的 $p$ 与 $n$。可得此时最小的 $p$ 为 $3$,因为 $13(3) + 1 \equiv 0 \pmod{5}$。并且最小的 $q$ 应为 $2$,因为 $13(2) - 1 \equiv 0 \pmod{5}$。因此,可将 $11^{3} \cdot 7^{2}$ 代入 $y$。于是 \[(a^{5c}b^{5d}) = \frac{11(11^{3} \cdot 7^{2})^{13}}{7} = 11^{40} \cdot 7^{25}.\] 两边开五次方根,得到 $a^cb^d = 11^{8} \cdot 7^{5}$。因此 $a + b + c + d = 11 + 7 + 8 + 5 = \boxed{\textbf{(B)}\ 31}$
Topics
Related Questions
Practice full AMC exams on amcdrill.
Try full-length practice and diagnostics at www.amcdrill.com.