If m and n are distinct positive integers which satisfy
g cd ( m , n ) = 2 0 1 3 ,
what is the value of
g cd ( 1 1 m , 1 1 n ) ?
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.
ITS A VERY GOOD SOLUTION. BRILLIANT !!!
perfect
thanx
As, g c d ( m , n ) = x and g c d ( a m , a n ) = a x Hence for this question, g c d ( 1 1 m , 1 1 n ) = 1 1 2 0 1 3 ⇒ g c d ( 1 1 m , 1 1 n ) = 1 8 3
Good !
I just divided 2013 by 11 which yields to 183. :D
we konw that gcd (m, n) = 2013
then
value of gcd (m/11, n/11) = 2013/11
value of gcd (m/11, n/11) = 183 that is answer.
If m and n are divided by an integer n , we can clearly see and say that their g.c.d is also divided by n .
Given that, g cd ( m , n ) = 2 0 1 3
⟹ g c d ( 1 1 m , 1 1 n ) = 1 1 2 0 1 3 = 1 8 3
gcd of m and n is 2013.. factors of 2013 are 3 11 61. lets consider m and n as 61x11=671 and 3x11=33 note we assumed this nos. by considering the soln we want..there can be other set of nos whose gcd came to be 2013.. thus gcd of 61 and 3 is 183..our final answer..
compare
(m/1,n/1)=2013, while (m/11,n/11) = ?
take a look carefully,
(m/11,n/11)=? are actually 11X smaller than (m/1,n/1)=2013
so,2013 divide by 11 and you will get 183 for (m/11,n/11)
GCD (m, n) = 2013, so m and n can be written in the form 2013(p) and 2013(q), where p and q are numbers less then 2013. Therefore GCD (m/11 , n/11) = GCD (2013/11 p , 2013/11 * q) which is 183 p or 183*q. Since p and q are not coprime the GCD of the two numbers will be 183.
assume gcd(M,N)=Y
form if "M" Exact Division by "X" and "N" Exact Division by "X" then "Y" must Exact Division by "X"
then g c d ( 1 1 m , 1 1 n ) = 1 1 2 0 1 3 = 1 8 3
easy
the equation is saying that gcd(m)= 2013 and gcd(n)=2013 then for gcd(m/11) = 2013/11 =183 and also for gcd(n/11) = 183. and the required answer is 183
Can you explain what you mean by saying "gcd(m)=2013"?
how can u find gcd of a single number ???
Problem Loading...
Note Loading...
Set Loading...
Since g c d ( m , n ) = 2 0 1 3 , we can say that m = 2 0 1 3 a and n = 2 0 1 3 b , where a and b are coprime integers.
Thus, g c d ( 1 1 m , 1 1 n ) = g c d ( 1 1 2 0 1 3 a , 1 1 2 0 1 3 b ) = g c d ( 1 8 3 a , 1 8 3 b )
Since, a and b are coprime integers, g c d ( 1 1 m , 1 1 n ) = g c d ( 1 8 3 a , 1 8 3 b ) = 1 8 3