Tessellate S.T.E.M.S - Computer Science - College - Set 2 - Subjective Problem

There were three brothers: Ignotus, Antioch and Cadmus.

They are playing a game with nn pebbles, where the brothers take turns. Ignotus goes first followed by Antioch and then by Cadmus and this game goes on. During each turn, each of the brother removes either 1, 2 or 3 pebbles from the pile. The winner is one who takes the last pebble from the pile.

However, Ignotus knows that Cadmus will never draw the same number of pebbles from the pile as Antioch did in during his turn in the same round.

With this knowledge, for what values of nn can Ignotus win the game?


This problem is a part of Tessellate S.T.E.M.S.

#ComputerScience

Note by Agnishom Chattopadhyay
3 years, 5 months ago

No vote yet
1 vote

  Easy Math Editor

This discussion board is a place to discuss our Daily Challenges and the math and science related to those challenges. Explanations are more than just a solution — they should explain the steps and thinking strategies that you used to obtain the solution. Comments should further the discussion of math and science.

When posting on Brilliant:

  • Use the emojis to react to an explanation, whether you're congratulating a job well done , or just really confused .
  • Ask specific questions about the challenge or the steps in somebody's explanation. Well-posed questions can add a lot to the discussion, but posting "I don't understand!" doesn't help anyone.
  • Try to contribute something new to the discussion, whether it is an extension, generalization or other idea related to the challenge.
  • Stay on topic — we're all here to learn more about math and science, not to hear about your favorite get-rich-quick scheme or current world events.

MarkdownAppears as
*italics* or _italics_ italics
**bold** or __bold__ bold

- bulleted
- list

  • bulleted
  • list

1. numbered
2. list

  1. numbered
  2. list
Note: you must add a full line of space before and after lists for them to show up correctly
paragraph 1

paragraph 2

paragraph 1

paragraph 2

[example link](https://brilliant.org)example link
> This is a quote
This is a quote
    # I indented these lines
    # 4 spaces, and now they show
    # up as a code block.

    print "hello world"
# I indented these lines
# 4 spaces, and now they show
# up as a code block.

print "hello world"
MathAppears as
Remember to wrap math in \( ... \) or \[ ... \] to ensure proper formatting.
2 \times 3 2×3 2 \times 3
2^{34} 234 2^{34}
a_{i-1} ai1 a_{i-1}
\frac{2}{3} 23 \frac{2}{3}
\sqrt{2} 2 \sqrt{2}
\sum_{i=1}^3 i=13 \sum_{i=1}^3
\sin \theta sinθ \sin \theta
\boxed{123} 123 \boxed{123}

Comments

The goal seems to be to leave the other brothers with 6. Then (since they can't take 3+3, or 1+1) whatever they take, Ignotus can take the last pebble.

With 6 being a goal, leaving the other brothers with 12 gets you to 6 by the same strategy. Extrapolating, leaving them with any multiple of 6 is a winning play.

Therefore, winning values of n for Ignotus are whole numbers of the form 6m+1, 6m+2, and 6m+3.

Steven Perkins - 3 years, 5 months ago

Log in to reply

Nice solution. A very similar generalization of this game is called the Nim

Agnishom Chattopadhyay - 3 years, 4 months ago

Log in to reply

I was familiar with Nim as a two person game. This three person variant was interesting.

Steven Perkins - 3 years, 4 months ago
×

Problem Loading...

Note Loading...

Set Loading...