arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2006.12002math.NT
收藏

关于模$m$周期序列周期的一个注记

A remark on periods of periodic sequences modulo $m$

Shoji Yokura

摘要:

令$\{G_n\}$是整数模$m$的周期序列,并且令$\{SG_n\}$是由$SG_n:= \sum_{k=0}^nG_k $(mod $m$)定义的部分和序列。给出了$\{SG_n\}$周期的计算公式。我们还表明,对于广义Fibonacci序列$F(a,b)_n$,使$F(a,b)_0=a$和$F(a,b)_1=b$,我们有$$S^i F(a,b)_n = S^{i-1}F(a,b)_{n+2}-{n+i \choose i-2}a-{n+i \choose i-1} b$$,其中$S^i F(a,b)_n $是由$S^i F(a,b)_n := \sum_{k=0}^n S^{i-1}F(a,b)_k$连续定义的第i个部分和序列。这是斐波纳契数列$F_n$的著名公式$$\sum_{k=0}^n F_k = F_{n+2} -1$$的推广版本。

英文摘要:

Let $\{G_n\}$ be a periodic sequence of integers modulo $m$ and let $\{SG_n\}$ be the partial sum sequence defined by $SG_n:= \sum_{k=0}^nG_k $ (mod $m$). We give a formula for the period of $\{SG_n\}$. We also show that for a generalized Fibonacci sequence $F(a,b)_n$ such that $F(a,b)_0=a$ and $F(a,b)_1=b$, we have $$S^i F(a,b)_n = S^{i-1}F(a,b)_{n+2}-{n+i \choose i-2}a-{n+i \choose i-1} b$$ where $S^i F(a,b)_n $ is the i-th partial sum sequence successively defined by $S^i F(a,b)_n := \sum_{k=0}^n S^{i-1}F(a,b)_k$. This is a generalized version of the well-known formula $$\sum_{k=0}^n F_k = F_{n+2} -1$$ of the Fibonacci sequence $F_n$.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑