What positive integer, x , satisfies these equations?
gcd
(
3
9
1
,
x
)
=
2
3
lcm
(
3
9
1
,
x
)
=
7
4
2
9
Note: gcd and lcm denote the greatest common divisor and lowest common multiple respectively.
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.
Correction: If you're stating for all integers a , b , it should be ∣ a × b ∣ in RHS of the identity you stated so that even the negative integers a , b are accounted for.
Advice: It'd be better if you posted a proof of this too. Hint: Fundamental Theorem of Arithmetic and definition of GCD and LCM.
Would this count as a proof?
Since we know the GCD of 391 and x is 23, then x = 2 3 n (a multiple of 23).
Since the LCM of 391 and 2 3 n is 7429, dividing 7429 by 391 would give us our n value ( n = 1 9 ) . Then we multiply 23 by n to get ( 2 3 ) ( 1 9 ) = 4 3 7 .
Log in to reply
Well, Yes. It will count as a proof according to me. But, @Prasun Biswas will have the final Say! :D
That's a nice way to get the answer. For clarity, you should mention that we have n such that g cd ( n , 2 3 3 9 1 ) = 1 . The rest of your method is trivial.
Anyway, this is not a general proof. This only solves the posed problem. It doesn't prove the general identity. By proof, I meant a proof of the identity Mehul stated, which generalizes the problem for all integers a , b .
Log in to reply
How about this?
G C F ( a , b ) = n
L C M ( a , b ) = x
Therefore b = m n because b must be a multiple of n , and m would be the other factor, and a = n t , where t would be the other factor.
The LCM of the two integers must have these 3 integers as its factors: n , m , and t . When we multiply the two integers, we get m n 2 t . Now, I never that n 2 had to be a factor, so we can divide the previously stated expression by n to get m n t = a m . The reason for doing this is that we have an unnecessary factor, and there is still one of that factor left, so the two integers would still have it as their multiple. Therefore, a m = x , and when we multiply both sides by n, we get a m n = n x , or a b = n x , thus proving that G C F ( a , b ) × L C M ( a , b ) = a × b .
We are given:
g c d ( 3 9 1 , x ) = 2 3 l c m ( 3 9 1 , x ) = 7 4 2 9
From the lcm we have: 3 9 1 7 4 2 9 = 1 9
What to notice:
The following properties are vital:
Basically: the least and greatest common multiple/divisor are both prime numbers, so x must be the product of these prime numbers, so 2 3 ∗ 1 9 = 4 3 7 .
Note that
g c d ( M , N ) × l c m ( M , N ) = M × N
Hence,
2 3 ( 7 4 2 9 ) = 3 9 1 x
x = 4 3 7
Question:
G C D [ 3 9 1 , x ] = 2 3
L C M [ 3 9 1 , x ] = 7 4 2 9
Convert LCM into an equation using GCD.
G C D [ 3 9 1 , x ] 3 9 1 x = 7 4 2 9
Substitute G C D [ 3 9 1 , x ] for 23. Note that 3 9 1 = 1 7 × 2 3 and 7 4 2 9 = 1 7 × 1 9 × 2 3 .
2 3 3 9 1 x = 7 4 2 9
x = 4 3 7
L C M ( a , b ) × G C D ( a , b ) = a b
7 4 2 9 × 2 3 = 3 9 1 × x
3 9 1 7 4 2 9 × 2 3 = x
1 9 × 2 3 = 4 3 7
So, x is 437
Why? When typing a solution, try to put yourself in the shoes of other people and see whether they can understand your solution.
GCD X LCM = PRODUCT OF THE 2 INTEGERS HENCE. 391 x X = 23 x 7429 hence x = 23 x 7429 / 391 x = 437
You can check out the Fundamental Theorem of arithmetic for More Details to the Concept of HCF,LCM and relation to the Numbers
For two numbers a and b, Lcm x Hcf = a x b There's a formula for 3, 4 and in general n numbers.
Problem Loading...
Note Loading...
Set Loading...
We know that For Integers a , b ,
L C M ( a , b ) × H C F ( a , b ) = ∣ a × b ∣
Plugging in Values, We get, 3 9 1 7 4 2 9 × 2 3 = x
Hence, The answer is 437 ⌣ ¨