Related papers: A set of formulas for primes
We consider the representation of primes as a sum of a prime and twice a triangular number. We prove that a subset of the primes having density 1 is expressible in this form. We conjecture that every odd prime number is expressible as a sum…
In this paper we give a new semiprimality test and we construct a new formula for $\pi ^{(2)}(N)$, the function that counts the number of semiprimes not exceeding a given number $N$. We also present new formulas to identify the $n^{th}$…
A new explicit formula is proved for the contribution of the major arcs in the Goldbach and Generalized Twin Prime Problem, in which the level of the major arcs can be chosen very high. This will have many applications in the approximations…
It is shown that the first $n$ prime numbers $p_1,...,p_n$ determine the next one by the recursion equation $$ p_{n+1} =\lim\limits_{s\to +\infty} [\prod\limits^n_{k=1} (1-\frac{1}{p^s_k}) \sum\limits^\infty_{j=1} \frac{1}{j^s} -1]^{-1/s}.…
The main results extend to sums over primes in a short interval earlier estimates by the author for "long" Weyl sums over primes.
By using Beta Dirichlet series and then Eisenstein series we ca represent primes with first a good approximation and an exact expression. This can be done with arbitrary prime (up to 10^101).
Certain new inequalities for the sums of factorials are presented.
In this paper, we consider pairs of a prime and a prime power with a fixed difference. We prove an average result on the distribution of such pairs. This is a partial improvement of the result of Bauer (1998).
Definition of the number of prime numbers in the given interval
This work proposes elementary proofs of several related primes counting problems, based on an elementary weighted sieve. The subsets of primes considered here are the followings: the subset of twin primes PT = {p and p + 2 are primes}, the…
This paper is devoted to establishing several new formulas relating Bernoulli and Stirling numbers of both kinds.
An alternative form of Fermats equation[1] is proposed. It represents a portion of the identity that includes three terms of Fermats original equation. This alternative form permits an elementary and compact proof of the first case of…
Building on the concept of pretentious multiplicative functions, we give a new and largely elementary proof of the best result known on the counting function of primes in arithmetic progressions.
In this paper, we establish some theorems on the distribution of primes in higher-order progressions on average.
This paper gives new explicit formulas for sums of powers of integers and their reciprocals.
The Lambert W function, implicitly defined by W(x) exp{W(x)}=x, is a "new" special function that has recently been the subject of an extended upsurge in interest and applications. In this note, I point out that the Lambert W function can…
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 present an algorithm analogous to the sieve of Eratosthenes that produces the list of twin primes. Next, we count the number of twin primes resulting from the construction with two different heuristic arguments. The first method is…
A new method for continuing the usual Dirichlet series that defines the Riemann zeta function ${\zeta}(s)$ is presented. Numerical experiments demonstrating the computational efficacy of the resulting continuation are discussed.
Let \beta be a real number. Then for almost all irrational \alpha>0 (in the sense of Lebesgue measure) \limsup_{x\to\infty}\pi_{\alpha,\beta}^*(x)(\log x)^2/x>=1, where \pi_{\alpha,\beta}^*(x)={p<=x: both p and [\alpha p+\beta] are primes}.