Skip to main content
OlympiadHQ

Browse · MATH

Print

jmc

counting and probability senior

Problem

Let be the set of positive integer divisors of Three numbers are chosen independently and at random with replacement from the set and labeled and in the order they are chosen. The probability that both divides and divides is where and are relatively prime positive integers. Find
Solution
First, prime factorize as . Denote as , as , and as . In order for to divide , and for to divide , , and . We will consider each case separately. Note that the total amount of possibilities is , as there are choices for each factor. We notice that if we add to and to , then we can reach the stronger inequality . Therefore, if we pick integers from to , they will correspond to a unique solution, forming a 1-1 correspondence between the numbers , , and . This is also equivalent to applying stars and bars on distributing the powers of 2 and 5 through differences. The amount of solutions to this inequality is . The case for ,, and proceeds similarly for a result of . Therefore, the probability of choosing three such factors isSimplification gives , and therefore the answer is .
Final answer
77