11 research outputs found
On the number of -free elements with prescribed trace
In this paper we derive a formula for the number of -free elements over a
finite field with prescribed trace, in particular trace zero, in
terms of Gaussian periods. As a consequence, we derive a simple explicit
formula for the number of primitive elements, in quartic extensions of Mersenne
prime fields, having absolute trace zero. We also give a simple formula in the
case when is prime. More generally, for a positive integer
whose prime factors divide and satisfy the so called semi-primitive
condition, we give an explicit formula for the number of -free elements with
arbitrary trace. In addition we show that if all the prime factors of
divide , then the number of primitive elements in , with
prescribed non-zero trace, is uniformly distributed. Finally we explore the
related number, , of elements in with
multiplicative order and having trace . Let such that , where is the largest factor of
with the same radical as that of . We show there exists an element in
of (large) order with trace if and only if and . Moreover we derive an explicit formula for the
number of elements in with the corresponding large order
and having absolute trace zero, where is a Mersenne
prime
Twelve new primitive binary trinomials
We exhibit twelve new primitive trinomials over GF(2) of record degrees 42 643 801, 43 112 609, and 74 207 281. In addition we report the first Mersenne exponent not ruled out by Swan's theorem [10] — namely 57 885 161 — for which none primitive trinomial exists. This completes the search for the currently known Mersenne prime exponents
Testing Irreducibility of Trinomials over GF(2)
The focus of this paper is testing the irreducibility of polynomials over finite fields. In particular there is an emphasis on testing trinomials over the finite field GF(2). We also prove a the probability of a trinomial satisfying Swan\u27s theorem is asymptotically 5/8 as n goes to infinity
Properties of digital representations
Let be a finite subset of including and be the number of ways to write , where . The sequence is always periodic, and is typically more often even than odd. We give four families of sets with such that the proportion of odd 's goes to as . We also consider asymptotics of the summatory function and show that for some
The great trinomial hunt
A trinomial is a polynomial in one variable with three nonzero terms, for example P = 6x 7 + 3x 3 − 5. If the coefficients of a polynomial P (in this case 6, 3, −5) are in some ring or field F, we say that P is a polynomia