An extension of Babbage’s criterion for primality
Open Access
- 1 December 2013
- journal article
- Published by Walter de Gruyter GmbH in Mathematica Slovaca
- Vol. 63 (6) , 1179-1182
Abstract
Let n > 1 and k > 1 be positive integers. We show that if $$\left( {\begin{array}{*{20}c} {n + m} \\ n \\ \end{array} } \right) \equiv 1 (\bmod k)$$ for each integer m with 0 ≤ m ≤ n − 1, then k is a prime and n is a power of this prime. In particular, this assertion under the hypothesis that n = k implies that n is a prime. This was proved by Babbage, and thus our result may be considered as a generalization of this criterion for primality.