Modular periodicity of binomial coefficients
数论
2007-05-23 v2
摘要
We prove that if the signed binomial coefficient viewed modulo p is a periodic function of i with period h prime to p in the range , then k+1 is a power of p, provided h is not too large compared to k. (In particular, suffices.) As an application, we prove that if G and H are multiplicative subgroups of a finite field, with H<G, and such that for all , then is a subfield.
引用
@article{arxiv.math/0510100,
title = {Modular periodicity of binomial coefficients},
author = {Sandro Mattarei},
journal= {arXiv preprint arXiv:math/0510100},
year = {2007}
}
备注
8 pages. Somehow, the references were missing in the previous version. An error in the abstract (but not in the main text) of the printed version is corrected here: h needs to be prime to p