Hi abhikc3004,You're right that plugging in numbers gets clumsy once the answer choices get large. There
is a one-line algebraic characterization that works no matter how big the numbers get, and IanStewart hinted at it above. Let me make it fully general.
Set it up onceThe smaller integer must be
both odd and a multiple of 5 - so it's an odd multiple of
5, which we can write as
5x where
x is odd.
The two consecutive odd integers are then
5x and
5x + 2, so:
Sum = 5x + (5x + 2) = 10x + 2, with x odd.
The quick testFor any candidate sum S, just solve for x:
x = (S - 2) / 10A sum is possible only if that x comes out as an
odd integer. That single check replaces all the guessing:
- A:
(−8 − 2)/10 = −1 - odd ✓
- B:
(12 − 2)/10 = 1 - odd ✓
- C:
(22 − 2)/10 = 2 -
even ✗- D:
(52 − 2)/10 = 5 - odd ✓
- E:
(252 − 2)/10 = 25 - odd ✓
Only
C fails, and it takes seconds even for the big number
252 - no listing of integers required.
The insight to carry forward: whenever a problem stacks conditions like "odd"
and "multiple of
5," write the number in a form that bakes both in (
5x, x odd), then reduce the whole thing to one algebraic test. That scales to any size.
Quick check to lock it in: which of these could be such a sum -
102 or
152? Run (S-
2)/
10: you get
10 (even, no) and
15 (odd, yes). Same one test, instantly.
Answer: Cabhikc3004
Consider the no. to be x and x+2.
Thus, 2x + 2 = the answer choices. Obtain values of x and see which of them is an even number.
For A, B: x obtained is an odd number, hence we omit.
For C: 2x + 2 = 22 => x = 10. This is even, and does not satisfy our condition.
Hence, option C. No need to assess D and E
Bunuel - is there a quicker approach than this? I understand this works for smaller numbers but for larger numbers this may not very suitable.