本原多项式 meaning in Chinese

primitive polynomial

Study on the degree of trinomials which multiple of prime multinomial on gf
上本原多项式的三项倍式的次数研究
By making use of two kinds of exponential sums and cohen ' s sieve , we better the lower bound concerning the number of primitive elements and also prove the existence of primitive polynomials with a1 , a2 prescribed when n = 5 , 6 . in the remaining of the paper we study primitive elements in the form of a + a - 1 over finite fields . a counting formula is given as a result , as well as all the finite fields that do not have such elements
本文对n = 5 ， 6两种情形，利用有限域上的两类特征和估计及cohen筛法[ 5 ] [ 7 ] ，改进了[ 10 ] [ 11 ]中关于方程组本原元解个数的下界，并得到在特征为奇的有限域上存在可预先指定前两项系数的n次本原多项式。