Let me help you see the elegant pattern behind this remainder question.When I first encounter students struggling with this type of problem, they often try to find the exact values of x and y using the Chinese Remainder Theorem. That's unnecessarily complex for the GMAT. Let me show you the streamlined approach.
Key Insight: Both x and y have
identical remainder patterns:
- Remainder 3 when divided by 5
- Remainder 4 when divided by 7
Step 1: Express the conditions algebraicallyFor any number with these remainder properties, we can write:
\(x = 5k + 3\) for some integer k
\(x = 7m + 4\) for some integer m
Similarly for y:
\(y = 5j + 3\) for some integer j
\(y = 7n + 4\) for some integer n
Step 2: Apply the difference propertyHere's the crucial pattern - when two numbers have identical remainders, their difference eliminates those remainders:
\(x - y = (5k + 3) - (5j + 3) = 5(k - j)\)
\(x - y = (7m + 4) - (7n + 4) = 7(m - n)\)
This tells us that \(x - y\) is divisible by both 5 and 7.
Step 3: Find what MUST divide x - ySince 5 and 7 are coprime (share no common factors), and \(x - y\) is divisible by both, \(x - y\) must be divisible
by their product: \(5*7 = 35\)Want to master this remainder pattern that appears in 3-4 GMAT questions yearly?
The complete solution walks through the coprime divisor principle and shows you how to spot this pattern instantly.
The framework there also covers what happens when divisors aren't coprime - a common trap the GMAT loves to test.