Find all School-related info fast with the new School-Specific MBA Forum

It is currently 25 May 2013, 15:36
Customize  |  Hide

A school administrator will assign each student in a group

  Question banks Downloads My Bookmarks Reviews  
Author Message
TAGS:
Senior Manager
Senior Manager
Joined: 28 Aug 2010
Posts: 280
Followers: 3

Kudos [?]: 20 [0], given: 11

GMAT Tests User
A school administrator will assign each student [#permalink] New post 03 Jan 2011, 18:48
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.

Took a long time in this ques. any efficient way to solve this.
_________________

Verbal:new-to-the-verbal-forum-please-read-this-first-77546.html
Math: new-to-the-math-forum-please-read-this-first-77764.html
Gmat: everything-you-need-to-prepare-for-the-gmat-revised-77983.html
-------------------------------------------------------------------------------------------------
Ajit

Manager
Manager
User avatar
Status: Preparing for GMAT - March 2011
Joined: 21 May 2010
Posts: 150
Location: London
Schools: INSEAD, RSM, HEC, St. Gallen, IF, IESE
WE 1: Finance 6 years
Followers: 5

Kudos [?]: 8 [0], given: 0

GMAT Tests User
Re: A school administrator will assign each student [#permalink] New post 04 Jan 2011, 02:05
The Question is If N/M is an integer ?

(1) 3N/M is an integer
Case 1 - N=15 M=3 it is clearly an integer when we substitute in above equ.
Case 2 - N=14 M=6 Satisfy the statement 2 but doesn't work for above equ.
Therefore Insuff.

(2) 13N/M= integer
13 is a prime number and since m is less than 13 therefore for this statement to hold true, N/M has to be integer. Hence Sufficient.

I hope that helps.
_________________

In The World Full Of Duplicates,, I Am The Only Masterpiece..
Girl Power
beat-the-beast-with-non-native-speaker-108349.html

Director
Director
Status: -=GMAT Jedi=-
Joined: 04 Jan 2011
Posts: 745
Location: Kochi, India
Schools: ISB
WE 1: Engineer - Larsen & Toubro, ECC Division
WE 2: Faculty - T.I.M.E.
Followers: 27

Kudos [?]: 103 [0], given: 66

GMAT Tests User
Re: Data Sufficiency #128 [#permalink] New post 17 Feb 2011, 08:33
Thanks Bunuel :)

I was looking for a clearer explanation
_________________

Mission: Be a force of good and make a positive difference to every life I touch!

From 650 to 710 to 750 - My Tryst With GMAT [Experience Thread]

Director
Director
User avatar
Status: GMAT Learner
Joined: 14 Jul 2010
Posts: 672
Followers: 21

Kudos [?]: 108 [0], given: 31

GMAT Tests User
OG DS 128 Arithmetic Properties [#permalink] New post 23 Feb 2011, 22:19
128. 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 am student of everyone-baten
Collections:-
PSof OG solved by GC members: http://gmatclub.com/forum/collection-ps-with-solution-from-gmatclub-110005.html
DS of OG solved by GC members: http://gmatclub.com/forum/collection-ds-with-solution-from-gmatclub-110004.html
100 GMAT PREP Quantitative collection http://gmatclub.com/forum/gmat-prep-problem-collections-114358.html
Collections of work/rate problems with solutions http://gmatclub.com/forum/collections-of-work-rate-problem-with-solutions-118919.html
Mixture problems in a file with best solutions: http://gmatclub.com/forum/mixture-problems-with-best-and-easy-solutions-all-together-124644.html

Senior Manager
Senior Manager
Joined: 10 Nov 2010
Posts: 270
Location: India
Concentration: Strategy, Operations
GMAT 1: 520 Q42 V19
GMAT 2: 540 Q44 V21
WE: Information Technology (Computer Software)
Followers: 4

Kudos [?]: 19 [0], given: 22

GMAT Tests User
is n divisible by m [#permalink] New post 08 Mar 2011, 11:10
128) A school administer 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) Its 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.
_________________

The proof of understanding is the ability to explain it.

GMAT Club team member
User avatar
Joined: 02 Sep 2009
Posts: 11627
Followers: 1802

Kudos [?]: 9611 [0], given: 829

Re: is n divisible by m [#permalink] New post 08 Mar 2011, 11:13
Intern
Intern
Joined: 16 Nov 2010
Posts: 27
Followers: 0

Kudos [?]: 1 [0], given: 1

Re: Divisibility problem - n students in m classes (+/-700 lvl) [#permalink] New post 17 Mar 2011, 11:27
Could someone explain how we've reached the n/m divisibility statement. I couldn't understand that part ? Thanks.
Intern
Intern
Joined: 17 Mar 2011
Posts: 21
Followers: 0

Kudos [?]: 5 [0], given: 0

Re: Divisibility problem - n students in m classes (+/-700 lvl) [#permalink] New post 17 Mar 2011, 20:00
The n/m being an integer part is because we are told basically that we can divide n by m without a remainder.

I dont get how doing the method recommended is time saving at all :s

Yes like was written, for (2) 13 is a prime number, since m cant be 13 or a multiple of it, then it is sufficient intuitively that it is true.

For (1), we just see that 3 is also a prime number. The trap is that although m cant=3, it can=6,9,12 which are multiples of it, so we don't know if the statement is true.

Trickyyyyyyy..
Intern
Intern
Joined: 16 Mar 2011
Posts: 10
Followers: 0

Kudos [?]: 0 [0], given: 0

Re: Students per classroom [#permalink] New post 16 Apr 2011, 04:15
Quote:
amitjash 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.


Please help me understand what is wrong in this approach. I just used number.
chice 2: Let n=14..Hence 13X14=182. Now choosing m between 3 < m < 13 < n.
Say m=7. Then 182 is divisible by 7. But when m=5 it is not divisible. So (2) is not sufficient.
Some one please explain what is wrong in choosing numbers to solve this and where I am missing something.


You picked one combination (n=14 and m=7) for which 13n is divisible by m and another combination (n=14 and m=5) for which 13n is NOT divisible by m. To show that statement (2) is insufficient to answer the original posed question, you should be able to pick two combinations of n and m for which 13n is divisible by m, but for one of them n should be divisible by m and for the other n should NOT be divisible by m. That would be the only way to say that the truth of statement two is not sufficient to answer the original question.
Intern
Intern
Joined: 16 Mar 2011
Posts: 10
Followers: 0

Kudos [?]: 0 [0], given: 0

Re: Students per classroom [#permalink] New post 16 Apr 2011, 04:24
Quote:
Mathematically speaking, the question is: is n divisible by m !!

(1) 3n is divisible by m. It doesn't say if n is divisible by m because 3 < m < 13. Indeed, n can be equal to 14 and m = 6. In that case m does neither divide 3 nor n. But with m = 6 and n = 18, m divides n.
INSUFFICIENT

(2) 13n is divisible by n. But 13 is a prime number that m can't divide! Besides 3 < m < 13 so it can't be a combination of 13 and n (like 13* 2) that can be divided by 13.

ANS : B.

Hope it's clear enough...


Shouldn't the "prime" argument used in (2) for 13 be applicable to (1) for 3. I understand that (1) is easily deemed insufficient when you consider two sets of values for m and n that satisfy the divisibility of the divisibility of 3n by m, but only one set of which satisfies the divisibility of m by n. However, I don't understand how the "prime" argument used for (2) can't be used for (1)....really confused...
Intern
Intern
Joined: 16 Mar 2011
Posts: 10
Followers: 0

Kudos [?]: 0 [0], given: 0

Re: Students per classroom [#permalink] New post 20 Apr 2011, 20:23
Quote:
Quote:
Mathematically speaking, the question is: is n divisible by m !!

(1) 3n is divisible by m. It doesn't say if n is divisible by m because 3 < m < 13. Indeed, n can be equal to 14 and m = 6. In that case m does neither divide 3 nor n. But with m = 6 and n = 18, m divides n.
INSUFFICIENT

(2) 13n is divisible by n. But 13 is a prime number that m can't divide! Besides 3 < m < 13 so it can't be a combination of 13 and n (like 13* 2) that can be divided by 13.

ANS : B.

Hope it's clear enough...


Shouldn't the "prime" argument used in (2) for 13 be applicable to (1) for 3. I understand that (1) is easily deemed insufficient when you consider two sets of values for m and n that satisfy the divisibility of the divisibility of 3n by m, but only one set of which satisfies the divisibility of m by n. However, I don't understand how the "prime" argument used for (2) can't be used for (1)....really confused...


Mods or anyone else have a way to clear up my confusion? :D
Manager
Manager
Joined: 10 Jan 2010
Posts: 117
GPA: 4
WE: Programming (Computer Software)
Followers: 0

Kudos [?]: 29 [0], given: 33

GMAT Tests User
Re: a hard one [#permalink] New post 06 Jun 2011, 16:35
Can somebody explain this, please.
_________________

-If you like my post, consider giving KUDOS

Manager
Manager
User avatar
Joined: 04 Apr 2010
Posts: 179
Followers: 1

Kudos [?]: 21 [0], given: 31

GMAT Tests User
Re: a hard one [#permalink] New post 07 Jun 2011, 14:25
n/m remainder should be 0.
Stat 1 20/6 R is not 0 . However, 3*20/6 R is 0................(NO answer)
60/6 R is not 0 . However, 3*60/6 R is 0................(Yes answer)
Stat 2 13n/m R is 0 given. Since 3<m<13 n must be divisible my m and R must be 0.
B is the answer.
_________________

Consider me giving KUDOS, if you find my post helpful.
If at first you don't succeed, you're running about average. ~Anonymous

Senior Manager
Senior Manager
Joined: 29 Jan 2011
Posts: 401
Followers: 0

Kudos [?]: 8 [0], given: 87

GMAT Tests User
School Administrator [#permalink] New post 08 Jun 2011, 22:35
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.

How do you know if the question asks you to see if M is a factor of N or N is a factor of M? or m/n or n/m ?
Current Student
Joined: 26 May 2005
Posts: 575
Followers: 18

Kudos [?]: 79 [0], given: 13

GMAT Tests User
Re: School Administrator [#permalink] New post 08 Jun 2011, 23:35
siddhans 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.

How do you know if the question asks you to see if M is a factor of N or N is a factor of M? or m/n or n/m ?


the simple logic here is both n and m must be integers..
st.2 says 13*n/m is possible as 13 is a prime n/m must be an integer thus it is possible to arrange n students to m classrooms.
Has to be B
Senior Manager
Senior Manager
Joined: 29 Jan 2011
Posts: 401
Followers: 0

Kudos [?]: 8 [0], given: 87

GMAT Tests User
Re: School Administrator [#permalink] New post 08 Jun 2011, 23:38
sudhir18n wrote:
siddhans 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.

How do you know if the question asks you to see if M is a factor of N or N is a factor of M? or m/n or n/m ?


the simple logic here is both n and m must be integers..
st.2 says 13*n/m is possible as 13 is a prime n/m must be an integer thus it is possible to arrange n students to m classrooms.
Has to be B




I came across this explanation at =>

http://bt.www.beatthegmat.com/gmat-12th ... tml#331474


We first need to sort out what the question stem is really asking. In order to "evenly" divide our n students up among m classes, it must be the case that n is some multiple of m. We can try some numbers to see the relationship: If there are 4 classrooms, then 1 student per class means n=4, 2 students per class means n=8, 3 students per class means n=12. Notice that in all cases n is a multiple of m. So the real question is the following:

Is n/m an integer?

** Now, remember that in order for n/m to be an integer, it must be the case that all of the factors of m are absorbed into n. (i.e. 8/4= 2 = integer because all of 4 was able to cancel with 8).

Statement (1): (same rephrasing steps as above) = 3n/m is an integer.

The easier thing to do here is to remember that we are in a Yes/No question and try to find numbers that allow us to answer both Yes and No to the stem. Also, don't forget the constraints on m and n. Because m is an integer between 3 and 13, we should think of values that will allow 3n/m to be divisible by m but allow both a Yes and a No answer. If we allow m to be 3, then the denominator is completely absorbed into the numerator. Then we could choose n=6, so 3(6)/3 = 6, and 6/3 = 2 (n/m is an integer). We could also choose n=5, so 3(5)/3 = 5, but 5/3 is not an integer. INSUFFICIENT

Statement (2): (same rephrasing as above) = 13n/m. Now notice that for the m to be absorbed into the numerator regardless of the value of n, it would need to be 13 because 13 is prime, but m is restricted to a number between 3 and 13 (not inclusive) so m cannot be 13. Therefore, in order to absorb the denominator m completely into the numerator n it must be the case that n contains the terms that completely absorb the denominator (i.e. if 13(17)/n, then n must be 1 or 17 for the fraction to be an integer.) Therefore n/m must be an integer. SUFFICIENT


The question I have is why havent we chosen values of n > 13 since 3<m<13<n Doesnt it mean we need to choose values >13 to test statement 1 and 2 ?
Current Student
Joined: 26 May 2005
Posts: 575
Followers: 18

Kudos [?]: 79 [0], given: 13

GMAT Tests User
Re: School Administrator [#permalink] New post 08 Jun 2011, 23:44
siddhans wrote:
sudhir18n wrote:
siddhans 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.

How do you know if the question asks you to see if M is a factor of N or N is a factor of M? or m/n or n/m ?


the simple logic here is both n and m must be integers..
st.2 says 13*n/m is possible as 13 is a prime n/m must be an integer thus it is possible to arrange n students to m classrooms.
Has to be B




I came across this explanation at =>

http://bt.www.beatthegmat.com/gmat-12th ... tml#331474


We first need to sort out what the question stem is really asking. In order to "evenly" divide our n students up among m classes, it must be the case that n is some multiple of m. We can try some numbers to see the relationship: If there are 4 classrooms, then 1 student per class means n=4, 2 students per class means n=8, 3 students per class means n=12. Notice that in all cases n is a multiple of m. So the real question is the following:

Is n/m an integer?

** Now, remember that in order for n/m to be an integer, it must be the case that all of the factors of m are absorbed into n. (i.e. 8/4= 2 = integer because all of 4 was able to cancel with 8).

Statement (1): (same rephrasing steps as above) = 3n/m is an integer.

The easier thing to do here is to remember that we are in a Yes/No question and try to find numbers that allow us to answer both Yes and No to the stem. Also, don't forget the constraints on m and n. Because m is an integer between 3 and 13, we should think of values that will allow 3n/m to be divisible by m but allow both a Yes and a No answer. If we allow m to be 3, then the denominator is completely absorbed into the numerator. Then we could choose n=6, so 3(6)/3 = 6, and 6/3 = 2 (n/m is an integer). We could also choose n=5, so 3(5)/3 = 5, but 5/3 is not an integer. INSUFFICIENT

Statement (2): (same rephrasing as above) = 13n/m. Now notice that for the m to be absorbed into the numerator regardless of the value of n, it would need to be 13 because 13 is prime, but m is restricted to a number between 3 and 13 (not inclusive) so m cannot be 13. Therefore, in order to absorb the denominator m completely into the numerator n it must be the case that n contains the terms that completely absorb the denominator (i.e. if 13(17)/n, then n must be 1 or 17 for the fraction to be an integer.) Therefore n/m must be an integer. SUFFICIENT


The question I have is why havent we chosen values of n > 13 since 3<m<13<n Doesnt it mean we need to choose values >13 to test statement 1 and 2 ?


St2. says 13 *n/m is an integer.
u can take any value of n>13 such that it is divisible by m ( its a constraint of the problem)
hence u cant take prime numbers..
take n = 24
but m should be either 4,6,8,12.

Is that what u meant? let me know if I havent answered what u mean to ask .
Thanks
Senior Manager
Senior Manager
Joined: 29 Jan 2011
Posts: 401
Followers: 0

Kudos [?]: 8 [0], given: 87

GMAT Tests User
Re: School Administrator [#permalink] New post 09 Jun 2011, 00:30
What i mean is stmt 2 says : 13n/m should be an integer.... so we need to plug in values on n that are greater than 13 correct which satisfies this condition?
Current Student
Joined: 26 May 2005
Posts: 575
Followers: 18

Kudos [?]: 79 [0], given: 13

GMAT Tests User
Re: School Administrator [#permalink] New post 09 Jun 2011, 00:34
siddhans wrote:
What i mean is stmt 2 says : 13n/m should be an integer.... so we need to plug in values on n that are greater than 13 correct which satisfies this condition?


More so because the question clearly mentions a constraint 3 < m < 13 < n
so n can never be less than 13
Manager
Manager
Joined: 03 Jun 2010
Posts: 140
Location: Dubai, UAE
Schools: IE Business School, Manchester Business School, HEC Paris, Rotterdam School of Management, Babson College
Followers: 2

Kudos [?]: 4 [0], given: 4

GMAT ToolKit User
Re: School Administrator [#permalink] New post 09 Jun 2011, 03:19
Hi both, interesting question, upon reading the questions I had seen the constraints
N>13
m is between 4-12
I Failed to realize or comprehend that effectively both the statements are essentially asking for the answers to be integers or n evenly dividing into m , or the fact that they require factors of 3 and 13 with the constraints. Having said that, if we look at statement 1 it is insufficient because 3n assuming greater than 13 would give two separate answers for statement 1 and for statement none of the values between 4-12 are factors of 13. So I chose e as an answer. Can you please take me through this question by making it idiot proof for me.

Image Posted from GMAT ToolKit
Re: School Administrator   [#permalink] 09 Jun 2011, 03:19
    Similar topics Author Replies Last post
Similar
Topics:
New posts A school administrator will assign each student in a group chunjuwu 2 22 Dec 2004, 10:39
New posts A school administrator will assign each student in a group smily_buddy 1 09 Aug 2007, 09:08
New posts A school administrator will assign each student in a group puma 1 01 May 2008, 21:24
This topic is locked, you cannot edit posts or make further replies. New A school administrator will assign each student in a group ssr7 1 15 Apr 2011, 20:07
New posts A school administrator will assign each student in a group siddhans 1 03 Jul 2011, 04:27
Display posts from previous: Sort by

A school administrator will assign each student in a group

  Question banks Downloads My Bookmarks Reviews  

Go to page   Previous    1   2   3   4   5   6    Next  [ 113 posts ] 



GMAT Club MBA Forum Home| About| Privacy Policy| Terms and Conditions| GMAT Club Rules| Contact| Sitemap

Powered by phpBB © phpBB Group and phpBB SEO

Kindly note that the GMAT® test is a registered trademark of the Graduate Management Admission Council®, and this site has neither been reviewed nor endorsed by GMAC®.