**Quote:**

But I do not understand why 115 was eliminated. Since this number is not divisible by 2 or 3.

So we have 230 and 115 left.

Now, forget about divisibility by 3. We've already used this fact to rule out the other 3-digit divisors of 690.

The question statement tells us "

*m* is not divisible by 2". If

*n* (the number we are looking for) was also not divisible by 2, then the LCM of

*m* and

*n* (690) would not be divisible by 2 as well.

But 690 IS divisible by 2. So n must be divisible by 2.

We rule 115 out because it is NOT divisible by 2.