I'm not sure how to properly word this question so please bear with me. If you look at the beginning of the prime number list it's obvious that the sequence is complete. At least up to a certain point. I was reading an article about a recently discovered prime number and it stated that Mersenne Prime's are currently being targeted. They referred to them as low hanging fruit and stated that many numbers are not being checked. So my question is at what point do we start having gaps in the "sequence" of prime numbers.
2026-04-06 10:57:13.1775473033
At what point are there gaps in the sequence of known prime numbers.
84 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
1
There are 1 best solutions below
Related Questions in ALGEBRA-PRECALCULUS
- How to show that $k < m_1+2$?
- What are the functions satisfying $f\left(2\sum_{i=0}^{\infty}\frac{a_i}{3^i}\right)=\sum_{i=0}^{\infty}\frac{a_i}{2^i}$
- Finding the value of cot 142.5°
- Why is the following $\frac{3^n}{3^{n+1}}$ equal to $\frac{1}{3}$?
- Extracting the S from formula
- Using trigonometric identities to simply the following expression $\tan\frac{\pi}{5} + 2\tan\frac{2\pi}{5}+ 4\cot\frac{4\pi}{5}=\cot\frac{\pi}{5}$
- Solving an equation involving binomial coefficients
- Is division inherently the last operation when using fraction notation or is the order of operation always PEMDAS?
- How is $\frac{\left(2\left(n+1\right)\right)!}{\left(n+1\right)!}\cdot \frac{n!}{\left(2n\right)!}$ simplified like that?
- How to solve algebraic equation
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 ARITHMETIC
- Solve this arithmetic question without algebra
- Is division inherently the last operation when using fraction notation or is the order of operation always PEMDAS?
- Upper bound for recursion?
- Proving in different ways that $n^{n-1}-1$ is divisible by $(n-1)^2$.
- Meaning of a percentage of something
- Compare $2^{2016}$ and $10^{605}$ without a calculator
- The older you are, the richer you get?
- Easy question which doesn't make sense to me!
- Calculating diminishing interest amount
- Multiplication Question
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?
It's not really a thing that's being kept track of. In general, we don't really store large primes; rather, we just recompute them when we need to. This is because it's cumbersome to store all the primes we know--and we know a lot of them. For instance, there are $37,607,912,018$ primes less than $1 \times 10^{12}$.
For pretty much any practical activity that requires use of large primes, it's easier to test for primality or simply generate primes than to store them and look them up. In this sense, the largest value of $x$ for which we know every single prime less than $x$ is really a function of who has the largest list on their hard drive.
And we know that it's a just a matter of generation (as opposed to a matter of gaps (ha!) in knowledge) because if we did know the largest $x$ for which we know every single prime less than $x$, then it would be trivial to just test primes above $x$ using sieve methods, and then we'd have a new $x$.