Search results
Results from the WOW.Com Content Network
While the partial sums of the reciprocals of the primes eventually exceed any integer value, they never equal an integer. One proof [6] is by induction: The first partial sum is 1 / 2 , which has the form odd / even . If the n th partial sum (for n ≥ 1) has the form odd / even , then the (n + 1) st sum is
Because the sum of the reciprocals of the primes diverges, the Green–Tao theorem on arithmetic progressions is a special case of the conjecture. The weaker claim that A must contain infinitely many arithmetic progressions of length 3 is a consequence of an improved bound in Roth's theorem .
The sum of the reciprocals of the primes of the form 4n + 1 is divergent. By Fermat's theorem on sums of two squares, it follows that the sum of reciprocals of numbers of the form + , where a and b are non-negative integers, not both equal to 0, diverges, with or without repetition.
In number theory, Dirichlet's theorem, also called the Dirichlet prime number theorem, states that for any two positive coprime integers a and d, there are infinitely many primes of the form a + nd, where n is also a positive integer. In other words, there are infinitely many primes that are congruent to a modulo d.
The reciprocals of prime numbers produce a divergent series (so the set of primes is "large"; see divergence of the sum of the reciprocals of the primes): 1 2 + 1 3 + 1 5 + 1 7 + 1 11 + 1 13 + ⋯ → ∞ . {\displaystyle {1 \over 2}+{1 \over 3}+{1 \over 5}+{1 \over 7}+{1 \over 11}+{1 \over 13}+\cdots \rightarrow \infty .}
The convergence of the sum of reciprocals of twin primes follows from bounds on the density of the sequence of twin primes. Let π 2 ( x ) {\displaystyle \pi _{2}(x)} denote the number of primes p ≤ x for which p + 2 is also prime (i.e. π 2 ( x ) {\displaystyle \pi _{2}(x)} is the number of twin primes with the smaller at most x ).
In the limit, the sum of the reciprocals of the primes < n and the function ln(ln n) are separated by a constant, the Meissel–Mertens constant (labelled M above). The Meissel–Mertens constant (named after Ernst Meissel and Franz Mertens), also referred to as the Mertens constant, Kronecker's constant (after Leopold Kronecker), Hadamard–de la Vallée-Poussin constant (after Jacques ...
Paul Erdős proved that every sum-free sequence is small, and asked how large the sum of reciprocals could be. For instance, the sum of the reciprocals of the powers of two (a geometric series) is two. [1] If denotes the maximum sum of reciprocals of a sum-free sequence, then through subsequent research it is known that < <. [2]