Bunuel wrote:
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\)?
(A) 30
(B) 31
(C) 32
(D) 33
(E) 34
Since 7 is not divisible by 11, x must have a factor of 11, and likewise, since 11 is not divisible by 7, y must have a factor of 7. However, if y has a factor of 7, then the right hand side of the equation will have (at least) 13 factors of 7. Therefore, x must have (at least) a factor of 7. Similarly, if x has a factor of 11, then the left hand side of the equation will have (at least) 5 factors of 11. Therefore, y must have (at least) a factor of 11.
Therefore, we can let x = 11^c * 7^d (in order words, we are letting a = 11 and b = 7) and y = 11^s * 7^t. Now let’s substitute them into the equation 7x^5 = 11y^13:
7(11^c * 7^d)^5 = 11(11^s * 7^t)^13
11^(5c) * 7^(5d + 1) = 11^(13s + 1) * 7^(13t)
So we must have:
5c = 13s + 1 and 5d + 1 = 13t
Since we want the minimum possible value of x, we want positive integers c and d to be as small as possible, and hence positive integers s and t to be a small as possible. We see that the smallest positive integer value for s is 3, and in that case c will be 8, and the smallest positive integer value for t is 2, and in that case d will be 5.
Therefore, x = 11^8 * 7^5 and 11 + 7 + 8 + 5 = 31.
Answer: B
_________________
See why Target Test Prep is the top rated GMAT course on GMAT Club. Read Our Reviews