Combinatorial game theory - StudentOfFortune.com

Question

Asked by:

Rating : No Rating
Questions Asked: 2
Tutorials Posted: 0

$10.00 Combinatorial game theory

From Mathematics: General-Mathematics , Mathematics: General-Mathematics
Closed, but you can still post tutorials
Due on Jan. 21, 2009
Asked on Jan 18, 2009 at 1:18:05PM

Q:
Can somebody help me to understand the proof of Ferguson's pairing property which is in the book winning ways written by Guy and some other writers.

Attachments:

joaog asked: what is the name of the book? and in which page(s) is the proof?
To which peteryellow said: http://books.google.com/books?id=_1pl8so-qsIC&pg=PA86&lpg=PA86&dq=pairing+property+%2B+guy&source=bl&ots=_pH2J5o43_&sig=5Zhoxdv3-iq0I8IaCPwAFFcH3RE&hl=en&sa=X&oi=book_result&resnum=1&ct=result page 86 the proof is there I dont understand it completely? can you help me to understand the proof completely? and the theorem is called Ferguson's pairing property

Available Tutorials to this Question

Posted by:

Criticalcaremeic
Rating (5): D
Questions Asked: 0
Tutorials Posted: 13, earned $181.23

$10.00 I have listed a story that explans his theory and have included a step by step process that shows his theory

This tutorial hasn't been purchased yet.
Posted on Jan 20, 2009 at 09:33:25PM

A:
Preview: ... ion. If n is the least number for which the above box statement fails we have either G(n)=1 and G(n-s1) not =0 or G(n-s1)=0 and G(n) not=1 these imply G(n-s1-Sk)=0 for some Sk which implies inductively G(n-Sk)=1 which implies G(n) not=1 or G(n-Sk)=1 for some Sk which implies inductively G(n-Sk-S1)=0 which implies G(n-S1) not=0 Thomas Shelburne Ferguson was born in Oakland, California, on December 14, 1929. He grew up in Alameda near San Francisco, where he received his high school education. In 1947 he entered University of California at Berkeley to study Mathematics. He soon became interested in the three subjects to which he stayed faithful ever since: Probability, Statistics and Game Theory. He earned his Ph.D. from Berkeley in 1956. His thesis consisted of two parts: 1. Best asymptotic normal estimation. 2. Existence of linear regression in structural equations. His supervisor was Lucien Le Cam (see also the following note). Other distinguished names in the scientific environment in which Ferguson's talent was able to grow were Jerzy Neyman, Erich Lehmann, Michel Loeve and Da ...

The full tutorial is about 791 words long .