Authors: Roman B. Popovych
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.
Lviv Polytechnic National University
Bandery Str.,12, Lviv, 79013
Ukraine
E-mail:
Fulltext

–
0.10 Mb