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.

Q28,set 9-15testset

Expert replies
by tanviet » Sat Oct 17, 2009 6:33 pm
pls, help with this. how to solve this kind fast.

A school administer will assign each student in a group of n student to one of m classroom. If 3<m<n<, is it possible to assign each of the n students to one of the m classroom 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.
Join the discussion
Source: — Data Sufficiency |

Re: Q28,set 9-15testset

by Talkativetree » Sun Oct 18, 2009 4:34 pm
duongthang wrote:pls, help with this. how to solve this kind fast.

A school administer will assign each student in a group of n student to one of m classroom. If 3<m<n<, is it possible to assign each of the n students to one of the m classroom 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.
To do this problem quickly, you need to have a good understanding of multiples, factors, and division.

(1) says basically that if you diving 3n by m, or 3n/m, that it will divide evenly, or to say it differently, that there will be no remainder.

Okay, so from this, you can infer several things. 1, M is a factor of N, or to say it differently, that N is a multiple of M. this means that M will divide evenly into N, so this means that the question is sufficient. Now, the 3 can be ignored because n>m>3, so we don't have to worry about whether or not m is a factor or n or 3, because m>3 and 1 is a shared factor in all numbers.

(2) looking at this, it's basically the same thing, but this time 13 is greater than 3, so m may be a factor of n, OR a factor of 13. (remember, students are whole units, so they must be positive integers). This means (i believe) that (2) is insufficient, so the Answer would be A.

So to illustrate this point, for (2)

N could be 12 and the factors of 12 are 1,2,3,4,6, & 12. However, because in (2) 13>3, unlike (1), m could = 13, where as n could be any number greater than m.

So the answer, imo, is A
Join the discussion

by boy141 » Tue Oct 27, 2009 1:41 pm
OA is B


But the reasons they give it is really cryptic.. For 1), why did they use n=12 ? N cannot be 12 because N has to be more than 12.

2)Their reasoning is a whole lot different than 1. Why couldn't they use the same reasoning to do both.

BTW, it's DS: #128 in the 12th Edition.
Join the discussion

by tanviet » Thu Oct 29, 2009 1:00 am
sory,

in the question, the condition is 3<m<13<n
Join the discussion

by tanviet » Thu Oct 29, 2009 1:34 am
picking the number is solution to yes-no question of number property, hardest question.

a, if n=16,m=12, n can not be divided by m

if n=24, m=12, n can be divided by m

because m<13, m can be multiple of 3 such as 3,6,9,12 or 1*3,2*3,3*3,4*3 so 3n/m is interger, so n can be multiple of 1,2,3,4 and greater than 13, pluging the number, we have result above.

not sufficient

b,13n/m is interger, m<13, so 13 and m have no common factor, n must be multiple of m

sufficient.

answer is B
Join the discussion