Consider the expression : GMAT Data Sufficiency (DS)
Check GMAT Club Decision Tracker for the Latest School Decision Releases https://gmatclub.com/AppTrack

 It is currently 28 Feb 2017, 07:44

GMAT Club Daily Prep

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

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

Events & Promotions

Events & Promotions in June
Open Detailed Calendar

Consider the expression

Author Message
TAGS:

Hide Tags

Retired Moderator
Joined: 02 Sep 2010
Posts: 805
Location: London
Followers: 108

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

Show Tags

07 Sep 2010, 05:24
00:00

Difficulty:

65% (hard)

Question Stats:

36% (01:48) correct 64% (01:42) wrong based on 11 sessions

HideShow timer Statistics

Consider the expression $$\frac{(A!)}{((B!)^x * (C!)^y * (D!)^z))}$$ where A,B,C,D,x,y,z are all positive integers >=1. Is this expression an integer ?

(1) B+C+D < A
(2) xB+yC+zD < A
[Reveal] Spoiler: OA

_________________

Last edited by shrouded1 on 07 Sep 2010, 05:37, edited 1 time in total.
Manager
Status: Keep fighting!
Joined: 31 Jul 2010
Posts: 235
WE 1: 2+ years - Programming
WE 2: 3+ years - Product developement,
WE 3: 2+ years - Program management
Followers: 5

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

Show Tags

07 Sep 2010, 05:33
Please paste the picture or use the math tags.... its difficult to understand the expression.
Manager
Status: Keep fighting!
Joined: 31 Jul 2010
Posts: 235
WE 1: 2+ years - Programming
WE 2: 3+ years - Product developement,
WE 3: 2+ years - Program management
Followers: 5

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

Show Tags

07 Sep 2010, 05:52
I checked it out with a few numbers and realized B is the answer. but am wondering how to solve this mathematically.
Manager
Joined: 26 Mar 2010
Posts: 125
Followers: 2

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

Show Tags

07 Sep 2010, 16:49
hemanthp wrote:
I checked it out with a few numbers and realized B is the answer. but am wondering how to solve this mathematically.

Manager
Joined: 16 Mar 2010
Posts: 184
Followers: 3

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

Show Tags

07 Sep 2010, 21:04
I dont think this can be solved by me in actual GMAT.
Retired Moderator
Joined: 02 Sep 2010
Posts: 805
Location: London
Followers: 108

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

Show Tags

08 Sep 2010, 00:27
This is one of those questions me and a friend of mine made up to test each other (both of us have GMATs coming up). So I have a solution with me, but it is rather unconventional :

It is easy to prove that (1) alone cant be the answer since there is no constraint on x,y,z and one can make these big enough to exceed the numerator. Eg 7! / (2!^40 * 3!^20 * 1!^1)

To show that (2) alone is sufficient :
Consider the question "How many permutations are possible of a set of A alphabets, of which x alphabets are each repeated B times, y alphabets each repeated C times and z alphabets each repeated D times within the set ?"
The answer to this question is exactly the expression above, and we know that since it is the answer to a counting question, it must be an integer.
_________________
Manager
Joined: 17 Nov 2009
Posts: 239
Followers: 1

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

Show Tags

08 Sep 2010, 12:20
Can some one please provide a detailed explanation?
Manager
Status: Keep fighting!
Joined: 31 Jul 2010
Posts: 235
WE 1: 2+ years - Programming
WE 2: 3+ years - Product developement,
WE 3: 2+ years - Program management
Followers: 5

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

Show Tags

20 Oct 2010, 06:00
I give up on this question.
Senior Manager
Status: Not afraid of failures, disappointments, and falls.
Joined: 20 Jan 2010
Posts: 294
Concentration: Technology, Entrepreneurship
WE: Operations (Telecommunications)
Followers: 18

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

Show Tags

23 Oct 2010, 02:41
This one was so hard. Couldn't solve
_________________

"I choose to rise after every fall"
Target=770
http://challengemba.blogspot.com
Kudos??

Retired Moderator
Joined: 02 Sep 2010
Posts: 805
Location: London
Followers: 108

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

Show Tags

23 Oct 2010, 02:55
It's a tricky one, but if you look at the solution above, it's almost like saying c(n,r) will always be an integer.

Just that in this case we are talking about a different kind of arrangement with a different formula.

Posted from my mobile device
_________________
Manager
Joined: 07 Jan 2010
Posts: 147
Location: So. CA
WE 1: 2 IT
WE 2: 4 Software Analyst
Followers: 2

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

Show Tags

25 Oct 2010, 21:51
shrouded1 wrote:
It's a tricky one, but if you look at the solution above, it's almost like saying c(n,r) will always be an integer.

Just that in this case we are talking about a different kind of arrangement with a different formula.

Posted from my mobile device

indeed very tricky, i was able to rule out (1) and guessed B

Can you explain a bit more on what you mean by "it's almost like saying c(n,r) will always be an", i'm not seeing this thru a combination? Thanks.
Retired Moderator
Joined: 02 Sep 2010
Posts: 805
Location: London
Followers: 108

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

Show Tags

25 Oct 2010, 23:43
Imagine I ask you the question :
What is the number of ways you can arrange A balls, each of different color in a row ?
The answer would be $$A!$$

Now I modify that question :
What is the number of ways you can arrange A balls, of which B are are blue, C are red, D are green and the rest are of different but unique colors ?
The answer would now be $$\frac{A!}{B!C!D!}$$

Now I modify it further :
What is the number of ways you can arrange A balls, of which there are x subsets each consisting B balls each such that each subset consists of balls of a different shade of blue, and all other balls not included in these subsets are of unique colors ?
The answer would now be $$\frac{A!}{B!^x}$$. Notice that A has to be greater than or equal to xB

Finally I modify it a bit more :
What is the number of ways you can arrange A balls, of which there are x subsets each consisting B balls each, y subsets of C balls each, z subsets of D balls each, such that each subset consists of a unique color of balls. And the rest of the set of balls are distinct from all other balls ?
The answer would now be $$\frac{A!}{B!^xC!^yD!^z}$$. Notice that A has to be greater than or equal to xB+yC+zD

Essentially what I am getting at is that the expression shown above is the answer to a combinatorial problem. And since the answer to a combinatorial problem is a "number of ways", such an expression always has to be an integer.
_________________
Manager
Joined: 07 Jan 2010
Posts: 147
Location: So. CA
WE 1: 2 IT
WE 2: 4 Software Analyst
Followers: 2

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

Show Tags

26 Oct 2010, 07:52
Nice, thanks for explaining, now i get the picture.
Re: Fun with factorials   [#permalink] 26 Oct 2010, 07:52
Similar topics Replies Last post
Similar
Topics:
5 Can the positive integer k be expressed as the product of 11 11 Feb 2012, 19:08
10 What is the hundredths digit in the decimal expression of 9 15 Nov 2010, 15:38
1 What is the value of the expression above? 8 19 Oct 2010, 04:34
Can the positive integer p be expressed as the product of 7 29 Mar 2010, 01:23
15 Can the positive integer p be expressed as the product of 26 27 Dec 2009, 04:49
Display posts from previous: Sort by