For two positive integers and , their greatest common divisor is and their least common multiple is . If , is not divisible by , and is not divisible by , what is the value of ?
- A732
- B972
- 1,308Answer
- D1,356
- E1,500
Answer
The sum of the two integers is .
By prime factorizing the given GCD () and LCM (), the minimum and maximum exponents for each prime factor are determined. The constraint that is not divisible by forces the exponent of in to be , so the exponent of in must be . The constraint that is not divisible by forces the exponent of in to be , so the exponent of in must be . Finally, the condition requires the exponent of in to be and in to be . Thus, and , giving .
Step-by-Step Solution
Key Concept
Prime factor exponent min/max rules for GCD and LCM: takes the minimum exponent of each prime factor, while takes the maximum exponent.
Estimated Time:2m 30s