With Zhang's theorem, and further work by others, if I understand it aright, there are infinitely many primes with a gap of less than or equal to 680. So, working from the opposite direction, it would be interesting if the sum of reciprocals of primes with gaps all less than or equal to a given bound(a bound greater than 2 this time), were still finite.(By the way, I don't consider this a duplication of other Brun questions on Stack exchange.)
2026-03-25 07:44:00.1774424640
Is or can Brun's twin prime theorem be generalized to a sum over all primes differing by less than a fixed gap?
51 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
1
There are 1 best solutions below
Related Questions in NUMBER-THEORY
- Maximum number of guaranteed coins to get in a "30 coins in 3 boxes" puzzle
- Interesting number theoretical game
- Show that $(x,y,z)$ is a primitive Pythagorean triple then either $x$ or $y$ is divisible by $3$.
- About polynomial value being perfect power.
- Name of Theorem for Coloring of $\{1, \dots, n\}$
- Reciprocal-totient function, in term of the totient function?
- What is the smallest integer $N>2$, such that $x^5+y^5 = N$ has a rational solution?
- Integer from base 10 to base 2
- How do I show that any natural number of this expression is a natural linear combination?
- Counting the number of solutions of the congruence $x^k\equiv h$ (mod q)
Related Questions in PRIME-NUMBERS
- New prime number
- Confirmation of Proof: $\forall n \in \mathbb{N}, \ \pi (n) \geqslant \frac{\log n}{2\log 2}$
- How do I prove this question involving primes?
- What exactly is the definition of Carmichael numbers?
- I'm having a problem interpreting and starting this problem with primes.
- Decimal expansion of $\frac{1}{p}$: what is its period?
- Multiplying prime numbers
- Find the number of relatively prime numbers from $10$ to $100$
- A congruence with the Euler's totient function and sum of divisors function
- Squares of two coprime numbers
Related Questions in SIEVE-THEORY
- Sieve of Eratosthenes : why $\sqrt n$ work?
- Bounding the number of semiprimes of the form $2p\pm1$
- Asymptotic relations of $x$ and $x/(\log\log x)$
- Modified sieve to find count all the divisors from 1 to n in o(n) time
- Finding Prime Factors of a number in $\log(n)$
- Probability that a random number avoids a set of prime divisors
- In the General Number Field Sieve, can we estimate the size of the matrix in terms of the number being factored?
- How to tell if a particular number will survive in this sieve?
- Generalization of Opperman's Conjecture
- How long would it take a computer to check that a number is not divisible by any 20-digit prime?
Trending Questions
- Induction on the number of equations
- How to convince a math teacher of this simple and obvious fact?
- Find $E[XY|Y+Z=1 ]$
- Refuting the Anti-Cantor Cranks
- What are imaginary numbers?
- Determine the adjoint of $\tilde Q(x)$ for $\tilde Q(x)u:=(Qu)(x)$ where $Q:U→L^2(Ω,ℝ^d$ is a Hilbert-Schmidt operator and $U$ is a Hilbert space
- Why does this innovative method of subtraction from a third grader always work?
- How do we know that the number $1$ is not equal to the number $-1$?
- What are the Implications of having VΩ as a model for a theory?
- Defining a Galois Field based on primitive element versus polynomial?
- Can't find the relationship between two columns of numbers. Please Help
- Is computer science a branch of mathematics?
- Is there a bijection of $\mathbb{R}^n$ with itself such that the forward map is connected but the inverse is not?
- Identification of a quadrilateral as a trapezoid, rectangle, or square
- Generator of inertia group in function field extension
Popular # Hahtags
second-order-logic
numerical-methods
puzzle
logic
probability
number-theory
winding-number
real-analysis
integration
calculus
complex-analysis
sequences-and-series
proof-writing
set-theory
functions
homotopy-theory
elementary-number-theory
ordinary-differential-equations
circles
derivatives
game-theory
definite-integrals
elementary-set-theory
limits
multivariable-calculus
geometry
algebraic-number-theory
proof-verification
partial-derivative
algebra-precalculus
Popular Questions
- What is the integral of 1/x?
- How many squares actually ARE in this picture? Is this a trick question with no right answer?
- Is a matrix multiplied with its transpose something special?
- What is the difference between independent and mutually exclusive events?
- Visually stunning math concepts which are easy to explain
- taylor series of $\ln(1+x)$?
- How to tell if a set of vectors spans a space?
- Calculus question taking derivative to find horizontal tangent line
- How to determine if a function is one-to-one?
- Determine if vectors are linearly independent
- What does it mean to have a determinant equal to zero?
- Is this Batman equation for real?
- How to find perpendicular vector to another vector?
- How to find mean and median from histogram
- How many sides does a circle have?
The answer is yes. The modern proofs of Brun's theorem show that for any fixed $k$, the number of primes $p\le x$ such that $p+k$ is also prime is at most $C_k x/(\log x)^2$, where $C_k$ is a constant depending on $k$. From this result, one can derive (using partial summation) the corollary that the sum of the reciprocals of these twin-prime-analogues converges for every fixed $k$. Of course, this in turn implies that the sum converges over all $k$ up to some bound such as $B=680$. Indeed, one can even take $B$ growing with $x$, for example $B=(\log x)^{0.999}$, and still have this result hold.