Variations of a Coin-Removal Problem

Details Variations of a Coin-Removal Problem Variations of a Coin-Removal Problem

2004-11-02

arxiv.org/abs/math/0411052v1

Mathematics

Combinatorics

13 pages, 4 figures

Scientific paper

Given a set of coins arranged in a line, we remove heads-up coins one at a time and flip any adjacent coins after each removal. The coin-removal problem is to determine for which arrangements of coins it is possible to remove all of the coins. In this paper we consider a variation of the problem in which gaps created by removing coins are eliminated by pushing the coins together. We characterize the set of removable arrangements and show that this set forms a regular language. We use a finite automaton to find a recursive formula for the number of removable arrangements of different lengths.

Affiliated with

Also associated with

No associations

Rating

Variations of a Coin-Removal Problem does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Variations of a Coin-Removal Problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Variations of a Coin-Removal Problem will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-340339