Calvin takes the simplest form of any rational number and multiplies its numerator and denominator. Denote as the number of rational numbers such that Calvin outputs a product of . Find .
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Notice how the numerator and denominator have to be relatively prime. This means that one type of prime must be either included on the top or the bottom, but not both.
5 0 ! has 1 5 distinct prime factors: 2 , 3 , 5 , 7 , 1 1 , 1 3 , 1 7 , 1 9 , 2 3 , 2 9 , 3 1 , 3 7 , 4 1 , 4 3 , 4 7 . Each of these factors can go to two places, yielding 2 1 5 possibilities.
However, we want the number to be less than 1 , and the possibilities we have can be paired with their reciprocal where only one is greater than one and the other is less than one. Therefore, we need to divide by two, which yields a number of 2 1 4 . Taking l o g 2 , we find that the answer is 1 4 .