Find the number of unordered pairs of positive integers such that
Notation: denotes the lowest common multiple function.
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.
First factorize 3 3 7 5 0 0 = 2 2 × 3 3 × 5 5
Now consider two numbers a , b in the following way
l c m ( 5 a 1 × 3 b 1 × 2 c 1 , 5 a 2 × 3 b 2 × 2 c 2 ) = 3 3 7 5 0 0
To maintain the lcm these two numbers must contain the full powers of each 2 , 3 , 5 .Therefore, any three of a 1 , b 1 . c ! , a 2 , b 2 , c 2 will equal to 2 , 3 , 5 .So , performing this categorization there can be three possibilities as follows
l c m ( 5 5 × 3 3 × 2 c 1 , 5 a 2 × 3 b 2 × 2 2 ) = 3 3 7 5 0 0
l c m ( 5 5 × 3 3 × 2 2 , 5 a 2 × 3 3 × 2 2 ) = 3 3 7 5 0 0
l c m ( 5 5 × 3 3 × 2 2 , 5 5 × 3 b 2 × 2 2 ) = 3 3 7 5 0 0
In each case there are three variables which can vary in ( 2 + 1 ) × ( 3 + 1 ) × ( 5 + 1 ) = 7 2 ways.But there are some common numbers are there Consider first two cases from above.Put a 2 = 5 and consider b 1 = b 2 and c 1 = c 2 at the same time.Then we can find (3 \times 4=12) same numbers just they are in different orders.As it is in the question that only unordered pairs are allowed so 1 2 numbers should be subtracted.In this way fixing other two variables we can get 3 × 6 = 1 8 and 4 × 6 = 2 4 .So, total extra numbers are 1 8 + 1 2 + 2 4 = 5 4 .So, allowed cases are 3 × 7 2 − 5 4 = 1 6 2
Now another case is a 1 = 5 , b 1 = 3 , c 1 = 2 and other three will vary.Then there will be 2 × 3 × 5 = 3 0 pairs.
Again last pair is ( 1 , 3 3 7 5 0 0 ) .
So, total number of pairs are = 1 6 2 + 3 0 + 1 = 1 9 3