cesar.rodriguez.blanco wrote:
What is the greatest common divisor of positive integers m and n?
1) m is a prime number
2) 2n=7m
I missed this question. Can m=n?
(1)
you should still find the values that prove this statement insufficient.
if m = 3 (which is prime) and n = 6, then the gcf is 3.
if m = 3 (which is prime) and n = 5, then the gcf is 1.
insufficient.
(2)
if you have a statement like this - number * variable = other number * other variable - then you should recognize it as a RATIO.
to change it into RATIO form, divide by one of the numbers, and divide by the other variable (i.e., the variable that
doesn't have this number as a coefficient).
in the case of this statement, you can divide by 2m on both sides, to give
n/m = 7/2. (you could also divide by 7n, to give m/n = 2/7.)
so, the ratio of n to m is 7:2.
if they're actually 7 and 2, the gcf is 1.
if they're multiples of these numbers, then the gcf is not 1. (for instance, if they're 14 and 4, the gcf is 2.)
insufficient.
--
(together)
if you need a prime, and the ratio is 7 to 2, then the numbers must actually be 7 and 2.
sufficient.