Find the number of unordered pairs of positive integers such that the product of these two positive integers is 15120 and their highest common factor is 6.
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.
Since 1 5 1 2 0 = 2 4 × 3 3 × 5 × 7 , to have positive integers x , y such that x y = 1 5 1 2 0 and gcf ( x , y ) = 6 we will require that x = 6 m and y = 6 n for positive integers m , n such that m n = 4 2 0 = 2 2 × 3 × 5 × 7 and gcf ( m , n ) = 1 . To ensure that m , n are relatively prime, we must assign each of 2 2 , 3 , 5 and 7 to the factorizations of one or the other of m , n , (and thus in turn to x , y ). This creates a total of 2 4 = 1 6 ordered pairs that satisfy the given conditions, but since we are asked for the number of unordered pairs we need to divide by 2 to end up with an answer of 8 .
The 8 unordered pairs are ( 6 , 2 5 2 0 ) , ( 1 8 , 8 4 0 ) , ( 2 4 , 6 3 0 ) , ( 3 0 , 5 0 4 ) , ( 4 2 , 3 6 0 ) , ( 7 2 , 2 1 0 ) , ( 9 0 , 1 6 8 ) and ( 1 2 0 , 1 2 6 ) .