Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash 79 tok/s
Gemini 2.5 Pro 49 tok/s Pro
GPT-5 Medium 45 tok/s
GPT-5 High 43 tok/s Pro
GPT-4o 103 tok/s
GPT OSS 120B 475 tok/s Pro
Kimi K2 215 tok/s Pro
2000 character limit reached

A remark on periods of periodic sequences modulo $m$ (2006.12002v1)

Published 22 Jun 2020 in math.NT

Abstract: 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 $$Si 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 $Si F(a,b)n $ is the i-th partial sum sequence successively defined by $Si 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$.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

Summary

We haven't generated a summary for this paper yet.

Dice Question Streamline Icon: https://streamlinehq.com

Follow-up Questions

We haven't generated follow-up questions for this paper yet.

Authors (1)

Don't miss out on important new AI/ML research

See which papers are being discussed right now on X, Reddit, and more:

“Emergent Mind helps me see which AI papers have caught fire online.”

Philip

Philip

Creator, AI Explained on YouTube