Periodic Sequences modulo m
classification
🧮 math.NT
keywords
periodicproddisplaystylelfloorrfloorbinomcertaincongruences
read the original 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\prod^w_{i=1}p^{\lfloor\log_{p_i}x\rfloor+b_i}_i}=m{\displaystyle\prod^w_{i=1}p^{\lfloor\log_{p_i}x\rfloor}_i}$$ where $m=\prod^w_{i=1}p^{b_i}_i$. We prove certain interesting properties of $\ell(m,x)$ and derive a few other results and congruences.
This paper has not been read by Pith yet.
Forward citations
Cited by 1 Pith paper
-
Optimal Lower Bounds for Symmetric Modular Circuits
Symmetric MOD_m circuits require subexponential size to compute n-ary AND, with the bound matched by known depth-2 constructions.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.