Problem:
Lucia wants to write three positive integers in such a way that each of them is a divisor of and that the greatest common divisors between two consecutive terms (that is, and ) are prime numbers. In how many ways can she do this?
Problem:
Lucia wants to write three positive integers in such a way that each of them is a divisor of and that the greatest common divisors between two consecutive terms (that is, and ) are prime numbers. In how many ways can she do this?
Pick one
Solution:
The answer is (C). We distinguish several cases, depending on the number of prime factors of :
a. If has 0 prime factors, then , and whatever the value of is, we have , which is not a prime number.
b. If has exactly one prime factor, that is, it is itself prime, then the condition that and be prime means that both must coincide with . The integers can therefore be chosen in any way among the divisors of that are multiples of . It is easy to check that (whatever the value of ) there are 4 choices for and 4 choices for (for example, if , then and can be chosen in the set ). Taking into account that has exactly 3 distinct prime factors (and therefore there are 3 choices for in this case), we have possible choices for the triple .
c. If has exactly 2 prime factors, say , then setting one easily sees that the condition that and be prime numbers is equivalent to the integers belonging to the set . We observe that choosing is equivalent to choosing the prime , so in this case we have 3 choices for and 4 choices for each of and , for a total of possible choices.
d. Finally, if has exactly 3 prime factors, then . Since by hypothesis and divide , we have and , so we must choose both and in the set . We then have choices for the triple .
In total, the number of triples satisfying the desired properties is .