Related papers: An explicit upper bound for the first $k$-Ramanuja…

In this paper, we introduce some explicit approximations for the summation $\sum_{k\leq n}\Omega(k)$, where $\Omega(k)$ is the total number of prime factors of $k$.

We look at upper bounds for the count of certain primes related to the Fermat numbers $F_n=2^{2^n}+1$ called elite primes. We first note an oversight in a result of Krizek, Luca and Somer and give the corrected, slightly weaker upper bound.…

In this paper we use refined approximations for Chebyshev's $\vartheta$-function to establish new explicit estimates for the prime counting function $\pi(x)$, which improve the current best estimates for large values of $x$. As an…

I give some claims on primorial prime numbers for interested readers in number theory.

In 1991, Negami found an upper bound on the stick number $s(K)$ of a nontrivial knot $K$ in terms of the minimal crossing number $c(K)$ of the knot which is $s(K) \leq 2 c(K)$. In this paper we improve this upper bound to $s(K) \leq…

This paper updates the explicit interval estimate for primes between consecutive powers. It is shown that there is least one prime between $n^{155}$ and $(n+1)^{155}$ for all $n\geq 1$. This result is in part obtained with a new explicit…

In this article, we prove an "equivalence" between two higher even moments of primes in short intervals under Riemann Hypothesis. We also provide numerical evidence in support of these asymptotic formulas.

We study the prime values of Ramanujan's tau function $\tau(n)$. Lehmer found that $n=251^2=63001$ is the smallest $n$ such that $\tau(n)$ is prime: $$\tau(251^2)=-80561663527802406257321747.$$ We prove that in most arithmetic progressions…

We say that n ideals of algebraic integers in a fixed number ring are k-wise relatively r-prime if any k of them are relatively r-prime. In this article, we provide an exact formula for the probability that n nonzero ideals of algebraic…

Let $p\geq 3$ be a prime and $n\geq 1$ be an integer. Let $K\subseteq {\mathbb{F}_p}$ denote a fixed subset with $0\in K$. Let $A\subseteq ({\mathbb{F}_p})^n$ be an arbitrary subset such that $$\{…

Explicit formulas involving a generalized Ramanujan sum are derived. An analogue of the prime number theorem is obtained and equivalences of the Riemann hypothesis are shown. Finally, explicit formulas of Bartz are generalized.

In this paper, prime as well as primitive Kumjian-Pask algebras $\mathrm{KP}_R(\Lambda)$ of a row-finite $k$-graph $\Lambda$ over a unital commutative ring $R$ are completely characterized in graph-theoretic and algebraic terms. By applying…

Assuming the Riemann Hypothesis, we obtain an upper bound for the 2k-th moment of the derivative of the Riemann zeta-function averaged over the non-trivial zeros of $\zeta(s)$ for every positive integer k. Our bounds are nearly as sharp as…

Tur\'an number is one of primary topics in the combinatorics of finite sets,in this paper, we will present a new upper bound for Tur\'an number.

We refine a result of the last two Authors of [8] on a Diophantine approximation problem with two primes and a $k$-th power of a prime which was only proved to hold for $1<k<4/3$. We improve the $k$-range to $1<k\le 3$ by combining Harman's…

In this paper we show that any increasing functional of the first k eigenvalues of the Dirichlet Laplacian admits a (quasi-)open minimizer among the subsets of R^N of unit measure. In particular, there exists such a minimizer which is…

We obtain an upper bound for the distribution of primes in the form $n^4 + k$ up to $x$, averaged over $k$ with small square-full part. As a corollary, we show that for almost all $k$, there is an expected amount of primes in the form $n^4…

We prove an explicit error term for the $\psi(x,\chi)$ function assuming the Generalized Riemann Hypothesis. Using this estimate, we prove a conditional explicit bound for the number of primes in arithmetic progressions.

In this paper we establish explicit upper and lower bounds for the ratio of the arithmetic and geometric means of the prime numbers, which improve the current best estimates. Further, we prove several conjectures related to this ration…

We obtain a lower bound for a number of primes in tuples. As applications, we obtain a lower bound for the Romanoff type representation functions.