Related papers: Twelve new primitive binary trinomials
Consider polynomials over ${\rm GF}(2)$. We describe efficient algorithms for finding trinomials with large irreducible (and possibly primitive) factors, and give examples of trinomials having a primitive factor of degree $r$ for all…
We describe a search for primitive trinomials of high degree and its interaction with the Great Internet Mersenne prime search (GIMPS). The search is complete for trinomials whose degree is the exponent of a Mersenne prime, for all 47…
Permutation trinomials over finite fields consititute an active research due to their simple algebraic form, additional extraordinary properties and their wide applications in many areas of science and engineering. In the present paper, six…
The construction of permutation trinomials of the form $X^r(X^{\alpha (2^m-1)}+X^{\beta(2^m-1)} + 1)$ over $\F_{2^{2m}}$, where $m,~r\text{ and }\alpha > \beta$ are positive integers, is an active area of research. Several classes of…
We give several characterizations of Mersenne primes (Theorem 1.1) and of primes for which 2 is a primitive root (Theorem 1.2). These characterizations involve group algebras, circulant matrices, binomial coefficients, and bipartite graphs.
This paper first proves what the author called the Eight Levels Theorem and then highlights a new explicit expansion approach to Lucas-Lehmer primality test for Mersenne primes and gives a new criterion for Mersenne compositeness. Also, we…
In the present article we introduce three new notions which are called Gaussian Mersenne Lucas numbers, Mersenne Lucas polynomials and Gaussian Mersenne Lucas polynomials. We present and prove our exciting properties and results of them…
We consider the problem of enumeration of primitive TSRs of order n over any finite field. Here we prove the existence of primitive TSRs of order two over binary field extensions. Moreover we give a general search algorithm for primitive…
The Mersenne primes are primes which can be written as some prime power of 2 minus 1. These primes were studied from antiquity in that their close connection with perfect numbers and even to present day in that their easiness for primality…
We study the connection between the Mersenne numbers $M(n) = 2^n-1$ and the dynamics of the angle-doubling map. Within this framework, we develop an algorithm to compute divisors of Mersenne numbers without explicitly evaluating $M(n)$.…
In this paper, we show that the exponent set of nonnegative primitive tensors with order m(\geq 3) and dimension n is {1,2,\ldots, (n-1)^2+1}; and propose some open problems for further research.
We prove lower bounds of the form $\gg N/(\log N)^{3/2}$ for the number of primes up to $N$ primitively represented by a shifted positive definite integral binary quadratic form, and under the additional condition that primes are from an…
In this paper, we prove: Let A be a nonnegative primitive tensor with order m and dimension n. Then its primitive degree R(A)\leq (n-1)^2+1, and the upper bound is sharp. This confirms a conjecture of Shao [7].
For a positive integer $m$, a (positive definite integral) quadratic form is called primitively $m$-universal if it primitively represents all quadratic forms of rank $m$. It was proved in arXiv:2202.13573 that there are exactly $107$…
Two classes of ternary bent functions of degree four with two and three terms in the univariate representation that belong to the completed Maiorana-McFarland class are found. Binomials are mappings $\F_{3^{4k}}\mapsto\fthree$ given by…
We demonstrate, using character sum arguments, the existence of primitive polynomials of degree n over a finite field GF(q) with the coefficients for x^(n-1), x^(n-2), and x^(n-3) prescribed, so long as char(GF(q)) is at least 5 and n is at…
New Mersenne conjectures. The problems of simplicity, common prime divisors and free from squares of numbers $L(n) = 2^{2n}\pm2^n\pm1$ are investigated. Wonderful formulas $gcd $ for numbers $L (n) $ and numbers repunit are proved.
The non-associative exponential series $exp(x)$ is a power series with monomials from the magma $M$ of finite, planar rooted trees. The coefficient $a(t)$ of $exp(x)$ relative to a tree $t$ of degree $n$ is a rational number and it is shown…
Permutation polynomials over finite fields have wide applications in many areas of science and engineering. In this paper, we present six new classes of permutation trinomials over $\mathbb{F}_{2^n}$ which have explicit forms by determining…
D.H. Lehmer found a quadratic polynomial such that 326 is a primitive root for the first 206 primes represented by this polynomial. It is shown that this is related to the class number one problem and prime producing quadratics. An…