How many different, unordered pairs of natural numbers { a , b } exist such that { gcd ( a , b ) = 2 0 ; lcm ( a , b ) = 2 4 0 0 ?
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.
Well explained!!
Since g cd ( a , b ) = 2 0 , we can write a = 2 0 a ′ and b = 2 0 b ′ , where g cd ( a ′ , b ′ ) = 1 .
We have lcm ( a , b ) = 2 0 a ′ b ′ = 2 4 0 0 , so that a ′ b ′ = 1 2 0 = 2 3 ⋅ 3 ⋅ 5 .
Since g cd ( a ′ , b ′ ) = 1 , each of the prime factors 2 , 3 , 5 appears in exactly one of a ′ , b ′ . To count the unordered pairs satisfying this, we can without loss of generality say that a ′ has fewer prime factors than b ′ .
There is 1 way a ′ can have zero prime factors ( a ′ = 1 ) and 3 ways a ′ can have one prime factor ( a ′ ∈ { 2 3 , 3 , 5 } ), for a total of 4 unordered pairs.
This technique is often helpful in number theory: Given two numbers a , b , write them as a ′ u and b ′ u , where u is the gcd. Then solve the problem with a ′ , b ′ , which you now know to be coprime.
1 2 0 = 2 3 ⋅ 3 ⋅ 5
Yes it does, thank you! (Corrected)
Because g cd ( a , b ) = 2 0 we can write a = 2 0 x and b = 2 0 y , where x and y are coprime integers.
So, lcm ( a , b ) = 2 0 lcm ( x , y ) = 2 0 x y , so that we know that the product x y = 1 2 0 . 1 2 0 = 2 3 × 3 × 5 has 3 different prime factors, and since x and y are coprime, all powers of each prime must be either in x, or in y. so there are 2 3 ordered pairs, and 2 3 / 2 = 4 unordered pairs.
Problem Loading...
Note Loading...
Set Loading...
The four pairs are: { 2 0 , 2 4 0 0 } ; { 6 0 , 8 0 0 } ; { 1 0 0 , 4 8 0 } ; { 1 6 0 , 3 0 0 } .
To see this, consider the prime content of the two numbers a , b . We have a = 2 a 2 ⋅ 3 a 3 ⋅ 5 a 5 , b = 2 b 2 ⋅ 3 b 3 ⋅ 5 b 5 ; (Other prime factors are not involved here.)
Then gcd ( a , b ) = 2 min ( a 2 , b 2 ) ⋅ 3 min ( a 3 , b 3 ) ⋅ 5 min ( a 5 , b 5 ) lcm ( a , b ) = 2 max ( a 2 , b 2 ) ⋅ 3 max ( a 3 , b 3 ) ⋅ 5 max ( a 5 , b 5 ) . With the given numbers, gcd ( a , b ) lcm ( a , b ) = 2 0 = 2 2 ⋅ 3 0 ⋅ 5 1 = 2 4 0 0 = 2 5 ⋅ 3 1 ⋅ 5 2 so that min ( a 2 , b 2 ) min ( a 3 , b 3 ) min ( a 5 , b 5 ) = 2 = 0 = 1 max ( a 2 , b 2 ) max ( a 3 , b 3 ) max ( a 3 , b 3 ) = 5 = 1 = 2 Each of the numbers a , b has either the minimum or the maximum exponent for each of its prime factors; the other number has the precise opposite. This gives four possibilities: 2 2 ⋅ 3 0 ⋅ 5 1 = 2 0 2 2 ⋅ 3 0 ⋅ 5 2 = 1 0 0 2 2 ⋅ 3 1 ⋅ 5 1 = 6 0 2 2 ⋅ 3 1 ⋅ 5 2 = 3 0 0 and 2 5 ⋅ 3 1 ⋅ 5 2 = 2 4 0 0 and 2 5 ⋅ 3 1 ⋅ 5 1 = 4 8 0 and 2 5 ⋅ 3 0 ⋅ 5 2 = 8 0 0 and 2 5 ⋅ 3 0 ⋅ 5 1 = 1 6 0
In general, if the GCD and LCM of two numbers are given, the answer to this kind of problem is simply 2 Π ( GCD LCM ) − 1 , where Π ( x ) is the number of different prime factors in x . In this case, it is 2 Π ( 2 4 0 0 / 2 0 ) − 1 = 2 Π ( 1 2 0 ) − 1 = 2 3 − 1 = 4 .