1995 AHSME Problems/Problem 29
Problem
For how many three-element sets of distinct positive integers is it true that ?
Solution 1
Solution 2
. We wish to figure out the number of ways to distribute these prime factors amongst 3 different integers, without over counting triples which are simply permutations of one another.
We can account for permutations by assuming WLOG that contains the prime factor 2. Thus, there are ways to position the other 4 prime numbers. Note that, with the exception of when all of the prime factors belong to , we have over counted each case twice, as for when we put certain prime factors into and the rest into , we count the exact same case when we put those prime factors which were in into .
Thus, our total number of cases is
Solution 3
The prime factorization of is Therefore, we have the equation where must be distinct positive integers and order does not matter. There are ways to assign each prime number on the right-hand side to one of the variables which gives solutions for However, three of these solutions have two s and one which contradicts the fact that must be distinct. Because each prime factor appears only once, all other solutions have distinct. Correcting for this, we get ordered triples where are all distinct.
Finally, since order does not matter, we must divide by the number of ways to order This gives the final answer,
See also
1995 AHSME (Problems • Answer Key • Resources) | ||
Preceded by Problem 28 |
Followed by Problem 30 | |
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 • 16 • 17 • 18 • 19 • 20 • 21 • 22 • 23 • 24 • 25 • 26 • 27 • 28 • 29 • 30 | ||
All AHSME Problems and Solutions |
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.