Does there exist an integer $s$ such that every integer $> 1$ can be written as a sum of at most $s$ primes ?
2026-03-26 03:11:20.1774494680
Does there exist an integer $s$ such that every integer $> 1$ can be written as a sum of at most $s$ primes?
73 Views Asked by user228168 https://math.techqa.club/user/user228168/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 ADDITIVE-COMBINATORICS
- Exercise 1.1.6 in Additive Combinatorics
- Show that $A+B$ contains at least $m+n-1$ elements.
- Advantage of Fourier transform on $\mathbb{Z}_N$
- Sorting on non-additive ratios
- Asymptotic formula for the integral sequence s(n)
- Show that $|A+A| < 2.5 |A| $ with $A = \{ [n \sqrt{2}] : 1 \leq n \leq N \}$
- show that $[n \sqrt{3}]$ is an approximate group
- A combinatoric solution (closed expression) for $\sum_{k=i}^n \binom{n}{k}p^k(1-p)^{n-k}$
- On Gowers' approach of Green-Tao Theorem ($\mathcal{D}f$s span $L^q(\mathbb{Z}_N)$).
- Is that specific function additive under disjoint union?
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?
Terrence Tao has proven that every odd number greater than one is the sum of at most five primes. Hence, using $3$ as a prime that we can substract to any even number greater than $5$, and noticing that $2$ is prime and $4=2+2$, every odd number is the sum of at most six primes.
As a conclusion, every number greater than one is the sum of at most six primes.
Of course, this is a very loose approximation. If it is proven, Goldbach's conjecture would allow us to lower the number of needed primes to $3$.