Related papers: Prime Counting Function Identity
The recent technique for estimating lower bounds of the prime counting function $\pi(x)=#\{p \leq x: p\text{ prime}\}$ by means of the irrationality measures $\mu(\zeta(s)) \geq 2$ of special values of the zeta function claims that $\pi(x)…
This short note provides a sharper upper bound of a well known inequality for the sum of divisors function. This is a problem in pure mathematics related to the distribution of prime numbers. Furthermore, the technique is completely…
In this article we gave a recurrence to obtain the n-th prime number as function of the (n-1)-th prime number.
The paper solves the problems of determining the asymptotics of the number of primes and the sums of functions of primes in a subset of the natural series that satisfies the conditions that the asymptotic density of the number of primes in…
In 2016, Dummit, Granville, and Kisilevsky showed that the proportion of semiprimes (products of two primes) not exceeding a given $x$, whose factors are congruent to $3$ modulo $4$, is more than a quarter when $x$ is sufficiently large.…
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…
By establishing an improved level of distribution we study almost primes of the form $f(p,n)$ where $f$ is an irreducible binary form over $\mathbb Z$.
We present an improved version of the analytic method for calculating $\pi(x)$, the number of prime numbers not exceeding $x$. We implemented this method in cooperation with J. Franke, T. Kleinjung and A. Jost and calculated the value…
A new parametric integral is obtained as a consequence of the Riemann hypothesis. An asymptotic multiplicability is the main property of this integral.
In this paper, two new classes of perfect nonlinear functions over $\mathbb{F}_{p^{2m}}$ are proposed, where $p$ is an odd prime. Furthermore, we investigate the nucleus of the corresponding semifields of these functions and show that the…
This paper discusses a few main topics in Number Theory, such as the M\"{o}bius function and its generalization, leading up to the derivation of neat power series for the prime counting function, $\pi(x)$, and the prime-power counting…
Some new results concerning the equation $\sigma(N)=aM, \sigma(M)=bN$ are proved. As a corollary, there are only finitely many odd superperfect numbers with a fixed number of distinct prime factors.
Let $p_1=2, p_2=3, p_3=5, \ldots$ be the consecutive prime numbers, $S_n$ the numerical semigroup generated by the primes not less than $p_n$ and $u_n$ the largest irredundant generator of $S_n$. We will show, that $\bullet$ $u_n\sim3p_n$.…
This article is about Pi Formulas, infinite series of fractions which sum to multiples of Pi. Each such one can be associated with a unique set $S_k$ of rough numbers, where $k$ is a prime number. Given $S_k$ for any prime $k$, the set…
A positive integer $n$ is called perfect if $ \sigma(n)=2n$, where $\sigma(n)$ denote the sum of divisors of $n$. In this paper we study the ratio $\frac{\sigma(n)}{n}$. We define the function Abundancy Index $I:\mathbb{N} \to \mathbb{Q}$…
Write $T(n)$ as the sum of the reciprocals of the primes which divide $n$. Write $H(n) = \prod_{p|n}p/(p-1)$ where the product is over the prime divisors of $n$. We prove new bounds for $T(n)$ and $H(n)$ in terms of the smallest prime…
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 $P(x) \in \mathbb{Z}[x]$ be a polynomial. We give an easy and new proof of the fact that the set of primes $p$ such that $p \mid P(n)$, for some $n \in \mathbb{Z}$, is infinite. We also get analog of this result for some special…
In this paper, we obtain a lower bound for the number of primes $p\leq x$ such that $p-1$ is a sum of two squares and $p+2$ has a bounded number of prime factors. The proof uses the vector sieve framework, involving a semi-linear sieve and…
In this paper, all rings are commutative with nonzero identity. Let $M$ be an $R$-module. A proper submodule $N$ of $M$ is called a classical prime submodule, if for each $m\in M$ and elements $a,b\in R$, $abm\in N$ implies that $am\in N$…