I really liked this one because it can be solved using just logic, so I will spare you of any algebra

We have:
The
greatest possible common divisor of
two different positive integers, each
less than 213,
neither of them
even, is:
I've marked a few words as they're key to finding the answer.
We need to find the greatest common divisor - or common factor - of two unique positive integers. Each is less than 213 - so the largest of these numbers can be 212, but even that isn't the case, because none of the numbers can be even.
Now, this clearly means, if it's two odd numbers we are dealing with that have a large-ish common divisor, we need to find the smallest number that'll divide them together into an integer. An odd number will never divide by 2, so 3 is the next one, so we'll look for a multiple to 3 to start with.
Now, here's the thing. Whenever we're looking for factors of an odd number divisible by 3 - for instance, 801 - we'll never have a factor that's anything more than a third of this number (which is 267 in this case).
So, the first thing we realize when we look at the odd numbers less than 213 is, no matter whichever it is, we'll have to go at least a third of that number to find a number with which a large common divisor will be present.
Among the answer choices, you can clearly see that numbers like 209, 207, and 105 won't be common divisors, clearly because 3x of those numbers take things well out of the range.
B, 71, is the trick answer - as 71 is 1/3rd of 213, and we are only allowed positive integers less than 213.
Hence, A is the only possible solution. 69 is the greatest possible common divisor for two numbers under 213 - 207 and 69 itself.Bunuel