求整数任意阶根的有理逼近的计数法
A counting method for finding rational approximates to arbitrary order roots of integers
摘要：
它表明，找到合理的近似m '次根的任何整数的任何精度，只需要有能力计数和区分m个不同类别的对象。对于每个整数N，可以关联一个“替换规则”，该规则从由属于大小为m的有限“字母表”的符号组成的另一个词W生成词W*。这个规则迭代地应用于几乎任何初始字W 0，产生字序列{Wi}，使得字Wi中不同符号的频率随着i趋于无穷大而接近N的m次方
英文摘要：
It is shown that for finding rational approximates to m'th root of any integer to any accuracy one only needs the ability to count and to distinguish between m different classes of objects. To every integer N can be associated a 'replacement rule' that generates a word W* from another word W consisting of symbols belonging to a finite 'alphabet' of size m. This rule applied iteratively on almost any initial word W0, yields a sequence of words {Wi} such that the relative frequency of different symbols in the word Wi approaches powers of the m'th root of N as i tends to infinity
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
