Question

A pair of integers (m,n) satisfy m x n =gcd(m,n)+lcm(m,n) then m+n​

Answer 1

Answer:

The other pair of Being 0+0

Step-by-step explanation:

The answer is 1 or 2

One obvious pair is 2 and 2, 2×2=4

The other pair being 0 and 0, 0+0 = 0×0=0

Answer 2

Given : A pair of integers (m, n) satisfy m x n= gcd (m, n)+ lcm (m, n)  

To Find :   m+n

Solution:

m x n= gcd (m, n)+ lcm (m, n)  

also we know that

m x n= gcd (m, n) *  lcm (m, n)  

gcd (m, n) + lcm (m, n)   = gcd (m, n)  *  lcm (m, n)

where lcm (m, n) = k .  gcd (m, n)

=> gcd (m, n) +  k .  gcd (m, n)   = gcd (m, n)  *  k .  gcd (m, n)

=> gcd (m, n) ( k + 1)  = gcd (m, n)  k .  gcd (m, n)

=>  ( k + 1)  =  gcd (m, n)  k

=>   1 +  1/k  = gcd (m, n)

as gcd (m, n) is integer hence k  must be 1  

so   lcm (m, n) =      gcd (m, n)

this is only possible when   m =  n

=>    lcm (m, n) =      gcd (m, n)   = m

=> m²  =  m  +  m

=> m² = 2m

=>   m  = 2

Hence pair of integers   ( 2 , 2)

where

m x n= gcd (m, n)+ lcm (m, n)  

2 * 2  =  2  +  2

=> 4 = 4

Learn More:

Find LCM and HCF of the following pairs of integers and verify that ...

brainly.in/question/17387230

Can 12 and 98 be HCF and LCM of two numbers​ - Brainly.in

brainly.in/question/17564109