Subtraction games with FES sets of size 3

Details Subtraction games with FES sets of size 3 Subtraction games with FES sets of size 3

2012-01-16

arxiv.org/abs/1201.3299v1

Mathematics

Combinatorics

7 pages, including 2 pages of data

Scientific paper

This paper extends the work done by Angela Siegel on subtraction games in which the subtraction set is N \ X for some finite set X. Siegel proves that for any finite set X, the G-sequence is ultimately arithmetic periodic, and that if |X| = 1 or 2, then it is purely arithmetic periodic. This note proves that if |X| = 3 then the G-sequence is purely arithmetic periodic. It is known that for |X| \geq 4 the sequence is not always purely arithmetic periodic.

Affiliated with

Also associated with

No associations

Rating

Subtraction games with FES sets of size 3 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 Subtraction games with FES sets of size 3, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Subtraction games with FES sets of size 3 will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-410420