Hi Roland2rule,

For this question, you would likely find it helpful to use the 'division rule of 3': for an integer to be divisible by 3, the sum of the DIGITS of the integer will be divisible by 3.

For example:
24 is divisible by 3 because 2+4 = 6 and 6 is divisible by 3
25 is NOT divisible by 3 because 2+5 = 7 and 7 is NOT divisible by 3

Using that pattern, you can quickly list out the 'pairs' of numbers that would form a 2-digit number that is divisible by 3:
1 and 2 (forming 12 and 21)
1 and 5 (forming 15 and 51)
2 and 4 (forming 24 and 42)
2 and 7 (forming 27 and 72)
3 and 6 (forming 36 and 63)
4 and 5 (forming 45 and 54)
5 and 7 (forming 57 and 75)

Total numbers = 14

Final Answer: E

GMAT assassins aren't born, they're made,
Rich