Related papers: Mertens's theorem for splitting primes and more

In this paper we present some observations about the well-known Goldbach conjecture. In particular we list and interpret some numerical results which allow us to formulate a relation between prime numbers and even integers. We can also…

It is the purpose of this thesis to enunciate and prove a collection of explicit results in the theory of prime numbers. First, the problem of primes in short intervals is considered. We prove that there is a prime between consecutive cubes…

It is well known that the strong subadditivity theorem is hold for classical system, but it is very difficult to prove that it is hold for quantum system. The first proof of this theorem is due to Lieb by using the Lieb's theorem. Here we…

Some mathematical theorems represent ideas that are discovered again and again in different forms. One such theorem is Hall's marriage theorem. This theorem is equivalent to several other theorems in combinatorics and optimization theory,…

We present a new topological proof of the infinitude of prime numbers with a new topology. Furthermore, in this topology, we characterize the infinitude of any non-empty subset of prime numbers.

We present a smooth version of Landaus explicit formula for the von Mangoldt arithmetical function. Assuming the validity of the Riemann hypothesis, we show that in order to determine whether a natural number is a prime number, it is…

In the setting of spaces of homogeneous type, we study some Hardy type inequalities, which notably appeared in the proofs of local T(b) theorems as in [AR]. We give some suffi cient conditions ensuring their validity, related to the…

This paper proposes a totally constructive approach for the proof of Hilbert's theorem on ternary quartic forms. The main contribution is the ladder technique, with which the Hilbert's theorem is proved vividly.

We study the number of primes with a given primitive root and in an arithmetic progression under the assumption of a suitable form of the generalized Riemann Hypothesis. Previous work of Lenstra, Moree and Stevenhagen has given asymptotics…

We present a new, elementary, dynamical proof of the prime number theorem.

We prove a common generalization to several mass partition results using hyperplane arrangements to split $\mathbb{R}^d$ into two sets. Our main result implies the ham-sandwich theorem, the necklace splitting theorem for two thieves, a…

In the paper, the occurrence of zeros and ones in the binary expansion of the primes is studied. In particular the statement in the title is established. The proof is unconditional.

In this article, we obtain upper bounds on the number of irreducible factors of some classes of polynomials having integer coefficients, which in particular yield some of the well known irreducibility criteria. For devising our results, we…

We introduce a number field analogue of the Mertens conjecture and demonstrate its falsity for all but finitely many number fields of any given degree. We establish the existence of a logarithmic limiting distribution for the analogous…

This paper, a continuation of [3], involves a closer study of polynomials of supertropical semirings and their version of tropical geometry in which we introduce the concept of relatively prime polynomials and resultants, with the aid of…

Reasons for the emergence of Chebyshev's bias were investigated. The Deep Riemann Hypothesis (DRH) enables us to reveal that the bias is a natural phenomenon for achieving a well-balanced disposition of the whole sequence of primes, in the…

We prove that several results in different areas of number theory such as the divergent series, summation of arithmetic functions, uniform distribution modulo one and summation over prime numbers which are currently considered to be…

We adopt an empirical approach to the characterization of the distribution of twin primes within the set of primes, rather than in the set of all natural numbers. The occurrences of twin primes in any finite sequence of primes are like…

We prove the infinitude of shifted primes $p-1$ without prime factors above $p^{0.2844}$. This refines $p^{0.2961}$ from Baker and Harman in 1998. Consequently, we obtain an improved lower bound on the the distribution of Carmichael…

We give a remarkably elementary proof of the Brouwer fixed point theorem. The proof is verifiable for most of the mathematicians.