[phpBB Debug] PHP Notice: in file /includes/viewtopic_mods/timer.php on line 168: array_key_exists() expects parameter 2 to be array, null given [phpBB Debug] PHP Notice: in file /includes/viewtopic_mods/timer.php on line 169: array_key_exists() expects parameter 2 to be array, null given [phpBB Debug] PHP Notice: in file /includes/viewtopic_mods/timer.php on line 170: array_key_exists() expects parameter 2 to be array, null given
A school administrator will assign each student in a group : GMAT Data Sufficiency (DS) - Page 2

Thank you for using the timer - this advanced tool can estimate your performance and suggest more practice questions. We have subscribed you to Daily Prep Questions via email.

Customized for You

we will pick new questions that match your level based on your Timer History

Track Your Progress

every week, we’ll send you an estimated GMAT score based on your performance

Practice Pays

we will pick new questions that match your level based on your Timer History

Not interested in getting valuable practice questions and articles delivered to your email? No problem, unsubscribe here.

It appears that you are browsing the GMAT Club forum unregistered!

Signing up is free, quick, and confidential.
Join other 350,000 members and get the full benefits of GMAT Club

Registration gives you:

Tests

Take 11 tests and quizzes from GMAT Club and leading GMAT prep companies such as Manhattan GMAT,
Knewton, and others. All are free for GMAT Club members.

Applicant Stats

View detailed applicant stats such as GPA, GMAT score, work experience, location, application
status, and more

Books/Downloads

Download thousands of study notes,
question collections, GMAT Club’s
Grammar and Math books.
All are free!

Thank you for using the timer!
We noticed you are actually not timing your practice. Click the START button first next time you use the timer.
There are many benefits to timing your practice, including:

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

1) It is possible to assign each of 3n students to one of m classroom 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 classroom so that each classroom has the same number of students assigned to it.

can somebody explain me the short method for this problem?

DS - assigning students (HARD) [#permalink]
25 Apr 2007, 16:42

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.

Statement 1 says m is a factor of 3n and since 3<m<13<n, there is a possibility where m=6 and n=14 and this condition (3n/m =INTEGER) be true INSUFF

Statement 2 says m is a factor of 13n and since 13 is a prime number and denominator m <13, for this condition to be true m should be a factor of n.
SUFF

Statement 1 says m is a factor of 3n and since 3<m<13<n, there is a possibility where m=6 and n=14 and this condition (3n/m =INTEGER) be true INSUFF

Statement 2 says m is a factor of 13n and since 13 is a prime number and denominator m <13, for this condition to be true m should be a factor of n. SUFF

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. _________________

Success is my only option, failure is not -- Eminem

No of classrooms(M) can be one of {4, 5, 6, ..., 12}
No of students(N) is 14 or more

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. Basically, this asks if N is a multiple of M.

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. this says 3N is a multiple of M.

taking values for M and N,
M=9, N=15(sothat 3N is multiple of M)? N is not multiple of M.
M=9, N=27? in this case, N is a multiple of M.

So 1) is not enough.

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.

this says 13N is a multiple of M.

looking at the range of values for M(4-12) and N(>=14), since 13 is not divisible by any possible value of M, this can be only possible if N is a multiple of M.

DS n students, m classrooms [#permalink]
26 Sep 2007, 10:17

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.

Re: DS n students, m classrooms [#permalink]
26 Sep 2007, 10:42

prospective mba wrote:

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. OA: B- please explain. thanks!

B

This question is really asking: is N divisible by M.

3n is disivible by M. (3n/m = integer) and 3<m<13<n.

S1: n=22, and 6 =m (satifies main statement)

22/6 <--- not divisible

22*3/6? <---- is divisible = 11.

Don't need to find values that do work here, b/c we know there are many.

S2:
13n/m = integer.

Since 13 is a prime number and 3<m<13<n

id say B is suff. n has to be divisible by n since m cannot be 13 itself (or another number divisible by 13).

Re: DS n students, m classrooms [#permalink]
26 Sep 2007, 11:41

GK_Gmat wrote:

prospective mba wrote:

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.

I'm getting B. Used the plug in numbers strategy.

Stat 1:

Let n=15, 3n = 45 Let m = 5; 3n can be divided equally and n can be divided equally; Yes. Let m= 9; 3n can be divided equally but n cannot be divided equally; No.

Insuff.

Stat 2: Let n = 20; 13n = 260 Let m = 4; 13n can be divided equally (65 each) and n can be divided equally (5 students in each class)

Let n = 15; 13n = 195 Let m = 5; 13n can be divided equally (39 students in each class) and n can be divided equally (3 students in each class)

Let n = 14; 13n = 182 Let m = 7; 13n can be divided equally (26 students in each class) and n can be divided equally (2 students in each class).

Enough time spent. At this point I chose B and move on. If wrong, I couldn't come up with a better strategy!

OA: B- please explain. thanks!

pretty much did the same thing came up with around 4-5 examples, all were in favor of B so i just said B at this point. Also 13 is prime so that tells me that this probably B.

St1:
If m = 4, and n = 16, then each of the 3n students can be assigned to one of the m classrooms so that each classroom has the same number of students assigned to it. Also, each of the n students can be assigned to one of the m classrooms so that each classroom has the same number of students assigned to it.

If m = 3, and n = 14, then each of the 3n students can be assigned to one of the m classrooms so that each classroom has the same number of students assigned to it. But not each of the n students can be assigned to one of the m classrooms so that each classroom has the same number of students assigned to it.

Insufficient.

St2:
13n/m = integer. Since 13 is a prime and m must be between 3 and 13, so n must be a multiple of m. So we can assign each of n students to one of m classrooms so that each of the classrooms has the same number of students assigned to it. SUfficient.

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.

First statement : suppose 3n= 33 and m=11 so each room can be assigned with 3 students Therefore n=11 and m=11 so each room can be filled with 1 student each so possible

Second statement : suppose 13n=156 and m=12 so each room with 13 students therefore n=12 and m=12 so each room with 1 student again possible

First statement : suppose 3n= 33 and m=11 so each room can be assigned with 3 students Therefore n=11 and m=11 so each room can be filled with 1 student each so possible

Second statement : suppose 13n=156 and m=12 so each room with 13 students therefore n=12 and m=12 so each room with 1 student again possible

I can't follow you.

In other words, we must find if m is a factor of n, or if n is divisible by m. 1. says that 3n is divisible by m. in the case m=6 and n is divisible by 2 we would have remainder 0 but still won't know anything about divisibility b/w n and m.

2. says that 13n is divisible by m. since m<13 n must be divisible by m. suff

First statement : suppose 3n= 33 and m=11 so each room can be assigned with 3 students Therefore n=11 and m=11 so each room can be filled with 1 student each so possible

Second statement : suppose 13n=156 and m=12 so each room with 13 students therefore n=12 and m=12 so each room with 1 student again possible

It states N is greater than 13 in the stem, so N cannot be 11

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.

This is actually a really simple problem. I got it incorrect initially. I just couldnt make sense of it at first.

Essnetially S1 reworded says that 3n/m= an integer. So Now you can see why we have a YEs and No scenario here. b/c if N= a prime number and m is = 3 then it works for S1, but n/m will not work.

S2: 13n/m since M cannot be 13. That means n/m is an integer. Suff.

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 classrooms 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 the 13n students to one of m classrooms so that each classroom has the same number of students assigned to it.

If n is divisible by m, so we can assign each of the n students to one of the m classrooms so that each classrooms has the same number of students assigned to it. 1. INSUF 2. 13n is divisible by m. 13 is prime factor. So n is divisible by m. ==> SUF

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 classrooms 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 the 13n students to one of m classrooms so that each classroom has the same number of students assigned to it.

Please explain your answer. thanks

Question: is n divisible by m

1) tells us that 3*n is divisible by m where 3<m<13 and n>13 for m=12 and n = 16... 3*n is divisible by m , but n is not divisible by m. for m=5 and n = 15.. 3*n as well as n are divisible by m.

i.e if m has 3 as a factor then it's not guaranteed that n is divisible by m. but if m is prime its possible that n is divisible by m

insuff

2) tells that 13*n is divisible by m where 3<m<13 and n>13

since for any m (such that 3<m<13) won't have 13 as a factor n must be divisible by m

Great to know you are joining Kellogg. A lot was being talked about your last minute interview on Pagalguy (all good though). It was kinda surprise that you got the...