Option (B) is correct.
Explanation:
Assertion (A) is true. Euclid's observation says that m,n and n,m−n have exactly the same common divisors. So every reduction in Euclid's subtraction algorithm keeps the list of common divisors unchanged, all the way to the final problem gcd(d,0), where d=gcd(m,n). Every number divides 0, so the common divisors of d and 0 are just the divisors of d. Hence the common divisors of m and n are exactly the divisors of the gcd. Since 7 is a common divisor, 7 divides gcd(m,n).
Reason (R) is true. The list common-divisors is in increasing order, so its rightmost entry is the largest common divisor, which is the gcd.
But (R) does not explain (A). (R) only says that the gcd is the largest entry. Being the largest number in a list does not make a number a multiple of the other entries: in the list [1,2,3], 3 is the largest but is not a multiple of 2. That the gcd is a multiple of every common divisor is a different fact, the one proved above.
Why the other options are wrong
- (A) (R) is true but is not the reason. "Largest" does not mean "a multiple of every entry"; the reason is that the common divisors are exactly the divisors of the gcd.
- (C) (R) is true: the algorithm reports the rightmost entry of
common-divisors as the gcd, and that list is in increasing order.
- (D) (A) is true: every common divisor of m and n divides gcd(m,n), so a gcd with 7 in the common list is a multiple of 7.