Wythoff's sequence and \(N\)-heap Wythoff's conjectures (Q2570115): Difference between revisions

Let us define a Wythoff's sequence as a sequence of pairs of integers \(\{(A_n,B_n)\}_{n>N_0}\) such that there exists a finite set of integers \(T,A_n = mex(\{A_i,B_i:i<n\}\cup T),B_n-A_n=n\), and \(\{B_n\}\cap T=\emptyset\). Recall that for a set of nonnegative integers \(S,mex(S)=\min(\mathbb Z_{\leq 0}-S)\) is the minimal exclusive value of \(S\). Structural properties and behaviors of Wythoff's sequence are investigated. The main result is that for such a sequence, there always exists an integer \(\alpha\) such that when \(n\) is large enough, \(| A_n-[n\phi]-\alpha| \leq 1\), where \(\phi=(1+\sqrt5)/2\), the golden section. The value of \(\alpha\) can can also be easily determined by a relatively small number of pairs in the sequence. Finally the author proves the equivalency of the two kinds of so-called Wythoff's game.