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
Vote for Target Test Prep, Newsweek Readers’ Choice Awards 2026
NEWSWEEK READERS’ CHOICE 2026

BIG NEWS! Target Test Prep has been nominated, and they’d love your vote!

TTP has worked incredibly hard to build the best test prep experience possible, and winning Newsweek’s 2026 Readers’ Choice Award for Best Test Prep would mean a lot to them. If TTP has helped you, they’d be incredibly grateful for your vote. You can vote once each day through September 9.

Vote for TTP
GMATLiveTeach 7 seats left
Chris Peckover
NEXT LIVE COHORT

Oct 13 to Jan 7, 2027

with Chris Peckover

Schedule
Tue, Thu · 8:00 to 10:00 PM ET
Included
40 live hours + 6 months of GMAT OnDemand
  • Live instruction and real-time questions
  • Class recordings and assigned practice
View class & enroll
Limited cohort · enrollment openTarget Test Prep
EALiveTeach 5 seats left
Logan Thompson
EXECUTIVE ASSESSMENT

Sep 6 to Dec 6, 2026

with Logan Thompson

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
Limited cohort · enrollment openTarget 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.

DS question on Permutation

Expert replies
by ptm_30 » Tue Oct 12, 2010 12:38 pm
In how many ways can n different balls be arranged in r slots?
(1) Given r balls and n slots to arrange the balls in, the balls can be arranged in 210 ways.
(2) If we only need to select and not arrange n balls for r slots, we can do it in 35 ways.

Ref: NOVA DS Prep Course

A
Join the discussion
Source: — Data Sufficiency |

by shovan85 » Tue Oct 12, 2010 1:23 pm
1 says r balls arranged in n slots
Number of ways = P(r,n) = 210
Formula of permutation P(r,n) = (r!)/(r-n)!
210 = 2*3*5*7 (factorise)
= 5*6*7
= 7!/4!

So when can we get P(r,n) = 7!/4!
=> r!/(r-n)! = 7!/(7-3)!
=> r = 7 and n = 3

Thus u got a concrete value of n and r. So satisfied.

2 says C(n,r) = 35 = 5*7
C(n,r) = n!/[r!*(n-r)!] = 5*7

We can have n = 7 and r = 4 here to satisfy the above equation.
But we can also have n = 7 and r = 3 to satisfy the same.

Thus no concrete value of r is found as r = 3 and r = 4 both satisfies. Thus Insufficient.

IMO
A
Join the discussion

by goyalsau » Wed Oct 13, 2010 12:30 am
shovan85 wrote:1 says r balls arranged in n slots
Number of ways = P(r,n) = 210
Formula of permutation P(r,n) = (r!)/(r-n)!
210 = 2*3*5*7 (factorise)
= 5*6*7
= 7!/4!

So when can we get P(r,n) = 7!/4!
=> r!/(r-n)! = 7!/(7-3)!
=> r = 7 and n = 3

Thus u got a concrete value of n and r. So satisfied.

2 says C(n,r) = 35 = 5*7
C(n,r) = n!/[r!*(n-r)!] = 5*7

We can have n = 7 and r = 4 here to satisfy the above equation.
But we can also have n = 7 and r = 3 to satisfy the same.

Thus no concrete value of r is found as r = 3 and r = 4 both satisfies. Thus Insufficient.

IMO
A
I marked D because i never thought that there can be different value for the same Combination.

I want to know its in permutation and then the value of N and R will always be Unique, Or even in Permutation like Combination we can have different values for N and R and still have the same answer.

I am asking this because if in exam time i have the same question and then if i able to break down the permutation to one particular value then i don't have to check it with different values because i can we sure that there is no other value that can have the same answer at the end.
Saurabh Goyal
[email protected]
-------------------------


EveryBody Wants to Win But Nobody wants to prepare for Win.
Join the discussion

by shovan85 » Wed Oct 13, 2010 12:40 am
goyalsau wrote:
shovan85 wrote:1 says r balls arranged in n slots
Number of ways = P(r,n) = 210
Formula of permutation P(r,n) = (r!)/(r-n)!
210 = 2*3*5*7 (factorise)
= 5*6*7
= 7!/4!

So when can we get P(r,n) = 7!/4!
=> r!/(r-n)! = 7!/(7-3)!
=> r = 7 and n = 3

Thus u got a concrete value of n and r. So satisfied.

2 says C(n,r) = 35 = 5*7
C(n,r) = n!/[r!*(n-r)!] = 5*7

We can have n = 7 and r = 4 here to satisfy the above equation.
But we can also have n = 7 and r = 3 to satisfy the same.

Thus no concrete value of r is found as r = 3 and r = 4 both satisfies. Thus Insufficient.

IMO
A
I marked D because i never thought that there can be different value for the same Combination.

I want to know its in permutation and then the value of N and R will always be Unique, Or even in Permutation like Combination we can have different values for N and R and still have the same answer.

I am asking this because if in exam time i have the same question and then if i able to break down the permutation to one particular value then i don't have to check it with different values because i can we sure that there is no other value that can have the same answer at the end.
This is not the case in Permutation. The prevalence of multiple options in Combinatorics is the presence of both r! and (n-r)! in the denominator. As these two values will always be complement to each other they will always have two values (if not mentioned otherwise)

Always true C(n,r) = C(n,n-r) .

Hope this helps
Join the discussion