The Games-Chan algorithm finds the minimal period of a periodic binary sequence of period $2^n$, in $n$ iterations. We generalise this to periodic $q$-ary sequences (where $q$ is a prime power) using generating functions and polynomials and apply this to find the multiplicity of $x-1$ in a $q$-ary polynomial $f$ in $\log_{\,q}\deg(f)$ iterations.
翻译:奥运会-詹运算法发现周期二进制的最低限度时间是2美元,以美元迭代为单位。我们用生成函数和多元体计算,将其概括为1美元定期序列(以美元为主要电源),并运用此方法在美元-美元多元体美元中以美元/克-德格(f)的迭代法,以美元/克-克-德格(f)的折迭法找到x-1美元的倍数。