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

It is currently 18 Sep 2014, 13:50

Close

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

Events & Promotions

Events & Promotions in June
Open Detailed Calendar

Rita and Sam play the following game with n sticks on a

  Question banks Downloads My Bookmarks Reviews Important topics  
Author Message
TAGS:
Senior Manager
Senior Manager
avatar
Joined: 31 Oct 2011
Posts: 331
Followers: 1

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

GMAT Tests User
Rita and Sam play the following game with n sticks on a [#permalink] New post 03 Apr 2012, 12:02
5
This post was
BOOKMARKED
00:00
A
B
C
D
E

Difficulty:

  95% (hard)

Question Stats:

37% (02:58) correct 63% (01:32) wrong based on 273 sessions
Rita and Sam play the following game with n sticks on a table. Each must remove 1,2,3,4, or 5 sticks at a time on alternate turns, and no stick that is removed is put back on the table. Tha one who removes the last stick (or sticks) from the table wins. If Rita goes first, which of the following is a value of n such that Sam can always win no matter how Rita plays?

A. 7
B. 10
C. 11
D. 12
E. 16
[Reveal] Spoiler: OA
Expert Post
5 KUDOS received
Math Expert
User avatar
Joined: 02 Sep 2009
Posts: 29680
Followers: 3497

Kudos [?]: 26371 [5] , given: 2710

Re: Rita and Sam play the following game with n sticks on a [#permalink] New post 03 Apr 2012, 12:21
5
This post received
KUDOS
Expert's post
eybrj2 wrote:
Rita and Sam play the following game with n sticks on a table. Each must remove 1,2,3,4, or 5 sticks at a time on alternate turns, and no stick that is removed is put back on the table. Tha one who removes the last stick (or sticks) from the table wins. If Rita goes first, which of the following is a value of n such that Sam can always win no matter how Rita plays?

A. 7
B. 10
C. 11
D. 12
E. 16


If the number of sticks on a table is a multiple of 6, then the second player will win in any case (well if the player is smart enough).

Consider n=6, no matter how many sticks will be removed by the first player (1, 2, 3 ,4 or 5), the rest (5, 4, 3, 2, or 1) can be removed by the second one.

The same for n=12: no matter how many sticks will be removed by the first player 1, 2, 3 ,4 or 5, the second one can remove 5, 4, 3, 2, or 1 so that to leave 6 sticks on the table and we are back to the case we discussed above.

Answer: D.
_________________

NEW TO MATH FORUM? PLEASE READ THIS: ALL YOU NEED FOR QUANT!!!

PLEASE READ AND FOLLOW: 11 Rules for Posting!!!

RESOURCES: [GMAT MATH BOOK]; 1. Triangles; 2. Polygons; 3. Coordinate Geometry; 4. Factorials; 5. Circles; 6. Number Theory; 7. Remainders; 8. Overlapping Sets; 9. PDF of Math Book; 10. Remainders; 11. GMAT Prep Software Analysis NEW!!!; 12. SEVEN SAMURAI OF 2012 (BEST DISCUSSIONS) NEW!!!; 12. Tricky questions from previous years. NEW!!!;

COLLECTION OF QUESTIONS:
PS: 1. Tough and Tricky questions; 2. Hard questions; 3. Hard questions part 2; 4. Standard deviation; 5. Tough Problem Solving Questions With Solutions; 6. Probability and Combinations Questions With Solutions; 7 Tough and tricky exponents and roots questions; 8 12 Easy Pieces (or not?); 9 Bakers' Dozen; 10 Algebra set. ,11 Mixed Questions, 12 Fresh Meat

DS: 1. DS tough questions; 2. DS tough questions part 2; 3. DS tough questions part 3; 4. DS Standard deviation; 5. Inequalities; 6. 700+ GMAT Data Sufficiency Questions With Explanations; 7 Tough and tricky exponents and roots questions; 8 The Discreet Charm of the DS ; 9 Devil's Dozen!!!; 10 Number Properties set., 11 New DS set.


What are GMAT Club Tests?
25 extra-hard Quant Tests

Get the best GMAT Prep Resources with GMAT Club Premium Membership

Expert Post
Math Expert
User avatar
Joined: 02 Sep 2009
Posts: 29680
Followers: 3497

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

Re: Rita and Sam play the following game with n sticks on a [#permalink] New post 31 May 2013, 05:22
Expert's post
Manager
Manager
avatar
Joined: 14 Nov 2011
Posts: 147
Location: United States
Concentration: General Management, Entrepreneurship
Schools: Stanford '15
GPA: 3.61
WE: Consulting (Manufacturing)
Followers: 0

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

GMAT ToolKit User
Re: Rita and Sam play the following game with n sticks on a [#permalink] New post 03 Jun 2013, 20:57
Bunuel wrote:
eybrj2 wrote:
Rita and Sam play the following game with n sticks on a table. Each must remove 1,2,3,4, or 5 sticks at a time on alternate turns, and no stick that is removed is put back on the table. Tha one who removes the last stick (or sticks) from the table wins. If Rita goes first, which of the following is a value of n such that Sam can always win no matter how Rita plays?

A. 7
B. 10
C. 11
D. 12
E. 16


If the number of sticks on a table is a multiple of 6, then the second player will win in any case (well if the player is smart enough).

Consider n=6, no matter how many sticks will be removed by the first player (1, 2, 3 ,4 or 5), the rest (5, 4, 3, 2, or 1) can be removed by the second one.

The same for n=12: no matter how many sticks will be removed by the first player 1, 2, 3 ,4 or 5, the second one can remove 5, 4, 3, 2, or 1 so that to leave 6 sticks on the table and we are back to the case we discussed above.

Answer: D.



Hi Bunnel,
Please explain this:

N = 12, here 1 and 2 shows steps in a game: rita picks 5 first, out of remaining 7 sam can pick a maximum of 5, which leaves 2 sticks after round one. On her next chance rita can pick 2 and win.

R S
1 5 5
2 2 > Rita wins

similarly:
R S
1 4 5
2 3 > Rita wins
R S
1 2 5
2 5 > Rita wins
R S
1 2 2
2 5 3 > Sam wins
R S
1 2 3
2 5 2 > Sam wins

So both can win when n=12.
I agree for n=6, but not for n=12.
Expert Post
1 KUDOS received
Math Expert
User avatar
Joined: 02 Sep 2009
Posts: 29680
Followers: 3497

Kudos [?]: 26371 [1] , given: 2710

Re: Rita and Sam play the following game with n sticks on a [#permalink] New post 04 Jun 2013, 02:46
1
This post received
KUDOS
Expert's post
cumulonimbus wrote:
Bunuel wrote:
eybrj2 wrote:
Rita and Sam play the following game with n sticks on a table. Each must remove 1,2,3,4, or 5 sticks at a time on alternate turns, and no stick that is removed is put back on the table. Tha one who removes the last stick (or sticks) from the table wins. If Rita goes first, which of the following is a value of n such that Sam can always win no matter how Rita plays?

A. 7
B. 10
C. 11
D. 12
E. 16


If the number of sticks on a table is a multiple of 6, then the second player will win in any case (well if the player is smart enough).

Consider n=6, no matter how many sticks will be removed by the first player (1, 2, 3 ,4 or 5), the rest (5, 4, 3, 2, or 1) can be removed by the second one.

The same for n=12: no matter how many sticks will be removed by the first player 1, 2, 3 ,4 or 5, the second one can remove 5, 4, 3, 2, or 1 so that to leave 6 sticks on the table and we are back to the case we discussed above.

Answer: D.



Hi Bunnel,
Please explain this:

N = 12, here 1 and 2 shows steps in a game: rita picks 5 first, out of remaining 7 sam can pick a maximum of 5, which leaves 2 sticks after round one. On her next chance rita can pick 2 and win.

R S
1 5 5
2 2 > Rita wins

similarly:
R S
1 4 5
2 3 > Rita wins
R S
1 2 5
2 5 > Rita wins
R S
1 2 2
2 5 3 > Sam wins
R S
1 2 3
2 5 2 > Sam wins

So both can win when n=12.
I agree for n=6, but not for n=12.


That;s not correct.

Both players can win BUT if the number of sticks on a table is a multiple of 6, then the second player will win in any case IF the player is smart enough.

n=12: no matter how many sticks will be removed by the first player 1, 2, 3 , 4 or 5, the second one can remove 5, 4, 3, 2, or 1, RESPECTIVELY so that to leave 6 sticks on the table.
_________________

NEW TO MATH FORUM? PLEASE READ THIS: ALL YOU NEED FOR QUANT!!!

PLEASE READ AND FOLLOW: 11 Rules for Posting!!!

RESOURCES: [GMAT MATH BOOK]; 1. Triangles; 2. Polygons; 3. Coordinate Geometry; 4. Factorials; 5. Circles; 6. Number Theory; 7. Remainders; 8. Overlapping Sets; 9. PDF of Math Book; 10. Remainders; 11. GMAT Prep Software Analysis NEW!!!; 12. SEVEN SAMURAI OF 2012 (BEST DISCUSSIONS) NEW!!!; 12. Tricky questions from previous years. NEW!!!;

COLLECTION OF QUESTIONS:
PS: 1. Tough and Tricky questions; 2. Hard questions; 3. Hard questions part 2; 4. Standard deviation; 5. Tough Problem Solving Questions With Solutions; 6. Probability and Combinations Questions With Solutions; 7 Tough and tricky exponents and roots questions; 8 12 Easy Pieces (or not?); 9 Bakers' Dozen; 10 Algebra set. ,11 Mixed Questions, 12 Fresh Meat

DS: 1. DS tough questions; 2. DS tough questions part 2; 3. DS tough questions part 3; 4. DS Standard deviation; 5. Inequalities; 6. 700+ GMAT Data Sufficiency Questions With Explanations; 7 Tough and tricky exponents and roots questions; 8 The Discreet Charm of the DS ; 9 Devil's Dozen!!!; 10 Number Properties set., 11 New DS set.


What are GMAT Club Tests?
25 extra-hard Quant Tests

Get the best GMAT Prep Resources with GMAT Club Premium Membership

Manager
Manager
avatar
Joined: 14 Nov 2011
Posts: 147
Location: United States
Concentration: General Management, Entrepreneurship
Schools: Stanford '15
GPA: 3.61
WE: Consulting (Manufacturing)
Followers: 0

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

GMAT ToolKit User
Re: Rita and Sam play the following game with n sticks on a [#permalink] New post 04 Jun 2013, 18:12
If the number of sticks on a table is a multiple of 6, then the second player will win in any case (well if the player is smart enough).

Consider n=6, no matter how many sticks will be removed by the first player (1, 2, 3 ,4 or 5), the rest (5, 4, 3, 2, or 1) can be removed by the second one.

The same for n=12: no matter how many sticks will be removed by the first player 1, 2, 3 ,4 or 5, the second one can remove 5, 4, 3, 2, or 1 so that to leave 6 sticks on the table and we are back to the case we discussed above.

Answer: D.[/quote]


Hi Bunnel,
Please explain this:

N = 12, here 1 and 2 shows steps in a game: rita picks 5 first, out of remaining 7 sam can pick a maximum of 5, which leaves 2 sticks after round one. On her next chance rita can pick 2 and win.

R S
1 5 5
2 2 > Rita wins

similarly:
R S
1 4 5
2 3 > Rita wins
R S
1 2 5
2 5 > Rita wins
R S
1 2 2
2 5 3 > Sam wins
R S
1 2 3
2 5 2 > Sam wins

So both can win when n=12.
I agree for n=6, but not for n=12.[/quote]

That;s not correct.

Both players can win BUT if the number of sticks on a table is a multiple of 6, then the second player will win in any case IF the player is smart enough.

n=12: no matter how many sticks will be removed by the first player 1, 2, 3 , 4 or 5, the second one can remove 5, 4, 3, 2, or 1, RESPECTIVELY so that to leave 6 sticks on the table.[/quote]

got it. thanks.
is this gmat question ?
Expert Post
8 KUDOS received
Veritas Prep GMAT Instructor
User avatar
Joined: 16 Oct 2010
Posts: 4772
Location: Pune, India
Followers: 1116

Kudos [?]: 5055 [8] , given: 164

Re: Rita and Sam play the following game with n sticks on a [#permalink] New post 04 Jun 2013, 20:26
8
This post received
KUDOS
Expert's post
1
This post was
BOOKMARKED
eybrj2 wrote:
Rita and Sam play the following game with n sticks on a table. Each must remove 1,2,3,4, or 5 sticks at a time on alternate turns, and no stick that is removed is put back on the table. Tha one who removes the last stick (or sticks) from the table wins. If Rita goes first, which of the following is a value of n such that Sam can always win no matter how Rita plays?

A. 7
B. 10
C. 11
D. 12
E. 16


I would like to point out one thing about these questions based on games. These games are made to have a sure shot winner (if both players play intelligently and to win) under certain conditions. If A and B are playing, B's move will be decided by A's move if B has to win i.e. there are complementary moves. For example, in this question, if A picks 2 sticks, B must pick 4 sticks. If A picks 3 sticks, B must pick 3 too. So to solve these questions you need to find this particular complementary relation.

This question tell us that one can pick 1/2/3/4/5 sticks. This means n must be greater than 5 to have a game else the one who picks first will pick all and win. If n = 6, the first one to pick must pick at least 1 and at most 5 sticks leaving anywhere between 5 to 1 sticks for the other player. The other player will definitely win. If n= 7, the first player will pick 1 and leave the other player with 6 sticks. The first player will win. So the object of the game is to leave 6 sticks for your opponent. If the number of sticks is a multiple of 6, you can always make a complementary move to your opponent's move and ensure that you leave your opponent with 6 sticks. For example, if your opponent picks 1 stick, you pick 5, if he picks 2 sticks, you pick 4 and so on.

So when Rita starts, Sam can complement her move each time and leave her with 6 sticks at the end if the total number of sticks is a multiple of 6. There is only one multiple of 6 in the options.
Hence, answer must be (D)
_________________

Karishma
Veritas Prep | GMAT Instructor
My Blog

Save $100 on Veritas Prep GMAT Courses And Admissions Consulting
Enroll now. Pay later. Take advantage of Veritas Prep's flexible payment plan options.

Veritas Prep Reviews

Manager
Manager
avatar
Joined: 07 Apr 2012
Posts: 127
Location: United States
Concentration: Entrepreneurship, Operations
Schools: ISB '15
GMAT 1: 590 Q48 V23
GPA: 3.9
WE: Operations (Manufacturing)
Followers: 0

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

Re: Rita and Sam play the following game with n sticks on a [#permalink] New post 02 Sep 2013, 20:05
so what is the generalisation in such questions or we just have to analyze everytime?
Expert Post
Veritas Prep GMAT Instructor
User avatar
Joined: 16 Oct 2010
Posts: 4772
Location: Pune, India
Followers: 1116

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

Re: Rita and Sam play the following game with n sticks on a [#permalink] New post 02 Sep 2013, 20:28
Expert's post
ygdrasil24 wrote:
so what is the generalisation in such questions or we just have to analyze everytime?


To have a sure shot winner, you need complimentary moves. You have to analyze to figure out the complimentary move every time, of course.
_________________

Karishma
Veritas Prep | GMAT Instructor
My Blog

Save $100 on Veritas Prep GMAT Courses And Admissions Consulting
Enroll now. Pay later. Take advantage of Veritas Prep's flexible payment plan options.

Veritas Prep Reviews

Senior Manager
Senior Manager
User avatar
Joined: 17 Dec 2012
Posts: 395
Location: India
Followers: 13

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

Re: Rita and Sam play the following game with n sticks on a [#permalink] New post 02 Sep 2013, 20:39
ygdrasil24 wrote:
so what is the generalisation in such questions or we just have to analyze everytime?


The trick is to rephrase the question in more general terms. In this case it would be: What is the number that can always be divided into even number of times when each division can be up to 5. The answer is one greater than 5 which is 6 because whatever be the first value chosen, the second value can be chosen such that 6 can always be divided into two. The same idea can be extended to the multiples of 6 such that they can always be divided even number of times given that each division can be from 1 to 5.
_________________

Srinivasan Vaidyaraman
Sravna Test Prep
http://www.sravna.com/courses.php

Classroom Courses in Chennai
Online and Correspondence Courses

SVP
SVP
User avatar
Joined: 09 Sep 2013
Posts: 2420
Followers: 196

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

Premium Member
Re: Rita and Sam play the following game with n sticks on a [#permalink] New post 03 Sep 2014, 14:09
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.
_________________

GMAT Books | GMAT Club Tests | Best Prices on GMAT Courses | GMAT Mobile App | Math Resources | Verbal Resources

Re: Rita and Sam play the following game with n sticks on a   [#permalink] 03 Sep 2014, 14:09
    Similar topics Author Replies Last post
Similar
Topics:
If Sam plays with any toy, it will be his remote controlled grakesh 2 24 Mar 2013, 05:23
1 Experts publish their posts in the topic number of games played GMATD11 4 20 Feb 2011, 08:13
2 number of games played ro86 6 03 Dec 2009, 00:07
Rita and Sam play the following game with n sticks on a Jamesk486 9 14 Jul 2008, 04:51
Earlier average of a game played is 869. You played 10 games forgmat 1 27 Apr 2007, 09:15
Display posts from previous: Sort by

Rita and Sam play the following game with n sticks on a

  Question banks Downloads My Bookmarks Reviews Important topics  


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