论文标题
Fagan的建筑，奇怪的根和Tchoukaillon Solitaire
Fagan's Construction, Strange Roots, and Tchoukaillon Solitaire
论文作者
论文摘要
在本文中，我们研究了一个程序，该程序从整数$ n $开始时，会导致一对不超过$ n $的同等整数。我们将结果值称为$ n $的\ textit {奇怪的root}，我们展示了如何将这种奇怪的绑定过程与Tchoukaillon Solitaire的游戏紧密链接。我们反向分析了奇怪的根调格过程，以确定何时规定的值是最多两个整数的奇怪根源。我们提出了一个关于奇怪根源的猜想，并将这种猜想转化为涉及Tchoukaillon Solitaire的猜想。
In this paper we examine a procedure that, on starting with an integer $n$, results in a pair of equal integers that are no greater than $n$. We call the resulting value the \textit{strange root} of $n$ and we show how this strange-root-finding procedure is intimately linked to the game of Tchoukaillon solitaire. We analyze the strange-root-finding procedure in reverse to determine when a prescribed value is the strange root of at most two integers. We present a conjecture about strange roots and translate this conjecture into one involving Tchoukaillon solitaire.
