Related papers: Prime Number Diffeomorphisms, Diophantine Equation…
Diophantine approximation is the problem of approximating a real number by rational numbers. We propose a version of this in which the numerators are approximately related to the denominators by a Laurent polynomial. Our definition is…
A new parametric integral is obtained as a consequence of the Riemann hypothesis. An asymptotic multiplicability is the main property of this integral.
Let $v\geq 2$ be a fixed integer, and let $x \geq 1$ and $z \geq x$ be large numbers. The exact asymptotic formula for the number of Wieferich primes $p$ such that $ v^{p-1} \equiv 1 \bmod p^2$ in the short interval $[x,x+z]$ is proposed in…
Prime numbers have attracted the attention of mathematiciansand enthusiasts for millenniums due to their simple definition and remarkable properties. In this paper, we study primorial numbers (the product of the first prime numbers) to…
We study the distribution of closed geodesics for the modular surface. We improve the error term in the prime geodesic theorem, and obtain results on prime geodesics in very short intervals conditionally on the generalized Riemann…
We construct real numbers $\alpha$ for which the pair correlation function \[N^{-1}#\{m<n\le N:||\alpha m^2-\alpha n^2||\le XN^{-1}\}\] tends to $X$ as $N$ grows. Moreover we show for any "Diophantine" $\alpha$ that the pair correlation…
ABSTRACT. In this article we present a point of view that highlights the importance of finding the upper bounds for prime gaps, in order to solve the twin primes conjecture and the Goldbach conjecture. For this purpose, we present a…
Primitive prime divisors play an important role in group theory and number theory. We study a certain number theoretic quantity, called $\Phi^*_n(q)$, which is closely related to the cyclotomic polynomial $\Phi_n(x)$ and to primitive prime…
In an earlier paper, Tatong and Suvarnamani explores the Diophantine equation $p^x + p^y = z^2$ for a prime number $p$. In that paper they find some solutions to the equation for $p=2, 3$. In this paper, we look at a general version of this…
Counting the number of prime numbers up to a certain natural number and describing the asymptotic behavior of such a counting function has been studied by famous mathematicians like Gauss, Legendre, Dirichlet, and Euler. The prime number…
We investigate the solvability of the Diophantine equation in the title, where $d>1$ is a square-free integer, $p, q$ are distinct odd primes and $x,y,a,b$ are unknown positive integers with $\gcd(x,y)=1$. We describe all the integer…
We describe an algorithm for arbitrary-precision computation of the elementary functions (exp, log, sin, atan, etc.) which, after a cheap precomputation, gives roughly a factor-two speedup over previous state-of-the-art algorithms at…
Mathematicians has been trying to prove the weak Goldbach's conjecture by adding prime numbers, as stated in the conjecture. However, we believe that the solution does not need to be analytically solved. Instead of trying to add prime…
We reveal a relationship between the prime counting function and an operation performed on a unique subsequence of the primes.
Assuming some regularity of the dynamical zeta function, we establish an explicit formula with an error term for the prime orbit counting function of a suspended flow. We define the subclass of self-similar flows, for which we give an…
Let $v$ be an odd real polynomial (i.e. a polynomial of the form $\sum_{j=1}^\ell a_jx^{2j-1}$). We utilize sets of iterated differences to establish new results about sets of the form $\mathcal…
In this paper, we construct holomorphic families of Riemann surfaces from Veech groups and characterize their sections by some points of corresponding flat surfaces. The construction gives us concrete solutions for some Diophantine…
We use discrete holomorphic polynomials to prove that, given a refining sequence of critical maps of a Riemann surface, any holomorphic function can be approximated by a converging sequence of discrete holomorphic functions.
By using the elementary symmetric polynomials and some results of number theory, we solve the well known problem of Lehmer on Euler's totient function. As application, we obtain a new characterization of prime numbers.
Exact summatory functions that count the number of prime $k$-tuples up to some cut-off integer are presented. Related summatory $k$-tuple analogs of the first and second Chebyshev functions are then defined. Using a gamma distribution…