Related papers: Exact Summatory Functions for Prime $k$-tuples

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…

The paper considers estimates for some sums and products of functions of prime numbers. Several assertions on this topic have been proven. We also study extremal estimates for strongly additive and strongly multiplicative arithmetic…

We conjecture average counting functions for prime $k$-tuples based on a gamma distribution hypothesis for prime powers. The conjecture is closely related to the Hardy-Littlewood conjecture for $k$-tuples but yields better estimates.…

Euler's totient function counts the positive integers up to a given integer n that are relatively prime to n. The aim of this article is to give a result about the sum of euler's totient function from k equal 1 to n whene p divides n and p…

We give explicit numerical estimates for the generalized Chebyshev functions. Explicit results of this kind are useful for estimating of computational complexity of algorithms which generates special primes. Such primes are needed to…

This paper considers functional series whose terms are higher-order derivatives of Chebyshev polynomials of the second kind, where the degree of the polynomial is related to the order of the derivative. Analytic summation is used to…

In this paper we give effective estimates for some classical arithmetic functions defined over prime numbers. First we find the smallest real number $x_0$ so that some inequality involving Chebyshev's $\vartheta$-function holds for every $x…

Starting with Zhang's theorem on the infinitude of prime doubles, we give an inductive argument that there exists an infinite number of prime $k$-tuples for at least one admissible set $\mathcal{H}_k=\{h_1,\ldots,h_k\}$ for each $k$.

Let $K\geq 2$ be a natural number and $a_i,b_i\in\mathbb{Z}$ for $i=1,\ldots,K-1$. We use the large sieve to derive explicit upper bounds for the number of prime $k$-tuplets, i.e., for the number of primes $p\leq x$ for which all $a_ip+b_i$…

Sums over inverse s-th powers of semiprimes and k-almost primes are transformed into sums over products of powers of ordinary prime zeta functions. Multinomial coefficients known from the cycle decomposition of permutation groups play the…

Based on new explicit estimates for the prime counting function, we improve the currently known estimates for the particular sequence $C_n = np_n - \sum_{k \leq n}p_k$, $n \geq 1$, involving the prime numbers.

This is a compendium of generating functions involving single, double sums and definite integrals. These generating functions also involve special functions in both the summand function and closed form solution.

We prove the existence of entire functions that achieve universal approximations on certain countable sequences of translation operators .

In this paper we first establish new explicit estimates for Chebyshev's $\vartheta$-function. Applying these new estimates, we derive new upper and lower bounds for some functions defined over the prime numbers, for instance the prime…

We propose a generic algorithm for computing the inverses of a multiplicative function under the assumption that the set of inverses is finite. More generally, our algorithm can compute certain functions of the inverses, such as their power…

We investigate the construction of $\pm1$-valued completely multiplicative functions that take the value $+1$ at at most $k$ consecutive integers, which we call length-$k$ functions. We introduce a way to extend the length based on the idea…

This paper introduces a general technique for estimating the absolute value of pure Gaussian sums of order k over a prime p for a class of composite order k. The new estimate improves the classical estimate by a factor of about 2 or better…

We reveal a relationship between the prime counting function and an operation performed on a unique subsequence of the primes.

In order to study the analytic properties of the Goldbach generating function we consider a smooth version, similar to the Chebyshev function for the Prime Number Theorem. In this paper, we obtain explicit numerical estimates for the…

We give some theoretical and computational results on "random" harmonic sums with prime numbers, and more generally, for integers with a fixed number of prime factors.