Related papers: Exponential Sums, Cyclic Codes and Sequences: the …

We present a function that tests for primality, factorizes composites and builds a closed form expression of $\pi(n^2)$ in terms of $\sum_{3 \leq p \leq n} \frac{1}{p}$ and a weaker version of $\omega(n)$.

For any positive integer $m$ and an odd prime $p$; let $\mathbb{F}_{q}+u\mathbb{F}_{q}$, where $q=p^{m}$, be a ring extension of the ring $\mathbb{F}_{p}+u\mathbb{F}_{p}.$ In this paper, we construct linear codes over…

Exponential distributions appear in a wide range of applications including chemistry, nuclear physics, time series analyses, and stock market trends. There are conceivable circumstances in which one would be interested in the cumulative…

Let $X_{nr}$ be the $r$th largest of a random sample of size $n$ from a distribution $F (x) = 1 - \sum_{i = 0}^\infty c_i x^{-\alpha - i \beta}$ for $\alpha > 0$ and $\beta > 0$. An inversion theorem is proved and used to derive an…

Let $\mathbb{F}_q$ be a finite field of order $q$ and integer $n\ge 1$. Let $\ell$ be a prime such that $\ell^k|(q-1)$ for some integer $k\ge 1$ and $\mu$ be an element of order $\ell^k$ in $\mathbb{F}_q$. In this paper, we determine the…

Combinatorial $t$-designs have been an important research subject for many years, as they have wide applications in coding theory, cryptography, communications and statistics. The interplay between coding theory and $t$-designs has been…

Let $p_n$ be $n$th prime, and let $(S_n)_{n=1}^\infty:=(S_n)$ be the sequence of the sums of the first $2n$ consecutive primes, that is, $S_n=\sum_{k=1}^{2n}p_k$ with $n=1,2,\ldots$. Heuristic arguments supported by the corresponding…

Let $\mathbf{F}_q$ be a finite field of $q$ elements. We show that the normalized Jacobi sum $J(\chi,\eta)/\sqrt{q}$, for each fixed non-trivial multiplicative character $\eta$, becomes equidistributed in the unit circle as…

Let $I_k = [(2k-1)^2, (2k+1)^2)$ for $k \geq 1$. Starting from the odd-composite matrix $(b_{ij})$ with $b_{ij} = (2i-1)(2j-1)$, introduced by the author in [1], we define for each odd integer $n$ the \emph{matrix multiplicity} $r(n)$, the…

Irreducible cyclic codes are an interesting type of codes and have applications in space communications. They have been studied for decades and a lot of progress has been made. The objectives of this paper are to survey and extend earlier…

An odd prime $p$ is called irregular with respect to Euler polynomials if it divides the numerator of one of the numbers $$E_1(0),E_{3}(0),\ldots,E_{p-2}(0),$$ where $E_n(x)$ is the $n$-th Euler polynomial. As in the classical case, we link…

In this paper, we investigate the large deviations of sums of weighted random variables that are approximately independent, generalizing and improving some of the results of Montgomery and Odlyzko. We are motivated by examples arising from…

Let $k \ge 2$ and $\alpha_1, \beta_1, ..., \alpha_k, \beta_k$ be reals such that the $\alpha_i$'s are irrational and greater than 1. Suppose further that some ratio $\alpha_i/\alpha_j$ is irrational. We study the representations of an…

We examine the behavior of the sequences of $p$-adic valuations of quadratic polynomials with integer coefficients for an odd prime $p$ through tree representations. Under this representation, a finite tree corresponds to a periodic…

This work brings techniques from the theory of recurrent integer sequences to the problem of balancedness of symmetric Boolean functions. In particular, the periodicity modulo $p$ ($p$ odd prime) of exponential sums of symmetric Boolean…

Given a newform with the Fourier expansion $\sum_{n=1}^\infty b(n)q^n\in\mathbb Z[[q]]$, a prime $p$ is said to be non-ordinary if $p\mid b(p)$. We exemplify several newforms of weight 4 for which the latter divisibility implies a stronger…

Let $X_1, X_2,\ldots, X_n$ be $n$ independent and identically distributed random variables, here $n \geq 2.$ Let $X_{(1)}, X_{(2)}, \ldots, X_{(n)}$ be the order statistics of $X_1, X_2,..., X_n.$ In this note we proved that: (I) If $X_1,…

We obtain an asymptotic formula for the number of primes $p\leq x_1$, $p\leq x_2$ such that $p_1(p_2+a)\equiv l \pmod q$ with $(a,q)=(l,q)=1$, $q\leq x^{\kappa_0}$, $x_1\geq x^{1-\alpha}$, $x_2\geq x^{\alpha}$, $$…

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$,…

In this paper we extend the works \cite{gegeng2,XLZD} further in two directions and compute the weight distribution of these cyclic codes under more relaxed conditions. It is interesting to note that many cyclic codes in the family are…