Given that where both and are positive integers, find the smallest possible value for .
- A)
- B)
- C)
- D)
- E)
Answer
D
Key insight
The exponent b must divide both 8 and 2, so b is at most 2; b = 2 gives a = 405 and sum 407.
Solution
Write in terms of its prime factorization. Since , the primes of are only and , say , and then and . So divides both and , which forces .
- : , so .
- : , since . Then .
The smaller total is .
The answer is .
Why this works
A number is a perfect -th power exactly when every exponent in its prime factorization is a multiple of , so the possible exponents are the common divisors of those exponents. Here caps at , and a larger always shrinks dramatically, so the largest legal minimizes .
Alternative approach
Answer-choice sanity check: since , is at least , ruling out (A), (B), (C) immediately; beats .
The trap
Trying to make b as large as possible, e.g. b = 8 with a non-integer a, or taking b = 1 and adding the huge base.
Common mistakes
- Trying to make as large as possible, e.g. with a non-integer , or taking and adding the huge base.
- Arithmetic slip in (e.g. ), which makes the sum and matches nothing.
Techniques
Set up the equation/formula and compute; no special trick needed · Consider the largest/smallest element or boundary case