First, let's simplify the given equation:You have \(\frac{k}{6} + \frac{m}{4} = \frac{t}{12}\)
Here's what you need to do - convert everything to a common denominator of 12:
\(\frac{k}{6} = \frac{2k}{12}\)
\(\frac{m}{4} = \frac{3m}{12}\)
So: \(\frac{2k}{12} + \frac{3m}{12} = \frac{t}{12}\)
This gives us the key equation:
\(t = 2k + 3m\)Now, what does the question really ask?The question asks if t and 12 share a common factor greater than 1. Notice that \(12 = 2^2 \times 3\). This means t and 12 will have a common factor greater than 1 if and only if t is divisible by 2 OR divisible by 3 (or both).
So you need to determine: Is t divisible by 2 or 3?
Analyzing Statement 1: k is a multiple of 3Let's say \(k = 3n\) for some positive integer n.
Then: \(t = 2k + 3m = 2(3n) + 3m = 6n + 3m = 3(2n + m)\)
Here's the key insight - notice how \(t = 3(2n + m)\). This means t is definitely divisible by 3!
Since t is divisible by 3 and 12 is also divisible by 3, they share the common factor 3, which is greater than 1.
The answer is definitively
YES.
Statement 1 is
SUFFICIENT! This eliminates choices B, C, and E.
Analyzing Statement 2: m is a multiple of 3Let's say \(m = 3p\) for some positive integer p.
Then: \(t = 2k + 3m = 2k + 3(3p) = 2k + 9p\)
Think about this: Since \(9p\) is always divisible by 3, for t to be divisible by 3, you'd need \(2k\) to also be divisible by 3. But that only happens when k is divisible by 3, and Statement 2 tells us nothing about k!
Let me show you with concrete examples:
- If \(k = 1, m = 3\): Then \(t = 2(1) + 3(3) = 2 + 9 = 11\)
Is 11 divisible by 2 or 3? No. So \(gcd(11, 12) = 1\). Answer: NO
- If \(k = 3, m = 3\): Then \(t = 2(3) + 3(3) = 6 + 9 = 15\)
Is 15 divisible by 3? Yes! So \(gcd(15, 12) = 3 > 1\). Answer: YES
Since you get different answers depending on the value of k, Statement 2 is
NOT SUFFICIENT.
Answer: A - Statement 1 alone is sufficient, but Statement 2 alone is not sufficient.
Want to master the systematic framework for all divisibility and common factor problems? You can check out the
complete solution with advanced patterns on Neuron by e-GMAT to understand how to approach these questions systematically and avoid common traps. You can also explore comprehensive explanations for
other official GMAT questions on Neuron with practice quizzes and detailed analytics into your strengths and weaknesses.