Question about the gaps between prime numbers

In summary, there is a conjecture known as Firoozbakht's conjecture that states that there exists a prime number pn with the relationship p_{n+1} > p_{n}^2. However, this has not been proven or disproven. It is also known that this relation contradicts Bertrand's Postulate, which states that there is always a prime number between n and 2n. This can easily be seen by comparing 2p_n to p^2_n. There is also a proof for arbitrary gaps, but it is limited by upper bounds.
  • #1
DuckAmuck
236
40
Is there any prime number pn, such that it has a relationship with the next prime number pn+1
[tex] p_{n+1} > p_{n}^2 [/tex]
If not, is there any proof saying a prime like this does not exist?

I have the exact same question about this relation:
[tex] p_{n+1} > 2p_{n} [/tex]
 
Physics news on Phys.org
  • #2
DuckAmuck said:
Is there any prime number pn, such that it has a relationship with the next prime number pn+1
[tex] p_{n+1} > p_{n}^2 [/tex]
If not, is there any proof saying a prime like this does not exist?

I have the exact same question about this relation:
[tex] p_{n+1} > 2p_{n} [/tex]
https://en.wikipedia.org/wiki/Prime_gap

There is also a proof for arbitrary gaps, but see the section "upper bounds".
 
  • #4
Interesting.Bertrand's Postulate answers the second part of my question. :)

I see Firoozbakht's conjecture, which is similar to my first part, but it's not quite the same thing as
[tex] p_{n+1} > p_{n}^2 [/tex]

I wonder if this can be proved or disproved from other postulates...
 
  • #5
DuckAmuck said:
Interesting.Bertrand's Postulate answers the second part of my question. :)

I see Firoozbakht's conjecture, which is similar to my first part, but it's not quite the same thing as
[tex] p_{n+1} > p_{n}^2 [/tex]

I wonder if this can be proved or disproved from other postulates...

This also follows very easily from Bertrand's postulate.
 
  • #6
DuckAmuck said:
but it's not quite the same thing as
[tex] p_{n+1} > p_{n}^2 [/tex]

I wonder if this can be proved or disproved from other postulates...

Compare ##2p_n## to ##p^2_n## .
 
  • #7
micromass said:
This also follows very easily from Bertrand's postulate.

Yeah it does. Wow. I'm dumb. :p
 

What are prime numbers?

Prime numbers are positive integers that are divisible only by 1 and themselves. Examples include 2, 3, 5, 7, 11, and so on.

What are the gaps between prime numbers?

The gaps between prime numbers refer to the difference between two consecutive prime numbers. For example, the gap between 3 and 5 is 2, the gap between 5 and 7 is 2, and so on.

Is there a pattern to the gaps between prime numbers?

There is currently no known pattern to the gaps between prime numbers. This is known as the "twin prime conjecture" and is still an unsolved problem in mathematics.

Why are the gaps between prime numbers important?

The study of prime numbers and their gaps has practical applications in cryptography, coding theory, and number theory. It also helps us better understand the distribution of prime numbers and their properties.

How can we find the gaps between prime numbers?

There are various mathematical techniques and algorithms, such as the Sieve of Eratosthenes, that can help us identify and calculate the gaps between prime numbers. However, as mentioned earlier, there is no known pattern to these gaps.

Similar threads

  • Set Theory, Logic, Probability, Statistics
Replies
17
Views
471
  • Precalculus Mathematics Homework Help
Replies
4
Views
1K
  • Precalculus Mathematics Homework Help
Replies
12
Views
1K
  • Precalculus Mathematics Homework Help
Replies
4
Views
1K
  • Calculus and Beyond Homework Help
Replies
13
Views
2K
Replies
5
Views
421
  • Programming and Computer Science
Replies
22
Views
762
  • Set Theory, Logic, Probability, Statistics
Replies
1
Views
815
  • Precalculus Mathematics Homework Help
Replies
9
Views
1K
  • Calculus and Beyond Homework Help
Replies
4
Views
889
Back
Top