GMAT Question of the Day - Daily to your Mailbox; hard ones only

 It is currently 20 Oct 2019, 15:30

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

A company plans to award prizes to its top 3 salespeople, with the

Author Message
TAGS:

Hide Tags

Math Expert
Joined: 02 Sep 2009
Posts: 58434
A company plans to award prizes to its top 3 salespeople, with the  [#permalink]

Show Tags

27 Dec 2015, 09:03
1
6
00:00

Difficulty:

15% (low)

Question Stats:

76% (01:00) correct 24% (01:02) wrong based on 133 sessions

HideShow timer Statistics

A company plans to award prizes to its top 3 salespeople, with the largest prize going to the top salesperson, the next-largest prize to the next salesperson, and a smaller prize to the third-ranking salesperson. If the company has 12 salespeople on staff, how many different arrangements of winners are possible?

A. 1,728
B. 1,440
C. 1,320
D. 220
E. 6

_________________
Senior Manager
Joined: 28 Feb 2014
Posts: 291
Location: United States
Concentration: Strategy, General Management
Re: A company plans to award prizes to its top 3 salespeople, with the  [#permalink]

Show Tags

30 Dec 2015, 18:15
[quote="Bunuel"]A company plans to award prizes to its top 3 salespeople, with the largest prize going to the top salesperson, the next-largest prize to the next salesperson, and a smaller prize to the third-ranking salesperson. If the company has 12 salespeople on staff, how many different arrangements of winners are possible?

12*11*10
=1320

C. 1,320
Manager
Joined: 02 Jun 2015
Posts: 62
Location: United States
Concentration: Strategy, Human Resources
WE: Engineering (Manufacturing)
Re: A company plans to award prizes to its top 3 salespeople, with the  [#permalink]

Show Tags

02 Jan 2016, 08:44
Bunuel wrote:
A company plans to award prizes to its top 3 salespeople, with the largest prize going to the top salesperson, the next-largest prize to the next salesperson, and a smaller prize to the third-ranking salesperson. If the company has 12 salespeople on staff, how many different arrangements of winners are possible?

A. 1,728
B. 1,440
C. 1,320
D. 220
E. 6

12*11*10= 1320

Ans C

I feel it is a straightforward question of selecting 3 people out of 12.
Intern
Joined: 16 Feb 2016
Posts: 49
Concentration: Other, Other
Re: A company plans to award prizes to its top 3 salespeople, with the  [#permalink]

Show Tags

27 Mar 2016, 18:42
Choose 3 people out of 12 and arrange these 3 people between themselves.

12!/(3!x9!)x3!=12x11x10x9!/(3!x9!)x3!=12x11x10=1320
Senior Manager
Joined: 24 Nov 2015
Posts: 490
Location: United States (LA)
Re: A company plans to award prizes to its top 3 salespeople, with the  [#permalink]

Show Tags

02 Apr 2016, 04:56
1
problem is a sitter
First person can be selected in 12C1 ways= 12 ways
second person can be selected in 11C1 ways = 11 ways
third person can be selected in 10C1 ways = 10 ways

total ways = 12*11*10 = 1320 ways
Non-Human User
Joined: 09 Sep 2013
Posts: 13316
Re: A company plans to award prizes to its top 3 salespeople, with the  [#permalink]

Show Tags

31 Oct 2018, 10:07
Hello from the GMAT Club BumpBot!

Thanks to another GMAT Club member, I have just discovered this valuable topic, yet it had no discussion for over a year. I am now bumping it up - doing my job. I think you may find it valuable (esp those replies with Kudos).

Want to see all other topics I dig out? Follow me (click follow button on profile). You will receive a summary of all topics I bump in your profile area as well as via email.
_________________
Re: A company plans to award prizes to its top 3 salespeople, with the   [#permalink] 31 Oct 2018, 10:07
Display posts from previous: Sort by