相关论文: Twelve new primitive binary trinomials

For each integer $n\ge 2$, we identify new infinite families of monogenic trinomials $f(x)=x^n+Ax^m+B$ with non-squarefree discriminant, many of which have small Galois group. These families are thus different from many previous…

We have calculated on the computer the sum $\bar{\BB}_M$ of reciprocals of all 47 known Mersenne primes with the accuracy of over 12000000 decimal digits. Next we developed $\bar{\BB}_M$ into the continued fraction and calculated…

The previous paper [4] proved the existence of primitive polynomials and primitive normal polynomials of degree n with k prescribed coefficients in the finite field GF(q) for all sufficiently large q. This paper presents a loger versions of…

We make many new observations on primitive roots modulo primes. For an odd prime $p$ and an integer $c$, we establish a theorem concerning $\sum_g(\frac{g+c}p)$, where $g$ runs over all the primitive roots modulo $p$ among $1,\ldots,p-1$,…

Swan (Pacific J. Math. 12(3) (1962), 1099-1106) characterized the parity of the number of irreducible factors of trinomials over $F_2$. Many researchers have recently obtained Swan-like results on determining the reducibility of polynomials…

We construct four new classes of permutation trinomials over the cubic extension of a finite field with even characteristic. Additionally, we explicitly provide the compositional inverse of each class of permutation trinomials in polynomial…

The concept of Mersenne primes is studied in real quadratic fields of class number 1. Computational results are given. The field $Q(\sqrt{2})$ is studied in detail with a focus on representing Mersenne primes in the form $x^{2}+7y^{2}$. It…

We give a new proof of Fitzgerald's criterion for primitive polynomials over a finite field. Existing proofs essentially use the theory of linear recurrences over finite fields. Here, we give a much shorter and self-contained proof which…

We prove that any pair of bivariate trinomials has at most 5 isolated roots in the positive quadrant. The best previous upper bounds independent of the polynomial degrees counted only non-degenerate roots and even then gave much larger…

We give an algorithm to enumerate all primitive abundant numbers (briefly, PANs) with a fixed $\Omega$ (the number of prime factors counted with their multiplicity), and explicitly find all PANs up to $\Omega=6$, count all PANs and…

We study properties of recently introduced Wieferich primes for Drinfeld modules, as their relation with Fermat equations and finitess or non-finiteness of their number. We also introduce Mersenne numbers for Drinfeld modules, and study the…

We prove a conjecture by Tu, Zeng, Li, and Helleseth concerning trinomials $f_{\alpha,\beta}(x)= x + \alpha x^{q(q-1)+1} + \beta x^{2(q-1)+1} \in \mathbb{F}_{q^2}[x]$, $\alpha\beta \neq 0$, $q$ even, characterizing all the pairs…

The equality between the number of odd spin structures on a Riemann surface of genus g, with $2^g - 1$ being a Mersenne prime, and the even perfect numbers, is an indication that the action of the modular group on the set of spin structures…

Let $p$ be an odd prime and $e$ be a positive integer. We completely explain the permutation binomials and trinomials arising from the reversed Dickson polynomials of the $(k+1)$-th kind $D_{n,k}(1,x)$ over $\mathbb{F}_{p^e}$ when…

In this article we study the irreducibility of polynomials of the form $x^n+\epsilon_1 x^m+p^k\epsilon_2$, $p$ being a prime number. We will show that they are irreducible for $m=1$. We have also provided the cyclotomic factors and…

Motivated by recent results on the constructions of permutation polynomials with few terms over the finite field $\mathbb{F}_{2^n}$, where $n$ is a positive even integer, we focus on the construction of permutation trinomials over…

We show that, apart from some obvious exceptions, the number of trinomials vanishing at given complex numbers is bounded by an absolute constant. When the numbers are algebraic, we also bound effectively the degrees and the heights of these…

Classifications of twin primes are established and then applied to triplets that generalize to all higher multiplets. Mersenne and Fermat twins and triplets are treated in this framework. Regular prime number multiplets are related to…

In this article, we derive lower bounds for the number of distinct prime divisors of families of non-zero Fourier coefficients of non-CM primitive cusp forms and more generally of non-CM primitive Hilbert cusp forms. In particular, for the…

Suppose x^m + c*x^n is a permutation polynomial over GF(p), where p>5 is prime, m>n>0, and c is in GF(p)^*. We prove that gcd(m-n,p-1) is not 2 or 4. In the special case that either (p-1)/2 or (p-1)/4 is prime, this was conjectured in a…