z-logo
open-access-imgOpen Access
Lower bounds on the orders of subgroups connected with Agrawal conjecture
Author(s) -
Roman Popovych
Publication year - 2013
Publication title -
carpathian mathematical publications
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.63
H-Index - 4
eISSN - 2313-0210
pISSN - 2075-9827
DOI - 10.15330/cmp.5.2.310-314
Subject(s) - primality test , conjecture , mathematics , combinatorics , multiplicative function , discrete mathematics , field (mathematics) , prime (order theory) , pure mathematics , mathematical analysis
Explicit lower bounds are obtained on the multiplicative orders of subgroups of a finite field connected with primality proving algorithm.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom