Prime numbers from (n) to (2n)

Click For Summary
SUMMARY

The forum discussion centers on Bertrand's Postulate, which asserts that for any natural number n, there exists at least one prime number in the interval from n to 2n. A long but elementary proof is referenced from Wikipedia. The user expresses confusion regarding the conclusion of the proof, specifically the statement "This gives us the contradiction: n < 468." This indicates a need for clarification on the implications of the proof's final steps.

PREREQUISITES
  • Understanding of prime numbers and their properties
  • Familiarity with Bertrand's Postulate
  • Basic knowledge of mathematical proofs
  • Ability to interpret mathematical contradictions
NEXT STEPS
  • Study the proof of Bertrand's Postulate in detail
  • Explore the implications of prime number distribution
  • Learn about mathematical contradictions and their significance in proofs
  • Investigate related topics such as the Prime Number Theorem
USEFUL FOR

Mathematicians, students studying number theory, and anyone interested in the properties of prime numbers and mathematical proofs.

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
1K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 58 ·
2
Replies
58
Views
9K
  • · Replies 10 ·
Replies
10
Views
3K
  • · Replies 23 ·
Replies
23
Views
4K