Roman B. Popovych, “Lower bound on product of binomial coefficients”, Bul. Acad. Ştiinţe Repub. Mold. Mat., 2015, номер 2,страницы 21

Research articles

Lower bound on product of binomial coefficients

Roman B. Popovych

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

Аннотация: 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.

Ключевые слова и фразы: product of binomial coefficients, primality proving, certificate, finite field, multiplicative order, lower bound.

MSC: 05E40, 11T30

Поступила в редакцию: 13.12.2013
Исправленный вариант: 27.07.2015

Язык публикации: английский