Related papers: On arithmetic progressions in finite fields

We investigate whether there exists an arithmetic progression or geometric progression consisting only palindromic numbers. In this paper we show that the answer to this question is NO. Given the first and final term we will also give an…

For $q$ an odd prime power, we prove that there are always four consecutive primitive elements in the finite field $\mathbb{F}_{q}$ when $q> 2401$.

In this paper we generalize the results of Sharma, Awasthi and Gupta (see \cite{SAG}). We work over a field of any characteristic with $q = p^k$ elements and we give a sufficient condition for the existence of a primitive element $\alpha…

We establish a function field analogue of Mertens' formula for Euler products restricted to primes in arithmetic progressions over the polynomial ring F_q[t]. Our results are in direct correspondence with those of Languasco and Zaccagnini…

In 1975 Szemer\'edi proved that a set of integers of positive upper density contains arbitrarily long arithmetic progressions. Bergelson and Leibman showed in 1996 that the common difference of the arithmetic progression can be a square, a…

Let $r > 0$ be an integer, let $\mathbb{F}_q$ be a finite field of $q$ elements, and let $\mathcal{A}$ be a nonempty proper subset of $\mathbb{F}_q$. Moreover, let $\mathbf{M}$ be a random $m \times n$ rank-$r$ matrix over $\mathbb{F}_q$…

The classical problem of whether $m$th-powers with or without zero in a finite field $\mathbb{F}_q$ form a difference set has been extensively studied, and is related to many topics, such as flag transitive finite projective planes. In this…

We find a lower bound for the number of Chen primes in the arithmetic progression $a \bmod q$, where $(a,q)=(a+2,q)=1$. Our estimate is uniform for $q \leq \log^M x$, where $M>0$ is fixed.

A new criterion on normal bases of finite field extension $\mathbb{F}_{q^n} / \mathbb{F}_{q}$ is presented and explicit criterions for several particular finite field extensions are derived from this new criterion.

Permutation polynomials are an interesting subject of mathematics and have applications in other areas of mathematics and engineering. In this paper, we develop general theorems on permutation polynomials over finite fields. As 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…

Let $a, Q\in\Q$ be given and consider the set $\cal{G}(a, Q)=\{aQ^{i}:\;i\in\N\}$ of terms of geometric progression with 0th term equal to $a$ and the quotient $Q$. Let $f\in\Q(x, y)$ and $\cal{V}_{f}$ be the set of finite values of $f$. We…

We prove new mean value theorems for primes in arithmetic progressions to moduli larger than $x^{1/2}$. Our main result shows that the primes are equidistributed for a fixed residue class over all moduli of size $x^{1/2+\delta}$ with a…

We investigate the approximation to the number of primes in arithmetic progressions given by Vaughan. Instead of averaging the expected error term over all residue classes to modules in a given range, here we only consider subsets of…

For certain primes $p$, the average digit in the expansion of $1/p$ was found to have a deviation from random behaviour related to the class number of the imaginary quadratic field $\mathbb{Q}(\sqrt{-p})$ (Girstmair 1994). In this short…

We prove an asymptotic formula for the number of integers $\leq x$ which can be written as the product of $k ~(\geq 2)$ distinct primes $p_1\cdots p_k$ with each prime factor in an arithmetic progression $p_j\equiv a_j \bmod q$, $(a_j,…

We establish the existence of infinitely many \emph{polynomial} progressions in the primes; more precisely, given any integer-valued polynomials $P_1, >..., P_k \in \Z[\m]$ in one unknown $\m$ with $P_1(0) = ... = P_k(0) = 0$ and any $\eps…

In a recent paper, one of us posed three open problems concerning squarefree arithmetic progressions in infinite words. In this note we solve these problems and prove some additional results.

Define a natural number $n$ as a \textit{square-full} integer if for every prime $p$ such that $p|n$, we have $p^2|n$. In this paper, we establish an upper bound on the variance of square-full integers in short intervals of an expected…

Let $F(t),G(t)\in \mathbb{Q}(t)$ be rational functions such that $F(t),G(t)$ and the constant function $1$ are linearly independent over $\mathbb{Q}$, we prove an asymptotic formula for the number of the three term rational function…