Roman B. Popovych, “Lower bound on product of binomial coefficients”, Bul. Acad. Ştiinţe Repub. Mold. Mat., 2015, Number 2,Pages <nobr>21

Research articles

Lower bound on product of binomial coefficients

Roman B. Popovych

Lviv Polytechnic National University, Bandery Str., 12, Lviv, 79013, Ukraine

Abstract: We give a lower bound on a product of binomial coefficients, connected with primality proving or construction of high multiplicative order elements in finite fields.

Keywords and phrases: product of binomial coefficients, primality proving, certificate, finite field, multiplicative order, lower bound.

MSC: 05E40, 11T30

Received: 13.12.2013
Revised: 27.07.2015

Language: English