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" ??
General Math News on Phys.org Joining the dots: Mathematicians solve hot coloring problem Are US teenagers more likely than others to exaggerate their math abilities? Study says yes Mathematician proves that Möbius band must have an aspect ratio greater than √3
Feb 1, 2011 #2 Gib Z Homework Helper 3,351 7 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