The first three terms of a geometric sequence are the integers , , and , where . What is the sum of the digits of the least possible value of ?
Pick one
Solution
The prime factorization of is . Let be the common ratio of the geometric sequence, where and are relatively prime positive integers. If had any prime factor greater than , then would not be an integer. Analogously, if had any prime factor greater than , then would not be an integer. It follows that , where , and are (not necessarily positive) integers. Furthermore, , , and .
To minimize the value of , it suffices to minimize the value of . Taking yields the sequence , , . To check that no lesser values of exist, first observe that is not a possible value for , so both and are greater than . This means that and must borrow at least two prime factors each from , but has only three distinct prime factors, so this is impossible. It follows that the least possible value of is , and the requested sum of digits is .