Prime numbers from (n) to (2n)

Click For Summary

Discussion Overview

The discussion centers around the existence of prime numbers in the interval from a natural number \( n \) to \( 2n \). Participants explore the implications of Bertrand's Postulate and seek clarification on specific aspects of its proof.

Discussion Character

  • Exploratory, Technical explanation, Debate/contested

Main Points Raised

  • One participant inquires about proofs for the existence of prime numbers between \( n \) and \( 2n \).
  • Another participant identifies this concept as Bertrand's Postulate and references a proof available on Wikipedia.
  • A different participant expresses difficulty in understanding a specific part of the proof, particularly regarding a contradiction involving the number 468.
  • A later post indicates a lack of responses to the request for clarification, suggesting a need for further assistance.

Areas of Agreement / Disagreement

Participants do not reach a consensus on the understanding of the proof, and there are unresolved questions regarding its details.

Contextual Notes

The discussion highlights a specific challenge in comprehending the proof's conclusion and its implications, indicating potential gaps in understanding or assumptions made in the proof.

limitkiller
Messages
80
Reaction score
0
is there any proofs for:
"for any natural (n) there are prime numbers from n to 2n,including" ??
 
Mathematics news on Phys.org
thanks
but i had trouble understanding last part :"This gives us the contradiction:n < 468."
could anyone help me with that
 
help...no one answered for a long time...
 

Similar threads

  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 8 ·
Replies
8
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 58 ·
2
Replies
58
Views
10K
  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 10 ·
Replies
10
Views
3K
  • · Replies 23 ·
Replies
23
Views
4K