is there any proofs for: "for any natural (n) there are prime numbers from n to 2n,including" ??
Jan 31, 2011 #1 limitkiller 80 0 is there any proofs for: "for any natural (n) there are prime numbers from n to 2n,including" ??
Feb 1, 2011 #2 Gib Z Homework Helper 3,346 6 This is known as "Bertrand's Postulate", and a long but elementary proof is contained here: http://en.wikipedia.org/wiki/Proof_of_Bertrand's_postulate
This is known as "Bertrand's Postulate", and a long but elementary proof is contained here: http://en.wikipedia.org/wiki/Proof_of_Bertrand's_postulate
Feb 5, 2011 #3 limitkiller 80 0 thanks but i had trouble understanding last part :"This gives us the contradiction:n < 468." could anyone help me with that
thanks but i had trouble understanding last part :"This gives us the contradiction:n < 468." could anyone help me with that