Related papers: Coordinate Distribution of Gaussian Primes
We give a bijective parameter representation for a sum of squares of numbers being equal to another sum of squares of numbers.
In this paper, we study the Jacobi sums over Galois rings of arbitrary characteristics and completely determine their absolute values, which extends the work in \cite{feng1}, where the Jacobi sums over Galois rings with characteristics a…
This paper proposes an elementary solution to a special case of finding all perfect squares that can be written as sum of consecutive integer cubes. It is shown that there are no non-trivial solutions if the perfect square is a prime power,…
We present an explicit evaluation of the double Gauss sum $\displaystyle G(a,b,c;S;p^n):=\sum_{x,y=0}^{p^n-1} e^{2\pi i S(ax^2+bxy+cy^2)/p^n}$, where $a, b, c$ are integers such that $\gcd(a,b,c)=1$, $p$ is a prime, $n$ is a positive…
The Gaussian Moat problem asks whether one can walk to infinity in the Gaussian integers using the Gaussian primes as stepping stones and taking bounded length steps or not. In this paper, we have analyzed the Gaussian primes and also…
The paper study the discrete sets of translations of the Gaussian function that span the spaces L1(R) and L2(R).
This work proposes a proof of the simplest cubic primes counting problem. It shows that the subset of primes {p = n^3 + 2 is prime : n => 1} is an infinite subset of primes. Further, the expected order of magnitude of the cubic primes…
We prove explicit bounds for the number of sums of consecutive prime squares below a given magnitude.
We study large partial sums, localized with respect to the sums of variances, of a sequence of centered random variables. An application is given to the distribution of prime factors of typical integers.
Explicit determinations of several classes of trigonometric sums are given. These sums can be viewed as analogues or generalizations of Gauss sums. In a previous paper, two of the present authors considered primarily sine sums associated…
In our paper, we apply additive-combinatorial methods to study the distribution of the set of squares $\mathcal{R}$ in the prime field. We obtain the best upper bound on the number of gaps in $\mathcal{R}$ at the moment and generalize this…
In the past two decades, many researchers have studied {\it index $2$} Gauss sums, where the group generated by the characteristic $p$ of the underling finite field is of index $2$ in the unit group of ${\mathbb Z}/m{\mathbb Z}$ for the…
This note highlights an interesting connection between Euler sums of even weight and prime numbers.
We investigate the average number of representations of a positive integer as the sum of $k + 1$ perfect $k$-th powers of primes. We extend recent results of Languasco and the last Author, which dealt with the case $k = 2$ [6] and $k = 3$…
In this short note we present a class of conjectures on partitions of integers as summations of primes, which are extensions of Goldbach conjecture.
A symmetric random variable is called a Gaussian mixture if it has the same distribution as the product of two independent random variables, one being positive and the other a standard Gaussian random variable. Examples of Gaussian mixtures…
Translation from the Latin original "Utrum hic numerus 1000009 sit primus necne inquiritur" (1778). E699 in the Enestrom index. The idea of this paper is that if some number is a sum of two squares in two ways, then some other smaller…
We show that there are short intervals $[x,x+y]$ containing $\gg y^{1/10}$ numbers expressible as the sum of two squares, which is many more than the average when $y=o( (\log{x})^{5/9})$. We obtain similar results for sums of two squares in…
We generalize a Theorem of Ricci and count Gaussian primes $\mathfrak{p}$ with short interval restrictions on both the norm and the argument of $\mathfrak{p}$.
A new characterization of the multivariate so-called "quasi-Gaussian distribution" (the authors dared to coin a new term) by means of independence their Cartesian and polar coordinates proposed. The authors try to show that these…