Carcass wrote:
What is the greatest possible common divisor of two different positive integers which are less than 144?
A. 143
B. 142
C. 72
D. 71
E. 12
The key word here is
differentIf the two numbers were allowed to be the same, then we could use 143 and 143, in which case, the GCD = 143
However, since the two numbers must be DIFFERENT, then we might first try to do something with 143 and some other number.
Since 143 = (11)(13), we can see that, in order to MAXIMIZE the GCD of the two numbers, the other number must be 13
So, 143 and 13 have a GCD of 13
Now let's try 142 and some other number.
Since 142 = (2)(71), we can see that, in order to MAXIMIZE the GCD of the two numbers, the other number must be 71
So, 142 and 71 have a GCD of 71
Following this logic, we can see that 142 and 71 will MAXIMIZE the GCD of the 2 numbers.
So, the correct answer is D