BREAKING: Target Test Prep releases Brand New 2026 On Demand GMAT prep course

Redeem

Target Test Prep · GMAT

Choose how you want to prepare

Learn live with an expert or move at your own pace. Every option includes the complete TTP study system.

★★★★★5.0559 reviews
Vote for Target Test Prep, Newsweek Readers’ Choice Awards 2026
NEWSWEEK READERS’ CHOICE 2026

BIG NEWS! Target Test Prep has been nominated, and they’d love your vote!

TTP has worked incredibly hard to build the best test prep experience possible, and winning Newsweek’s 2026 Readers’ Choice Award for Best Test Prep would mean a lot to them. If TTP has helped you, they’d be incredibly grateful for your vote. You can vote once each day through September 9.

Vote for TTP
GMATLiveTeach 7 seats left
Chris Peckover
NEXT LIVE COHORT

Oct 13 to Jan 7, 2027

with Chris Peckover

Schedule
Tue, Thu · 8:00 to 10:00 PM ET
Included
40 live hours + 6 months of GMAT OnDemand
  • Live instruction and real-time questions
  • Class recordings and assigned practice
View class & enroll
Limited cohort · enrollment openTarget Test Prep
EALiveTeach 5 seats left
Logan Thompson
EXECUTIVE ASSESSMENT

Sep 6 to Dec 6, 2026

with Logan Thompson

Schedule
Sun · 9:30 AM to 12:30 PM ET
Included
40 hours of live online classes plus six months of access to the complete TTP EA OnDemand course.
  • 165+ EA Score Guarantee
  • 4,100+ Quant, Verbal, and Integrated Reasoning practice questions
  • 400+ hours of in-depth video lessons
  • 3,000+ step-by-step video solutions
View EA class & enroll
Limited cohort · enrollment openTarget Test Prep
GMATOnDemand Start anytime
SELF-PACED MASTERCLASS

Target Test Prep GMAT OnDemand

Complete access from day one. Study on your schedule.

715+ score guarantee
$0to start then $127/mo
  • Personalized study plan and analytics
  • Thousands of lessons and practice questions

Compare the format, schedule, and included access before enrolling. Prices and seat counts shown reflect the supplied offer details.

DS - Numbers

Expert replies
by agemroy » Tue Jul 08, 2008 9:05 am
If k, m, and t are positive integers and k/6 + m/4 = t/12 , do t and 12 have a common factor greater than 1 ?
(1) k is a multiple of 3.
(2) m is a multiple of 3.

A. Statement (1) ALONE is sufficient, but statement (2) alone is not sufficient.
B. Statement (2) ALONE is sufficient, but statement (1) alone is not sufficient.
C. BOTH statements TOGETHER are sufficient, but NEITHER statement ALONE is sufficient.
D. EACH statement ALONE is sufficient.
E. Statements (1) and (2) TOGETHER are NOT sufficient.

OA is A
Join the discussion
Source: — Data Sufficiency |

by AleksandrM » Tue Jul 08, 2008 9:46 am
Simplify and you have: 2K + 3M = T

1) K is at least 3 so 2(3) + 3(1) = T = 9
2(3) + 3(2) = T = 12 and so on and so forth, whatever M is, T and 12 will always have a common factor greater than 1, because any number that is multiplied by three will have 3 as its factor (duh) and when it is added to a number that has a factor of 3, then the two will have a common factor of 3. Sufficient.

2) M is at least 3 so 2(1) + 3(3) = 11 No common factor
2(1) + 3(6) = 20 A common factor of 2. Not sufficient.

Choose A.
Join the discussion

by zakir » Tue Jul 08, 2008 9:29 pm
I didn't get this :( how come you're plugging numbers for m (1,2,etc..) and k?
Join the discussion

by AleksandrM » Wed Jul 09, 2008 4:15 pm
zakir wrote:I didn't get this :( how come you're plugging numbers for m (1,2,etc..) and k?
(1) k is a multiple of 3.

Multiples of 3 are 3, 6, 9, 12, etc.

So, it's easier to plug in 3 for k and get 2(3) + 3(1) = 9

Let me tell you this before I go on. You are looking for a common divisor for T and 12 that is greater than 1.

If K is some multiple of 3, then that is all you need to know because you know for sure that the product of 3M - where M is ANY number - will still give you a sum for T where T and 12 will have a common divisor greater than 1.

However:

(2) m is a multiple of 3.

M could be 3, 6, 9, 12, 15, etc.

However, you do not know whether the product of 2K will give you a sum for T that will have a common divisor for T and 12 greater than 1. As I showed to you above, the sum for T can be prime - in which case it is only divisible by 1 and itself - or a number divisible by 2. Two answers make this statement insufficient.

The reason I used numbers is so you can see the process better. You really don't have to pick numbers at all, you just have to know their properties.
Join the discussion

Re: DS - Numbers

by lunarpower » Thu Jul 10, 2008 10:37 pm
yeah, so you should definitely rephrase the problem by getting rid of the fractions first. you can kill them all by multiplying through by 12, the common denominator of all the fractions:
2k + 3m = t
this is the base equation from which we'll be working to answer the problems.

you can also rephrase the question. if t and 12 have a common factor greater than 12, that's just another way of saying that something that goes into 12 (besides 1) also goes into t. so, here's a rephrase of the prompt question:
does 2, 3, 4, 6, or 12 go into t?
since 4, 6, and 12 are just compounds of the prime factors 2 and 3, it's actually redundant to ask whether those numbers are factors of t. therefore, we can rephrase the question down to its most distilled essence:
does 2 or 3 go into t?

-- statement (1) --
if k is a multiple of 3, then we can write k = 3n, where n is an integer. therefore, we have
2(3n) + 3m = t
6n + 3m = t
since 6n and 3m are both multiples of 3, it follows that 3 goes into t.
sufficient.

-- statement (2) --
if m is a multiple of 3, then we can write m = 3n, where n is an integer. therefore, we have
2k + 3(3n) = t
2k + 9n = t
these (2k and 9n) don't have a common factor, so this is insufficient.
if you want proof of insufficiency, go ahead and plug some easy numbers: if k = n = 1 (which would actually mean k = 1 and m = 3), then t = 11, which doesn't share a common factor with 12. if k = 3 and n = 1 (which would actually mean k = m = 3), then t = 15, which shares the common factor 3 with 12.
insufficient.

answer = a
Ron has been teaching various standardized tests for 20 years.

--

Pueden hacerle preguntas a Ron en castellano
Potete chiedere domande a Ron in italiano
On peut poser des questions à Ron en français
Voit esittää kysymyksiä Ron:lle myös suomeksi

--

Quand on se sent bien dans un vêtement, tout peut arriver. Un bon vêtement, c'est un passeport pour le bonheur.

Yves Saint-Laurent

--

Learn more about ron
Join the discussion