2000 character limit reached
Periodic Sequences modulo $m$
Published 10 Sep 2012 in math.NT | (1209.2371v3)
Abstract: We give a few remarks on the periodic sequence $a_n=\binom{n}{x}~(mod~m)$ where $x,m,n\in \mathbb{N}$, which is periodic with minimal length of the period being $$\ell(m,x)={\displaystyle\prodw_{i=1}p{\lfloor\log_{p_i}x\rfloor+b_i}i}=m{\displaystyle\prodw{i=1}p{\lfloor\log_{p_i}x\rfloor}_i}$$ where $m=\prodw_{i=1}p{b_i}_i$. We prove certain interesting properties of $\ell(m,x)$ and derive a few other results and congruences.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.