More GCD and LCM

How many different, unordered pairs of natural numbers { a , b } \{a,b\} exist such that { gcd ( a , b ) = 20 ; lcm ( a , b ) = 2400 ? \begin{cases} \text{gcd}(a,b) = 20; \\ \text{lcm}(a,b) = 2400? \end{cases}


The answer is 4.

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.

3 solutions

Arjen Vreugdenhil
Jan 29, 2019

The four \text{four} pairs are: { 20 , 2400 } ; { 60 , 800 } ; { 100 , 480 } ; { 160 , 300 } . \{20,2400\};\ \{60,800\};\ \{100,480\};\ \{160,300\}.


To see this, consider the prime content of the two numbers a , b a, b . We have a = 2 a 2 3 a 3 5 a 5 , b = 2 b 2 3 b 3 5 b 5 ; a = 2^{a_2}\cdot 3^{a_3}\cdot 5^{a_5},\ \ \ b = 2^{b_2}\cdot 3^{b_3}\cdot 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 ) . \text{gcd}(a,b) = 2^{\text{min}(a_2,b_2)}\cdot 3^{\text{min}(a_3,b_3)}\cdot 5^{\text{min}(a_5,b_5)} \\ \text{lcm}(a,b) = 2^{\text{max}(a_2,b_2)}\cdot 3^{\text{max}(a_3,b_3)}\cdot 5^{\text{max}(a_5,b_5)}. With the given numbers, gcd ( a , b ) = 20 = 2 2 3 0 5 1 lcm ( a , b ) = 2400 = 2 5 3 1 5 2 \begin{aligned} \text{gcd}(a,b) & = 20 = 2^2\cdot 3^0 \cdot 5^1 \\ \text{lcm}(a,b) & = 2400 = 2^5\cdot 3^1 \cdot 5^2 \end{aligned} so that min ( a 2 , b 2 ) = 2 max ( a 2 , b 2 ) = 5 min ( a 3 , b 3 ) = 0 max ( a 3 , b 3 ) = 1 min ( a 5 , b 5 ) = 1 max ( a 3 , b 3 ) = 2 \begin{aligned} \text{min}(a_2,b_2) & = 2 & \text{max}(a_2,b_2) & = 5 \\ \text{min}(a_3,b_3) & = 0 & \text{max}(a_3,b_3) & = 1 \\ \text{min}(a_5,b_5) & = 1 & \text{max}(a_3,b_3) & = 2 \end{aligned} Each of the numbers a , b 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 = 20 and 2 5 3 1 5 2 = 2400 2 2 3 0 5 2 = 100 and 2 5 3 1 5 1 = 480 2 2 3 1 5 1 = 60 and 2 5 3 0 5 2 = 800 2 2 3 1 5 2 = 300 and 2 5 3 0 5 1 = 160 \begin{aligned} 2^2\cdot 3^0 \cdot 5^1 = 20 &\ \text{and}\ \ 2^5 \cdot 3^1\cdot 5^2 = 2400 \\ 2^2\cdot 3^0 \cdot 5^2 = 100 &\ \text{and}\ \ 2^5 \cdot 3^1\cdot 5^1 = 480 \\ 2^2\cdot 3^1 \cdot 5^1 = 60 &\ \text{and}\ \ 2^5 \cdot 3^0\cdot 5^2 = 800 \\ 2^2\cdot 3^1 \cdot 5^2 = 300 &\ \text{and}\ \ 2^5 \cdot 3^0\cdot 5^1 = 160 \end{aligned}


In general, if the GCD and LCM of two numbers are given, the answer to this kind of problem is simply 2 Π ( LCM GCD ) 1 , 2^{\Pi\left(\frac{\text{LCM}}{\text{GCD}}\right)-1}, where Π ( x ) \Pi(x) is the number of different prime factors in x x . In this case, it is 2 Π ( 2400 / 20 ) 1 = 2 Π ( 120 ) 1 = 2 3 1 = 4 . 2^{\Pi(2400/20)-1} = 2^{\Pi(120)-1} = 2^{3-1} = \boxed{4}.

Well explained!!

Siddharth Chatterjee - 2 years, 4 months ago
Chris Lewis
Feb 1, 2019

Since gcd ( a , b ) = 20 \gcd(a,b)=20 , we can write a = 20 a a=20a' and b = 20 b b=20b' , where gcd ( a , b ) = 1 \gcd(a',b')=1 .

We have lcm ( a , b ) = 20 a b = 2400 \text{lcm}(a,b)=20a'b'=2400 , so that a b = 120 = 2 3 3 5 a'b'=120=2^3 \cdot 3 \cdot 5 .

Since gcd ( a , b ) = 1 \gcd(a',b')=1 , each of the prime factors 2 , 3 , 5 2,3,5 appears in exactly one of a , b a',b' . To count the unordered pairs satisfying this, we can without loss of generality say that a a' has fewer prime factors than b b' .

There is 1 1 way a a' can have zero prime factors ( a = 1 a'=1 ) and 3 3 ways a a' can have one prime factor ( a { 2 3 , 3 , 5 } a' \in \{2^3,3,5 \} ), for a total of 4 \boxed4 unordered pairs.

This technique is often helpful in number theory: Given two numbers a , b a,b , write them as a u a'u and b u b'u , where u u is the gcd. Then solve the problem with a , b a',b' , which you now know to be coprime.

Arjen Vreugdenhil - 2 years, 4 months ago

120 = 2 3 3 5 120 = 2^3 \cdot 3 \cdot 5

Aditya Dutt - 2 years, 3 months ago

Yes it does, thank you! (Corrected)

Chris Lewis - 2 years, 3 months ago
K T
Jul 16, 2019

Because gcd ( a , b ) = 20 \gcd(a,b)=20 we can write a = 20 x a=20x and b = 20 y b=20y , where x and y are coprime integers.

So, lcm ( a , b ) = 20 lcm ( x , y ) = 20 x y \text{lcm}(a,b)=20 \text{ lcm}(x,y) =20xy , so that we know that the product x y = 120 xy=120 . 120 = 2 3 × 3 × 5 120=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 2^3 ordered pairs, and 2 3 / 2 = 4 2^3/2=\boxed{4} unordered pairs.

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...