arXiv · math/0510100
Modular periodicity of binomial coefficients
Abstract
We prove that if the signed binomial coefficient $(-1)^i\binom{k}{i}$ viewed modulo p is a periodic function of i with period h prime to p in the range $0\le i\le k$, then k+1 is a power of p, provided h is not too large compared to k. (In particular, $2h\le k$ suffices.) As an application, we prove that if G and H are multiplicative subgroups of a finite field, with H<G, and such that $1-α\in G$ for all $α\in G\setminus H$, then $G\cup\{0\}$ is a subfield.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Sandro Mattarei. 2006-11-23. Modular periodicity of binomial coefficients. https://doi.org/10.1016/j.jnt.2005.07.005
Cite the original work for its findings. Save a collection to share your selection of sources.