Related papers: Gauss Circle Primes
The Gauss Circle Problem concerns finding asymptotics for the number of lattice point lying inside a circle in terms of the radius of the circle. The heuristic that the number of points is very nearly the area of the circle is surprisingly…
The Gauss circle problem asks for an approximation to the number of lattice points of $\mathbb{Z}^2$ contained in $B_r$, the disk of radius $r$ centered at the origin. Upper, lower, and average bounds have been established for this…
The Gauss circle problem concerns with the evaluation of $\sum_{n \leq x}r(n)$, where $r(n)$ denotes the number of representations of $n$ as sums of two squares and $x \geq 2$. Let $\Psi_G(x,y)$ denote the sum of $y$-smooth numbers below…
This paper concerns the number of lattice points in a circle.
The distribution of lattice points with relatively $r$-prime is related to problems in the Number Theory such as the Extended Lindel\"{o}f Hypothesis and the Gauss Circle Problem. It is known that Sittinger's result is improved on the…
We study the problem of writing Gaussian primes as the sum of two squares, both of which are interesting arithmetically, in particular, when one is the square of a prime and the other the square of an almost-prime.
Let PR$[n]$ be the graph whose vertices are $2,3,\ldots,n$ with vertex $v$ adjacent to vertex $w$ if and only if $\gcd(v,w)>1$. It is shown that $\pi(n)$, the the number of primes no more than $n$, equals the Lov\'{a}sz number of this…
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…
We study Gaussian primes lying in narrow sectors, and show that almost all such sectors contain the expected number of primes, if the sectors are not too narrow.
The Gaussian moat problem asks whether it is possible to find an infinite sequence of distinct Gaussian prime numbers such that the difference between consecutive numbers in the sequence is bounded. In this paper, we have proved that the…
This paper provides estimates on the difference between the number of integer lattice points an a circle centered at the origin and the area. The estimates have the form "Big O" of the product of logarithm of the radius and the radius…
The Prime Number Theorem states that the number of primes in $\{1,\ldots,x\}$, denoted $\pi(x)$, is approximately $\frac{x}{\ln(x)}$. In this paper, we investigate the distribution of primes for domains other than $\N$. First we look at…
Hardy conjectured that the error term arising from approximating the number of lattice points lying in a radius-$R$ disc by its area is $O(R^{1/2+o(1)})$. One source of support for this conjecture is a folklore heuristic that uses i.i.d.…
Prime numbers are one of the most intriguing figures in mathematics. Despite centuries of research, many questions remain still unsolved. In recent years, computer simulations are playing a fundamental role in the study of an immense…
We show that almost all sectors of the disc $\{z \in \mathbb{C}: |z|^2\leq X\}$ of area $(\log X)^{15.1}$ contain products of exactly two Gaussian primes, and that almost all sectors of area $(\log X)^{1 + \varepsilon}$ contain products of…
In this paper, we propose a class of elementary plane geometry problems closely related to the title of this paper. Here, a circle is the 1-dimensional curve bounding a disk. For any nonnegative integer, a circle is called $n$-enclosing if…
In this paper we create a definition for prime gaps in the Gaussian integers using a boxcar metric. From this we used numerical methods to derive an asymptotic upper bound for the gaps in this scenario, namely O(log^2|p_{n}|).
Since the mathematicians of ancient Greece until Fermat, since Gauss until today; the way how the primes along the numerical straight line are distributed has become perhaps the most difficult math problem; many people believe that their…
The generalized Gauss circle problem concerns the lattice point discrepancy of large spheres. We study the Dirichlet series associated to $P_k(n)^2$, where $P_k(n)$ is the discrepancy between the volume of the $k$-dimensional sphere of…
We consider the problem of finding small prime gaps in various sets of integers $\mathcal{C}$. Following the work of Goldston-Pintz-Yildirim, we will consider collections of natural numbers that are well-controlled in arithmetic…