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
GMATLiveTeach Starts Oct 17
Chris Peckover, Target Test Prep GMAT expert
LIVE ONLINE CLASSES

Get Ready for GMAT Test Day Faster with Live Online Classes

with Chris Peckover, 100th-Percentile GMAT Scorer

Oct 17 · Chris Peckover
Sat · 11:00 AM to 2:00 PM ET
Oct 20 · Chris Peckover
Tue, Thu · 8:00 to 10:00 PM ET
Oct 25 · Josh Braslow
Sun · 1:00 to 4:00 PM ET
Included
40 hours of live online classes + 6 months of TTP OnDemand
  • Attend the first class for free
  • Every class is recorded, so you never fall behind
View classes & enroll
Limited seats availableTarget Test Prep
EALiveTeachOnDemand 5 seats left Start anytime
EXECUTIVE ASSESSMENT

Target Test Prep EA OnDemand

Self-paced EA prep. Study on your schedule.

Logan Thompson
EXECUTIVE ASSESSMENT

Sep 6 to Dec 6, 2026

with Logan Thompson

165+ EA score guarantee
$05-day trial no automatic billing
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 Start free 5-day trial
Limited cohort · enrollment openTrial includes full course accessTarget 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.

inconsistent OG12 logic DS # 128

Expert replies
by c210 » Thu Apr 26, 2012 9:23 pm
I understand the reasoning for (2) being sufficient but can someone explain why (1) is insufficient?

prob #129

A school administrator will assign each student in
a group of n students to one of m classrooms. If
3 < m < 13 < n, is it possible to assign each of the
n students to one of the m classrooms so that each classroom has the same number of students assigned to it?

(1)It is possible to assign each of 3n students to one of m classrooms so that each classroom has the same number of students assigned to it.
(2) It is possible to assign each of 13n students to one of m classrooms so that each classroom has the same number of students assigned to it.

(1) - FROM OG
Given that 3n is divisible by m, then n is divisible by m if m = n = 9 (note that 3n = 27 and m = 9, so 3n is divisible by m) and n is not divisible by m if m = 9 and n = 12 (note that 3n = 36 and m = 9, so 3n is divisible by m); NOT sufficient


I don't get this logic since n cannot equal 12?? and n cannot equal 9 either?( both due to 3<m<13<n )

Also, shouldn't N be divisible by M because the when factoring 3N, 3 is not divisible by any number between 4 and 12 ( again due to 3<m<13<n) and therefore N should be divisible by M to make 13n/m an integer?

best,

c
Join the discussion
Source: — Data Sufficiency |

by shantanu86 » Thu Apr 26, 2012 11:02 pm
c210 wrote:I understand the reasoning for (2) being sufficient but can someone explain why (1) is insufficient?

prob #129

A school administrator will assign each student in
a group of n students to one of m classrooms. If
3 < m < 13 < n, is it possible to assign each of the
n students to one of the m classrooms so that each classroom has the same number of students assigned to it?

(1)It is possible to assign each of 3n students to one of m classrooms so that each classroom has the same number of students assigned to it.
(2) It is possible to assign each of 13n students to one of m classrooms so that each classroom has the same number of students assigned to it.

(1) - FROM OG
Given that 3n is divisible by m, then n is divisible by m if m = n = 9 (note that 3n = 27 and m = 9, so 3n is divisible by m) and n is not divisible by m if m = 9 and n = 12 (note that 3n = 36 and m = 9, so 3n is divisible by m); NOT sufficient


I don't get this logic since n cannot equal 12?? and n cannot equal 9 either?( both due to 3<m<13<n )

Also, shouldn't N be divisible by M because the when factoring 3N, 3 is not divisible by any number between 4 and 12 ( again due to 3<m<13<n) and therefore N should be divisible by M to make 13n/m an integer?

best,

c
Hi c210,

This question can be broken down to a simpler question-

Is n divisible by m given the constrain 3<m<13<n

1) 3n is divisible by m
2) 13n is divisible by m

from 1) you are completely right that no m can exist that divides 3, but the point you are missing is what if 3 and m have a common factor.. and in that case even if 3n is divisible by m, n may not be.

Example-

Let n = 3*i ,where i doesn't have 3 as factor.
Let m = 3*3

Now, 3n = 3*3*i (3n) will be divisible by 3*3 (m) but 3*i (n) will not be divisible by (n)
eg if you take i=7
n =21 , m=9

from 2) we can be sure that m and 13 can not have common factors as m<13 and 13 is a prime number.
Thus, 2 alone is sufficient.

Hope it helps!!

PS: Please put answer/solution under spoiler when you post questions.
If you feel like it, hit thanks :)
Join the discussion