On a class of primality criteria

DOI10.1007/BF02110568MaRDI QIDQ1905255zbMATH OpenOpenAlexFDO

Authors Maxim Vsemirnov

Publication date 1 September 1996

Published in Mathematical Notes (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf02110568

zbMATH Keywords

generalized binomial coefficients primality criteria

Mathematics Subject Classification ID

Factorization; primality (11A51) Binomial coefficients; factorials; (q)-identities (11B65)

Review text

Let \(\binom nk_s\) denote the generalized binomial coefficients defined by \((1+x+ \dots+ x^{s-1})^n= \sum_{k=0}^{n (s-1)} \binom nk_s x^k\), where \(s\geq 2\) is a fixed integer. Generalizing the primality criterion of \textit{H. B. Mann} and \textit{D. Shanks} [J. Comb. Theory, Ser. A 13, 131-134 (1972; Zbl 0239.10010)]\ the author proves that the number \(m\) \((m>1)\) is prime if and only if \(n\mid \binom n{m-2n}_s\) for every \(n\) with \(m/ (s+1)\leq n\leq m/2\).

Recommendations

Cites work

Cited in

(12)

This page was built for publication: On a class of primality criteria

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1905255)