Related papers: Prime Number Diffeomorphisms, Diophantine Equation…

We observe that the computation $5^2 = 25$ has the digital property of the result being equal to the exponent concatenated directly to the left of the base. The generalization to a Diophantine equation and inequality in number bases has…

The prime numbers and the non-trivial zeros of the Riemann zeta function are globally linked by the explicit formula of analytic number theory. Whether they share a hidden, scale-by-scale geometric symmetry has remained unexplored. We…

We continue our examination the effects of certain hypothetical configurations of zeros of Dirichlet $L$-functions lying off the critical line ("barriers") on the relative magnitude of the functions $\pi_{q,a}(x)$. Here $\pi_{q,a}(x)$ is…

We have presented a multivariate polynomial function termed as factor elimination function,by which, we can generate prime numbers. This function's mapping behavior can explain the irregularities in the occurrence of prime numbers on the…

We study the localization problem appearing in Kronecker's diophantine theorem. We introduce a probabilistic approach allowing to extend for general $\Q$-linearly independent sequences a result of T\'uran concerning the sequence $ (\log…

For the positive integer $n$, let $f(n)$ denote the number of positive integer solutions $(n_1, n_2, n_3)$ of the Diophantine equation $$ {4\over n}={1\over n_1}+{1\over n_2}+{1\over n_3}. $$ For the prime number $p$, $f(p)$ can be split…

We consider $\Phi(x)=x^{-\frac{1}{4}}\left[1-2\sqrt{x}\Sigma e^{-p^2\pi x}\ln p\right]$ on $x>0$, where the sum is over all primes $p$. If $\Phi$ is bounded on $x>0$, then the Riemann hypothesis is true or there are infinitely many zeros…

A paradigm for a global algebraic number theory of the reals is formulated with the purpose of providing a unified setting for algebraic and transcendental number theory. This is achieved through the study of subgroups of nonstandard models…

In a recent paper, Madritsch and Tichy established Diophantine inequalities for the fractional parts of polynomial-like functions. In particular, for $f(x)=x^k+x^c$ where $k$ is a positive integer and $c>1$ is a non-integer, and any fixed…

Derivative-matching approximations are constructed as power series built from functions. The method assumes the knowledge of special values of the Bell polynomials of the second kind, for which we refer to the literature. The presented…

The first step in the formulation and study of the Riemann Hypothesis is the analytic continuation of the Riemann Zeta Function (RZF) in the full Complex Plane with a pole at $s=1$. In the current work, we study the analytic continuation of…

Under the generalized Riemann hypothesis, we illustrate that the ratio of the set of primes $p$ such that $\langle -1, 2 \rangle$ has an odd prime index in $\mathbb{F}_p^*$ to the set of primes $p$ such that the subgroup has index greater…

Let $\{ a(x) \}_{x=1}^{\infty}$ be a positive, real-valued, lacunary sequence. This note shows that the pair correlation function of the fractional parts of the dilations $\alpha a(x)$ is Poissonian for Lebesgue almost every $\alpha\in…

Let $1<k<14/5$, $\lambda_1,\lambda_2,\lambda_3$ and $\lambda_4$ be non-zero real numbers, not all of the same sign such that $\lambda_1/\lambda_2$ is irrational and let $\omega$ be a real number. We prove that the inequality…

For a given irrational number, we consider the properties of best rational approximations of given parities. There are three different kinds of rational numbers according to the parity of the numerator and denominator, say odd/odd, even/odd…

Dirichlet's theorem on arithmetic progressions called as Dirichlet prime number theorem is a classical result in number theory. Atle Selberg\cite{Selberg} gave an elementary proof of this theorem. In this article we give an alternative…

Assuming the Generalized Riemann Hypothesis, we obtain a lower bound within a constant factor of the conjectured asymptotic result for the second moment for primes in an individual arithmetic progression in short intervals. Previous results…

By introducing a kind of special functions namely exponent-like function, cosine-like function and sine-like function, we obtain explicitly the basic structures of solutions of initial value problem at the original point for this kind of…

Currently there is no known efficient formula for primes. Besides that, prime numbers have great importance in e.g., information technology such as public-key cryptography, and their position and possible or impossible functional generation…

In this article we gave a recurrence to obtain the n-th prime number as function of the (n-1)-th prime number.