BREAKING: Target Test Prep releases Brand New 2026 On Demand GMAT prep course

Redeem

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

This topic has expert replies
Post new topic Post Reply
Previous Topic Next Topic
Legendary Member
Posts: 2276
Joined: Sat Oct 14, 2017 6:10 am
Followed by:3 members

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

by VJesus12 » Sun Jun 21, 2020 2:57 am

Timer

00:00

Your Answer

A

B

C

D

E

Global Stats

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

[spoiler]OA=D[/spoiler]

Source: Official Guide
Top
Source: — Problem Solving |
Post new topic Post Reply
• Page 1 of 1