Related papers: On Gauss Periods

An element $\alpha \in \mathbb F_{q^n}$ is \emph{normal} if $\mathcal{B} = \{\alpha, \alpha^q, \ldots, \alpha^{q^{n-1}}\}$ forms a basis of $\mathbb F_{q^n}$ as a vector space over $\mathbb F_{q}$; in this case, $\mathcal{B}$ is a normal…

The $q$-analogue of the binomial coefficient, known as a $q$-binomial coefficient, is typically denoted $\left[{n \atop k}\right]_q$. These polynomials are important combinatorial objects, often appearing in generating functions related to…

Generalized Cullen Numbers are positive integers of the form $C_b(n):=nb^n+1$. In this work we generalize some known divisibility properties of Cullen Numbers and present two primality tests for this family of integers. The first test is…

In 1961, Rankin determined the asymptotic behavior of the number $S_{k,q}(x)$ of positive integers $n\le x$ for which a given prime $q$ does not divide $\sigma_k(n),$ the $k$-th divisor sum function. By computing the associated…

We prove explicit formulas for certain first and second moment sums of families of Gaussian hypergeometric functions $_{n+1}F_n$, $n\ge1$, over finite fields with $q$ elements where $q$ is an odd prime. This enables us to find an estimate…

Let $P(m)$ denote the largest prime factor of an integer $m\geq 2$, and put $P(0)=P(1)=1$. For an integer $k\geq 2$, let $(F_{n}^{(k)})_{n\geq 2-k}$ be the $k-$generalized Fibonacci sequence which starts with $0,...,0,1$ ($k$ terms) and…

Let $f(x)\in\mathbb{Z}[x]$ be a nonconstant polynomial. Let $n, k$ and $c$ be integers such that $n\ge 1$ and $k\ge 2$. An integer $a$ is called an $f$-exunit in the ring $\mathbb{Z}_n$ of residue classes modulo $n$ if $\gcd(f(a),n)=1$. In…

This paper presents a distinctive prime detection approach. This method use GM-(n+1) sequences to effectively eliminate complex numbers. The sequences, which consist of odd a number of (n+1), exclude all components except for the initial…

We report extensive computational evidence that Gauss period equations are minimal discriminant polynomials for primitive elements representing Abelian (cyclic) polynomials of prime degrees $p$. By computing 200 period equations up to…

In this paper, we compute the size of the exceptional set in a generalized Goldbach problem and show that for a given polynomial $f(x) \in \mathbb{Z}[x]$ with a positive leading coefficient, positive integers $A$, $B$, $g$ and $0 \leq i, j…

It is shown that the first $n$ prime numbers $p_1,...,p_n$ determine the next one by the recursion equation $$ p_{n+1} =\lim\limits_{s\to +\infty} [\prod\limits^n_{k=1} (1-\frac{1}{p^s_k}) \sum\limits^\infty_{j=1} \frac{1}{j^s} -1]^{-1/s}.…

An element $\alpha \in \mathbb {F}_{q^n}$ is normal over $\mathbb {F}_q$ if $\alpha$ and its conjugates $\alpha, \alpha^q, \cdots \alpha^{q^{n-1}}$ form a basis of $\mathbb {F}_{q^n}$ over $\mathbb {F}_q$. Recently, Huczynska, Mullen,…

We study the generalized Ramsey numbers $f(Q_n, C_{k}, q)$, that is, the minimum number of colors needed to edge-color the hypercube $Q_n$ so that every copy of the cycle $C_{k}$ has at least $q$ colors. Our main result is that for any…

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…

We determine all triples $(a,b,n)$ of positive integers such that $a$ and $b$ are relatively prime and $n^k$ divides $a^n + b^n$ (respectively, $a^n - b^n$), when $k$ is the maximum of $a$ and $b$ (in fact, we answer a slightly more general…

Generating primes is a fundamental problem in modern cryptography. Deterministic primality tests work well for special integers such as Mersenne or Proth primes, but these forms are quite restrictive. In this paper, we give a direct method…

We study the Prishchepov groups $P(r,n,k,s,q)$, a unifying family of cyclically presented groups that encompasses many classical cases. For $n$ coprime to $6$, we prove a conjecture essentially characterizing when these groups are perfect:…

The celebrated Primitive Normal Basis Theorem states that for any $n\ge 2$ and any finite field $\mathbb F_q$, there exists an element $\alpha\in \mathbb F_{q^n}$ that is simultaneously primitive and normal over $\mathbb F_q$. In this…

Let $1 < c < 24/19$. We show that the number of integers $n \le N$ that cannot be written as $[p_1^c] + [p_2^c]$ ($p_1$, $p_2$ primes) is $O(N^{1-\sigma+\varepsilon})$. Here $\sigma$ is a positive function of $c$ (given explicitly) and…

We prove that it is always possible to find a permutation $p$ on the set $\{1,...,n\}$ such that $c+p(c)$ is prime for all $c \in \{1,...,n\}.$