Related papers: On consecutive primitive elements in a finite fiel…

In this paper we strengthen Kolchin's theorem ([1]) in the ordinary case. It states that if a differential field $E$ is finitely generated over a differential subfield $F \subset E$, $trdeg_F E < \infty$, and $F$ contains a nonconstant,…

We prove the following propositions. Theorem 1: Let $M$ be a subfield of a fixed algebraic closure $\tilde \Q$ of $\Q$ whose existential elementary theory is decidable (resp. primitively decidable). Then, M is conjugate to a recursive…

Erd\H{o}s proved that $\mathcal{F}(A) := \sum_{a \in A}\frac{1}{a\log a}$ converges for any primitive set of integers $A$ and later conjectured this sum is maximized when $A$ is the set of primes. Banks and Martin further conjectured that…

Suppose $q$ is a prime power and $f\in\mathbb{F}_q[x]$ is a univariate polynomial with exactly $t$ monomial terms and degree $<q-1$. To establish a finite field analogue of Descartes' Rule, Bi, Cheng, and Rojas (2013) proved an upper bound…

We give a construction and equations for good recursive towers over any finite field $\mathbf{F}_q$ with $q \ne 2$ and $3$.

Let $q$ be a prime power and $m>1$ be any integer. Let $\mathbb F_{q^m}$ be the finite field of order $q^m$ and $\theta\in\mathbb F_{q^m}$ be such that $\mathbb F_{q^m} = \mathbb F(\theta)$. We obtain a nontrivial bound for the mixed…

We say a natural number~$n$ is abundant if $\sigma(n)>2n$, where $\sigma(n)$ denotes the sum of the divisors of~$n$. The aliquot parts of~$n$ are those divisors less than~$n$, and we say that an abundant number~$n$ is pseudoperfect if there…

Let $q$ be a power of a prime and let $\mathbb{F}_q$ be the finite field consisting of $q$ elements. We establish new explicit estimates on Gauss sums of the form $S_n(a) = \sum_{x\in \mathbb{F}_q}\psi_a(x^n)$, where $\psi_a$ is a…

In this paper, we estimate the number of $\mathbb{F}_q$-primitive points on the affine hypersurface defined by the equation $f(x_1,\ldots,x_s)=0$, where $f\in\mathbb{F}_q[x_1,\dots,x_s]$ is an appropriate polynomial. In particular, we…

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…

Let $r$ be a positive divisor of $q-1$ and $f(x,y)$ a rational function of degree sum $d$ over $\mathbb{F}_q$ with some restrictions, where the degree sum of a rational function $f(x,y) = f_1(x,y)/f_2(x,y)$ is the sum of the degrees of…

Let $\mathbb{F}_q$ denote the finite field with $q$ elements where $q=p^l$ is a prime power. Using Fourier analytic tools with a third moment method, we obtain sum-product type estimates for subsets of $\mathbb{F}_q$. In particular, we…

For prime powers q<100, we compute new upper and lower bounds on N_q(4), the maximal number of points on a genus-4 curve over a finite field with q elements. We determine the exact value of N_q(4) for 17 prime powers q for which the value…

By some extremely simple arguments, we point out the following: (i) If n is the least positive k-th power non-residue modulo a positive integer m, then the greatest number of consecutive k-th power residues mod m is smaller than m/n. (ii)…

Let $\mathbb{F}_q[t]$ denote the ring of polynomials over $\mathbb{F}_q$, the finite field of $q$ elements. Suppose the characteristic of $\mathbb{F}_q$ is not $2$ or $3$. In this paper, we prove an $\mathbb{F}_q[t]$-analogue of results…

We prove that any prime $p$ satisfying $\phi(p-1)\leq (p-1)/4$ contains two consecutive quadratic non-residues modulo $p$ neither of which is a primitive root modulo $p$.

Let $\mathcal{S}_q$ denote the group of all square elements in the multiplicative group $\mathbb{F}_q^*$ of a finite field $\mathbb{F}_q$ of odd characteristic containing $q$ elements. Let $\mathcal{O}_q$ be the set of all odd order…

Fix coprime natural numbers $a,q$. Assuming the Prime $k$-tuple Conjecture, we show that there exist arbitrarily long arithmetic progressions of Carmichael numbers, each of which lies in the reduced residue class $a$ mod $q$ and is a…

The results for the fractional sequence $\left \{[x/n]+1:n \leq x\right \}$, and the fractional sequence in arithmetic progression $\left \{q[x/n]+a:n \leq x\right \}$, where $a<q$ are integers such that $\gcd(a,q)=1$, prove that these…

Consider the power pseudorandom-number generator in a finite field ${\mathbb F}_q$. That is, for some integer $e\ge2$, one considers the sequence $u,u^e,u^{e^2},\dots$ in ${\mathbb F}_q$ for a given seed $u\in {\mathbb F}_q^\times$. This…